{"id":"W2137498124","doi":"10.1006/jagm.2000.1132","title":"Efficient Algorithms for Petersen's Matching Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Carleton University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Algorithm; Planar graph; Discrete mathematics; Graph algorithms; Graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002402597,0.001840167,0.00196634,0.003121999,0.002177669,0.004190126,0.004763394,0.00250589,0.02500105],"category_scores_gemma":[0.01301606,0.001518416,0.002312041,0.004050779,0.001907417,0.01064037,0.007793262,0.004485045,0.005898353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00219885,"about_ca_system_score_gemma":0.001980248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002095994,"about_ca_topic_score_gemma":0.002784924,"domain_scores_codex":[0.9973839,0.0004563719,0.0001709809,0.0006285242,0.001045505,0.0003148154],"domain_scores_gemma":[0.9962823,0.001991806,0.0001694982,0.001002063,0.0004330401,0.0001214075],"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.0003441833,0.0002809137,0.0006326685,0.000338125,0.0001255456,0.000112926,0.0002454687,0.04032287,0.003174034,0.5407573,0.01936178,0.3943043],"study_design_scores_gemma":[0.0001242989,0.00005452181,0.0001913473,0.00003148341,0.00006736353,0.0001018752,0.00009887238,0.2457337,0.00383392,0.7381524,0.01158015,0.00003002538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01094254,0.0003645445,0.9697534,0.0005820723,0.0002044393,0.0001790681,0.0002063931,0.001439559,0.0163279],"genre_scores_gemma":[0.15024,0.0006209345,0.8315092,0.0002861572,0.0002420528,0.0004131692,0.0009670717,0.001026402,0.01469503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02500105,"threshold_uncertainty_score":0.08363682,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02189423848872213,"score_gpt":0.2809147616313767,"score_spread":0.2590205231426546,"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."}}