{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007663241,0.0001225138,0.0002625963,0.0001152467,0.0001671822,0.0001074092,0.0008698976,0.0000361782,0.0001918346],"category_scores_gemma":[0.00002151266,0.00009506506,0.0001750151,0.0002588193,0.00007785718,0.0007547367,0.0003489157,0.0001137622,0.00008979963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009348936,"about_ca_system_score_gemma":0.00001792712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002649119,"about_ca_topic_score_gemma":0.000007343054,"domain_scores_codex":[0.9989273,0.0000818948,0.0002593079,0.0002528657,0.0001939368,0.0002847242],"domain_scores_gemma":[0.9992653,0.0001302492,0.00006395167,0.0004170572,0.00004013577,0.00008333362],"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.0001498297,0.00003158093,0.000009756998,0.000004115211,0.00002177645,0.00001090244,0.002649708,0.000001955613,0.00001480009,0.9504569,0.00009492235,0.04655376],"study_design_scores_gemma":[0.02804582,0.00003286201,0.0001241085,0.00002020418,0.00001036363,0.00006149182,0.0001415005,0.1559012,0.002426367,0.8118025,0.001083754,0.0003497679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001038819,0.00006461424,0.887192,0.0001009337,0.0004509821,0.0001450912,3.057561e-7,0.000380959,0.1106263],"genre_scores_gemma":[0.1558438,0.0000173856,0.8431008,0.0004867231,0.00005007644,0.00002092644,5.805158e-7,0.0000065198,0.0004732004],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1558993,"threshold_uncertainty_score":0.387664,"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."}}