{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004764641,0.0002532587,0.0003331148,0.0002264002,0.0002096036,0.00006992133,0.003258805,0.0001827293,0.00008036504],"category_scores_gemma":[0.0001486692,0.0002055289,0.000209267,0.0005754845,0.0007201135,0.0002296182,0.003399776,0.0007945042,0.0001266693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009867772,"about_ca_system_score_gemma":0.0001180922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001506991,"about_ca_topic_score_gemma":0.00000400521,"domain_scores_codex":[0.9979798,0.0004533975,0.0001858679,0.0008320735,0.000209362,0.000339476],"domain_scores_gemma":[0.9965307,0.0006103874,0.000258733,0.002155266,0.0003228695,0.0001220112],"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.0000503913,0.0001040426,0.00008843361,0.0000221919,0.00003495682,0.00003115911,0.0000715752,0.00812024,0.0001794421,0.9907549,0.0003639695,0.0001786672],"study_design_scores_gemma":[0.0002914838,0.00009786005,0.0007395284,0.00006628071,0.000009589233,0.000001079851,0.00002835709,0.08888574,0.001159386,0.9084476,0.00007811712,0.0001949484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7688595,0.00003515696,0.2249805,0.000461726,0.001091041,0.000653877,0.00001572497,0.0001493747,0.003753027],"genre_scores_gemma":[0.9986777,0.00004015115,0.0007251754,0.00008251429,0.00004020185,0.000001286941,0.000003645048,0.00001308468,0.0004162111],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2298182,"threshold_uncertainty_score":0.8381224,"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."}}