{"id":"W2010049762","doi":"10.1016/j.disopt.2006.01.001","title":"Facets of the independent path-matching polytope","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Matching (statistics); Mathematics; Combinatorics; Path (computing); Birkhoff polytope; Convex polytope; Independent set; Convex hull; Intersection (aeronautics); Matroid; Regular polygon; Convex set; Computer science; Convex optimization; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.000451766,0.0008311935,0.001426687,0.001270079,0.001058059,0.004088466,0.001533148,0.001157418,0.01815318],"category_scores_gemma":[0.002741854,0.00071896,0.0009373374,0.001823667,0.001442113,0.002670493,0.001929795,0.002602088,0.001777786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001296116,"about_ca_system_score_gemma":0.0009530027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003912771,"about_ca_topic_score_gemma":0.002357429,"domain_scores_codex":[0.9993808,0.0001048438,0.00002213613,0.0001254414,0.0002578138,0.0001089292],"domain_scores_gemma":[0.9990507,0.0004244855,0.0001540444,0.00009477123,0.00009549312,0.0001805879],"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.0002508376,0.0001618809,0.001707213,0.0002976272,0.00007302772,0.0002398509,0.0002490979,0.09438392,0.002873134,0.8486503,0.01355511,0.03755805],"study_design_scores_gemma":[0.00007428816,0.00006237593,0.001606092,0.00007364309,0.00003313332,0.0002422897,0.0002315225,0.2179206,0.001535074,0.766916,0.01127385,0.00003123262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2948464,0.001334479,0.4967643,0.001645313,0.0002050254,0.0003437219,0.004439203,0.0003842826,0.2000372],"genre_scores_gemma":[0.837739,0.00231117,0.1001714,0.0002928028,0.0003134128,0.000534986,0.005022324,0.0004200127,0.05319507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01815318,"threshold_uncertainty_score":0.06072849,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007936245868375578,"score_gpt":0.2477247421725551,"score_spread":0.2397884963041795,"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."}}