{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002223292,0.00008263501,0.00008791839,0.00006501845,0.000134912,0.00006430189,0.0007227067,0.00003989411,0.00001517062],"category_scores_gemma":[0.00002929514,0.00005866845,0.00005747778,0.0004688841,0.00005798626,0.0004235035,0.0002961545,0.0001079341,0.000003794034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002608431,"about_ca_system_score_gemma":0.00003313738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005573417,"about_ca_topic_score_gemma":0.000009056662,"domain_scores_codex":[0.9989373,0.000111039,0.0001838541,0.0002052278,0.0003822888,0.0001802816],"domain_scores_gemma":[0.9992502,0.00004065346,0.0001157345,0.0004879238,0.0000792416,0.00002624379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003897214,0.00001712028,0.0008623031,0.000005741525,0.000003498204,7.271238e-7,0.0001774603,0.8402511,0.001868387,0.1559835,0.00002620752,0.0008000817],"study_design_scores_gemma":[0.0005090741,0.00004541298,0.008655564,0.00005619941,0.000006270661,0.00000791356,0.0000932812,0.8843114,0.01841475,0.08750283,0.0001464325,0.0002508454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01239336,0.00006001016,0.9832856,0.0003572616,0.0001126315,0.0001817849,0.00000407221,0.00004725003,0.003558018],"genre_scores_gemma":[0.9390572,0.000006954891,0.06050607,0.00003686908,0.00001828372,0.000007762536,0.000005997924,0.000008773607,0.000352144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9266638,"threshold_uncertainty_score":0.239243,"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."}}