{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001287157,0.000897551,0.002022942,0.001419385,0.001947118,0.005054396,0.002564521,0.002122837,0.007666898],"category_scores_gemma":[0.009651206,0.0009666898,0.001683617,0.001850616,0.003819386,0.009176262,0.003456126,0.003526721,0.0009041301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002261862,"about_ca_system_score_gemma":0.0008287671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001553946,"about_ca_topic_score_gemma":0.0007459348,"domain_scores_codex":[0.9980878,0.0002800733,0.00008558821,0.0008019726,0.0003687197,0.0003758777],"domain_scores_gemma":[0.9882262,0.008853714,0.0007863815,0.0008382723,0.0004055737,0.0008898565],"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.0007532857,0.0002538481,0.005831083,0.0008176199,0.0001291547,0.0004631962,0.0009022676,0.1254234,0.008582876,0.8023379,0.01686225,0.03764301],"study_design_scores_gemma":[0.00008212234,0.0001271467,0.003179362,0.0001057403,0.00005355327,0.0007764483,0.0003766716,0.1611651,0.003368432,0.8163098,0.01438863,0.00006699416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5135076,0.007345877,0.3726351,0.01379849,0.000451246,0.000168096,0.004393798,0.0008232925,0.0868765],"genre_scores_gemma":[0.9255984,0.003920896,0.0563907,0.0008879292,0.001013031,0.0003138697,0.001563157,0.0003000884,0.01001187],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007666898,"threshold_uncertainty_score":0.0256483,"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."}}