{"id":"W2806170931","doi":"10.1109/focs.2018.00090","title":"The Diameter of the Fractional Matching Polytope and Its Hardness Implications","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Polytope; Mathematics; Birkhoff polytope; Matching (statistics); Path (computing); Graph; Shortest path problem; Uniform k 21 polytope; Discrete mathematics; Geometry; Computer science; Regular polygon","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.0003015908,0.0001191359,0.0001194645,0.00003823039,0.0005248797,0.0002528009,0.001715378,0.00007407137,0.00002165256],"category_scores_gemma":[0.00003929699,0.00006457644,0.0001088735,0.0001489559,0.0001646465,0.0001204995,0.002379527,0.0003171734,0.000006353763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001394828,"about_ca_system_score_gemma":0.00009501776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007235537,"about_ca_topic_score_gemma":0.00003949686,"domain_scores_codex":[0.9990496,0.00007353313,0.0002097138,0.000314454,0.0002129865,0.0001396806],"domain_scores_gemma":[0.9984336,0.0002817191,0.0001689474,0.0009373372,0.0001430588,0.00003529345],"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.000002355337,0.0000501522,0.0007668316,0.0000379957,0.00008510491,1.676629e-7,0.0006172024,0.00004834463,0.0002853984,0.9686747,0.002957974,0.02647379],"study_design_scores_gemma":[0.00008297278,0.00001364044,0.1176858,0.00007414717,0.00001535885,0.00002116835,0.00003127177,0.02104354,0.00155198,0.8502907,0.008969152,0.000220256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01151245,0.0004242911,0.9645655,0.01556962,0.002626056,0.0003637304,0.00003793807,0.000076916,0.004823496],"genre_scores_gemma":[0.9313638,0.0002051785,0.06481059,0.0008987532,0.0003874296,0.0001007316,0.000003826577,0.00001556035,0.002214084],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9198514,"threshold_uncertainty_score":0.4037004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03782070556246582,"score_gpt":0.2833110165183674,"score_spread":0.2454903109559016,"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."}}