{"id":"W3104490375","doi":"10.1016/j.dam.2020.09.028","title":"A geometric lower bound on the extension complexity of polytopes based on the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e1733\" altimg=\"si5.svg\"> <mml:mi>f</mml:mi> </mml:math> -vector","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Fonds Wetenschappelijk Onderzoek; Fédération Wallonie-Bruxelles; Fonds De La Recherche Scientifique - FNRS; European Resuscitation Council; European Research Council; Institut national de la recherche scientifique","keywords":"Polytope; Mathematics; Combinatorics; Extension (predicate logic); Rank (graph theory); Affine transformation; Monotone polygon; Generalization; Polyhedral combinatorics; Upper and lower bounds; Matrix (chemical analysis); Polytope model; Discrete mathematics; Computer science; Geometry; Regular polygon","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610162,0.001950023,0.001938978,0.002849009,0.001645426,0.005665141,0.003340991,0.001992064,0.0294125],"category_scores_gemma":[0.01244043,0.0007986782,0.001975908,0.003020536,0.003381792,0.01034019,0.004872855,0.008315543,0.004737844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003245156,"about_ca_system_score_gemma":0.001500163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001759236,"about_ca_topic_score_gemma":0.002714718,"domain_scores_codex":[0.9975406,0.000410653,0.00008139249,0.0005797733,0.0009017567,0.0004858914],"domain_scores_gemma":[0.9847962,0.01093435,0.0006914808,0.001527903,0.0008535453,0.001196553],"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.0004929811,0.0002964844,0.002433198,0.0006153378,0.000117317,0.0002694834,0.0004052099,0.09412631,0.004956358,0.7951101,0.04004553,0.06113166],"study_design_scores_gemma":[0.00005257093,0.0001784776,0.001936512,0.0001359493,0.00006072341,0.0003890314,0.0001506264,0.1818386,0.002099382,0.7962548,0.01683101,0.00007239162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1921995,0.004859093,0.546976,0.01034756,0.0008725397,0.0002626251,0.00381783,0.001254521,0.2394103],"genre_scores_gemma":[0.8073248,0.004471168,0.1242866,0.001814414,0.001717804,0.0007619873,0.00566736,0.0009472365,0.05300853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0294125,"threshold_uncertainty_score":0.09839463,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02682975593205257,"score_gpt":0.2244754818188394,"score_spread":0.1976457258867868,"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."}}