{"id":"W6891657421","doi":"10.48550/arxiv.1103.5215","title":"Formalizing Randomized Matching Algorithms","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Correctness; Lemma (botany); Matching (statistics); Time complexity; Blossom algorithm; Probabilistic logic; 3-dimensional matching","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009887913,0.0004784914,0.0008826173,0.0004527864,0.0003481271,0.0002586186,0.003358684,0.0003301417,0.00007007062],"category_scores_gemma":[0.00003991693,0.000517856,0.0007664513,0.0005828349,0.0002776046,0.0007635814,0.004548563,0.0009620212,0.0001057686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001186082,"about_ca_system_score_gemma":0.000155997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000673557,"about_ca_topic_score_gemma":0.00002773315,"domain_scores_codex":[0.9972436,0.0003581244,0.0003921377,0.001283153,0.0001469422,0.000576061],"domain_scores_gemma":[0.9972987,0.000286424,0.0004234339,0.001614247,0.0001527839,0.000224375],"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.0005518547,0.00008332853,0.00003249314,0.00007914119,0.0002132527,0.0003091435,0.001220285,0.01258038,0.000003778229,0.9818426,0.00008977353,0.002993993],"study_design_scores_gemma":[0.009504284,0.00001484223,0.00002358372,0.0001051592,0.00006951249,0.0000114204,0.00005113959,0.4151569,0.00006026992,0.5743362,0.0001903785,0.0004762916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01786314,0.0001714322,0.965017,0.00005472041,0.001648795,0.0005091205,0.00001014183,0.0006040829,0.01412155],"genre_scores_gemma":[0.9376555,0.0003702092,0.06052463,0.00016222,0.0001551302,0.000003981752,0.00001527349,0.00002902222,0.001084003],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9197924,"threshold_uncertainty_score":0.9997273,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1009554872390941,"score_gpt":0.1969125521889747,"score_spread":0.0959570649498806,"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."}}