{"id":"W2951693280","doi":"10.48550/arxiv.1302.2340","title":"On the extension complexity of combinatorial polytopes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Polytope; Extension (predicate logic); Combinatorics; Mathematics; Polyhedron; Matching (statistics); Exponential function; Discrete mathematics; Graph; Computational complexity theory; Computer science; Algorithm","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.001639267,0.0009799924,0.001454082,0.001486038,0.001158143,0.002807646,0.002167398,0.001008276,0.008616977],"category_scores_gemma":[0.01044708,0.0005892526,0.002092396,0.002471751,0.003306457,0.0121307,0.004728782,0.00771097,0.0006411569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001811275,"about_ca_system_score_gemma":0.0006805168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001096114,"about_ca_topic_score_gemma":0.0008635407,"domain_scores_codex":[0.9974004,0.0005429371,0.0001003752,0.0005084105,0.001030013,0.0004178696],"domain_scores_gemma":[0.9834924,0.01247051,0.0006095625,0.00203615,0.0007168575,0.0006746135],"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.000433508,0.0002504883,0.004453929,0.000612189,0.0000883335,0.0005501691,0.0009015664,0.1228229,0.006780931,0.7903929,0.006685483,0.06602769],"study_design_scores_gemma":[0.00003711312,0.00007853574,0.001718792,0.00006551371,0.00003175992,0.0004173185,0.000153066,0.1381111,0.001633695,0.8500143,0.007699977,0.00003884655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4380221,0.002641457,0.4924032,0.004379783,0.0002629542,0.0002389483,0.00121657,0.0005034722,0.06033151],"genre_scores_gemma":[0.8992285,0.002773876,0.08479352,0.0007795956,0.0006507748,0.0003480863,0.002110556,0.0003071323,0.009007934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008616977,"threshold_uncertainty_score":0.02882665,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1383732506337186,"score_gpt":0.2300994550027943,"score_spread":0.09172620436907575,"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."}}