{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007001785,0.0004008722,0.0003515952,0.0001063385,0.0003525417,0.0001636017,0.0006443008,0.0002389968,0.00007382333],"category_scores_gemma":[0.0002566189,0.0003004152,0.000347704,0.0005967619,0.0003361797,0.00008601746,0.0001686338,0.0004889502,0.000511398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000145887,"about_ca_system_score_gemma":0.00004502578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001660475,"about_ca_topic_score_gemma":0.00000804002,"domain_scores_codex":[0.9977254,0.00005732526,0.0006478204,0.0003796954,0.0007180812,0.0004716413],"domain_scores_gemma":[0.997422,0.001017515,0.0003447677,0.001023004,0.00003625037,0.0001564028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001315206,0.0001195341,8.660009e-7,0.000667323,0.0001517797,0.00001726436,0.001101447,0.002712287,0.00634195,0.9881603,0.0004945671,0.000101121],"study_design_scores_gemma":[0.0003845452,0.0002478465,0.00003371615,0.0003364825,0.0001572926,0.00001401103,0.001421042,0.9732913,0.01777709,0.005276488,0.0007154864,0.0003446825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9869207,0.0000872634,0.005326861,0.000454258,0.0002703053,0.0002480002,0.000140679,0.0002104455,0.006341507],"genre_scores_gemma":[0.9976217,0.00002303149,0.001028193,0.0007154429,0.0001925943,0.0002041468,0.00006426432,0.0001376236,0.00001300795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9828839,"threshold_uncertainty_score":0.9999448,"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."}}