{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009394324,0.000124759,0.0001998103,0.0002616922,0.0001555481,0.0001644622,0.0004388571,0.00004526262,0.00001128937],"category_scores_gemma":[0.00005953081,0.000102486,0.0001962055,0.0003870031,0.00002106226,0.0002563613,0.00006682112,0.0001429057,0.000009473863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006341947,"about_ca_system_score_gemma":0.0001120583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002082536,"about_ca_topic_score_gemma":3.847944e-7,"domain_scores_codex":[0.9986444,0.00005212073,0.0004438589,0.0001787183,0.000449665,0.0002312753],"domain_scores_gemma":[0.9987185,0.0002258097,0.0003360417,0.0001707815,0.0004210463,0.0001278209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007553714,0.0003625984,0.00002722448,0.00002230393,0.000123549,0.0001782988,0.001787364,0.3513112,0.003272425,0.04746327,0.001693009,0.5936832],"study_design_scores_gemma":[0.001169854,0.0004405018,0.0006613691,0.00004263046,0.00002151333,0.001283424,0.0001243449,0.948006,0.001198061,0.03418802,0.01264864,0.0002156842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03921706,0.0002254088,0.9568641,0.001690489,0.001594943,0.000118683,0.000002199258,0.00002671662,0.0002604171],"genre_scores_gemma":[0.3059763,0.00003339555,0.6919147,0.0004046193,0.001309101,0.000004827707,0.000002451188,0.00001271884,0.0003418901],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5966948,"threshold_uncertainty_score":0.4179258,"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."}}