{"id":"W1980738047","doi":"10.2168/lmcs-8(3:5)2012","title":"Formalizing Randomized Matching Algorithms","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Correctness; 3-dimensional matching; Blossom algorithm; Lemma (botany); Perfect graph theorem; Algorithm; Matching (statistics); Factor-critical graph; Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Graph; Voltage graph; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.01152825,0.001468442,0.00156954,0.002498942,0.00193955,0.007112833,0.00684275,0.003745958,0.009845927],"category_scores_gemma":[0.04004193,0.001421412,0.003002209,0.002877635,0.007599775,0.01683847,0.007191394,0.006080611,0.00216334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005875064,"about_ca_system_score_gemma":0.005593563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003917004,"about_ca_topic_score_gemma":0.002996496,"domain_scores_codex":[0.9808087,0.006780409,0.001519783,0.003841303,0.00524371,0.001806058],"domain_scores_gemma":[0.9770048,0.01537024,0.001147927,0.004188354,0.001945643,0.0003431461],"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.00001559623,0.00002117067,0.00006913023,0.00004930823,0.00001014043,0.00002137607,0.00006212066,0.00956394,0.0002290518,0.9832504,0.0006008709,0.00610684],"study_design_scores_gemma":[0.00003606428,0.00001919586,0.00003672407,0.00003445261,0.00001539107,0.00003322971,0.00002954711,0.08366531,0.0008629771,0.9091195,0.006130344,0.00001725316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003885423,0.0002940015,0.984519,0.0009067827,0.0001205726,0.0001495125,0.0001886133,0.0007838762,0.009152249],"genre_scores_gemma":[0.2739037,0.001155956,0.710121,0.001390999,0.0005283694,0.001067074,0.0009500904,0.0006647817,0.01021803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01152825,"threshold_uncertainty_score":0.06096798,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08537728207017845,"score_gpt":0.3975713719226918,"score_spread":0.3121940898525133,"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."}}