{"id":"W2155466993","doi":"10.1007/s101070100256","title":"Matching, matroids, and extensions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Intersection (aeronautics); Matching (statistics); Jump; Path (computing); Mathematical optimization; Matroid partitioning; Combinatorial optimization; Combinatorics; Computer science; Graphic matroid","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003650503,0.0001264199,0.000168523,0.00008926821,0.0002053761,0.0002352398,0.0004503419,0.00004407496,0.0001010121],"category_scores_gemma":[0.0001228512,0.0001029518,0.00004940806,0.0002958639,0.0001437323,0.0003348941,0.0004070876,0.0002014089,0.0003156834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001284763,"about_ca_system_score_gemma":0.00000338283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001106732,"about_ca_topic_score_gemma":4.211711e-7,"domain_scores_codex":[0.9986939,0.00005607458,0.0002007508,0.0003221983,0.0002981989,0.0004288416],"domain_scores_gemma":[0.9989765,0.0002696671,0.00003745674,0.0004862956,0.00003769038,0.0001923873],"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":[7.140889e-7,0.00008502819,0.00001188428,0.00004678502,0.000006351653,0.00002697506,0.0008254477,0.000001843513,0.0004298041,0.8136287,0.00006297431,0.1848735],"study_design_scores_gemma":[0.0001691976,0.00006488729,0.00002379563,0.00005047045,0.000004400011,0.0001661593,0.0001270064,0.02864275,0.0002185754,0.9678823,0.002469232,0.0001812033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0227023,0.0003877573,0.9718021,0.0009523254,0.00003446501,0.0002730313,3.028896e-7,0.0003807093,0.003466988],"genre_scores_gemma":[0.4663865,0.00001303957,0.5328885,0.00008520607,0.00002065588,0.00003629862,1.925303e-7,0.00001393191,0.0005556981],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4436842,"threshold_uncertainty_score":0.4198254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03674678384377213,"score_gpt":0.2923804867600973,"score_spread":0.2556337029163252,"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."}}