{"id":"W1551570706","doi":"10.1137/070684008","title":"Algebraic Algorithms for Matching and Matroid Problems","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Matroid; Mathematics; Combinatorics; Algebraic number; Intersection (aeronautics); Weighted matroid; Matching (statistics); Discrete mathematics; Simple (philosophy); Oriented matroid; Matrix (chemical analysis); Exponent; Rank (graph theory); Matrix multiplication; Graphic matroid; Matroid partitioning","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002601706,0.001392282,0.001366529,0.001986297,0.002022164,0.00521943,0.004403596,0.002284169,0.01260582],"category_scores_gemma":[0.01558068,0.0008309532,0.002128229,0.004436395,0.003335326,0.01465491,0.005701094,0.005853811,0.003255917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002845425,"about_ca_system_score_gemma":0.002555684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001188722,"about_ca_topic_score_gemma":0.001780525,"domain_scores_codex":[0.9936231,0.001797487,0.0004685923,0.00144213,0.002165708,0.0005029688],"domain_scores_gemma":[0.9904492,0.005180854,0.0008457548,0.002413563,0.0007797063,0.0003308333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009948654,0.0002383101,0.000290811,0.0004428412,0.00006046785,0.00003879391,0.0001844362,0.02181992,0.001541637,0.8285425,0.007486299,0.1392544],"study_design_scores_gemma":[0.00007520257,0.0000482628,0.0001034299,0.00004051639,0.00002901984,0.000131076,0.00008792524,0.1033316,0.001602662,0.8769279,0.01759239,0.00003007938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006312417,0.000989981,0.9745786,0.001778998,0.0001840567,0.0001944401,0.0001708902,0.0007764049,0.0150143],"genre_scores_gemma":[0.1309593,0.002230383,0.8549404,0.0007920614,0.0007959444,0.0006363788,0.000983419,0.0003532871,0.008308799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01260582,"threshold_uncertainty_score":0.04217064,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02852177057779009,"score_gpt":0.28192901818277,"score_spread":0.2534072476049799,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}