{"id":"W2152454366","doi":"10.1109/lics.2011.12","title":"Formalizing Randomized Matching Algorithms","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Correctness; Lemma (botany); Blossom algorithm; 3-dimensional matching; Factor-critical graph; Algorithm; Matching (statistics); Perfect graph theorem; Computer science; Mathematics; Probabilistic logic; Theoretical computer science; Discrete mathematics; Graph; Voltage graph; Line graph; Artificial intelligence","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.01178818,0.001507913,0.001752091,0.002596661,0.002129358,0.007137114,0.006621249,0.003580708,0.00981042],"category_scores_gemma":[0.04175298,0.001349379,0.002970616,0.003355735,0.007718975,0.01671685,0.007051131,0.006069554,0.002144354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005956349,"about_ca_system_score_gemma":0.00558495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003900213,"about_ca_topic_score_gemma":0.002909727,"domain_scores_codex":[0.9813638,0.006559605,0.001404058,0.003668785,0.005305371,0.00169841],"domain_scores_gemma":[0.9781781,0.01437968,0.001072711,0.004112741,0.001906768,0.0003500589],"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.00001582875,0.00001943443,0.00006559434,0.00005281632,0.000009758481,0.00002054763,0.00006335408,0.01100804,0.0001872369,0.9815133,0.0006425674,0.006401472],"study_design_scores_gemma":[0.00003300095,0.00001683997,0.0000308294,0.00003143005,0.0000129263,0.00003045753,0.00002582886,0.07266652,0.0006390578,0.9202565,0.006241168,0.00001533526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003481639,0.0003589223,0.9842054,0.0009495332,0.0001240811,0.000151326,0.0001942146,0.0007497299,0.009785188],"genre_scores_gemma":[0.26932,0.001294854,0.7150337,0.001376699,0.0005791606,0.001050103,0.0009767979,0.0006353182,0.009733326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01178818,"threshold_uncertainty_score":0.06234258,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05007996934658687,"score_gpt":0.2462436088302597,"score_spread":0.1961636394836728,"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."}}