{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01130144,0.00156226,0.001725893,0.002759757,0.002116191,0.007461629,0.006568843,0.003650783,0.009529171],"category_scores_gemma":[0.04194719,0.001367037,0.002917027,0.003482807,0.008176336,0.01722493,0.007212382,0.00633244,0.002038959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006449532,"about_ca_system_score_gemma":0.005279172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003955394,"about_ca_topic_score_gemma":0.002877158,"domain_scores_codex":[0.9813039,0.006524013,0.00142148,0.003748936,0.005365806,0.001635943],"domain_scores_gemma":[0.9776833,0.0147192,0.001083919,0.004295093,0.001859461,0.0003590999],"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.0000139115,0.00001776924,0.00006718044,0.00005142505,0.000008811441,0.00001899221,0.00006393893,0.01021242,0.0001768044,0.9833819,0.0005930206,0.005393858],"study_design_scores_gemma":[0.00002811435,0.00001417601,0.00003216964,0.00002911955,0.00001118307,0.00002819281,0.00002471344,0.06519224,0.0005786957,0.9279929,0.006053994,0.00001443916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004030573,0.0004123915,0.98218,0.001156006,0.0001355634,0.0001590745,0.000227802,0.000765018,0.01093344],"genre_scores_gemma":[0.2909136,0.00139442,0.6926944,0.001457407,0.0006364078,0.001109505,0.001053031,0.0006826848,0.01005857],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01130144,"threshold_uncertainty_score":0.05976844,"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."}}