{"id":"W4389224571","doi":"10.1287/moor.2022.0335","title":"Proximity and Flatness Bounds for Linear Integer Optimization","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Polyhedron; Combinatorics; Unimodular matrix; Cutting-plane method; Integer programming; Integer (computer science); Linear programming; Linear programming relaxation; Integer points in convex polyhedra; Hyperplane; Vertex (graph theory); Polytope; Regular polygon; Discrete mathematics; Branch and price; Mathematical optimization; Computer science; Geometry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.003127204,0.00008287509,0.0001588174,0.0005779763,0.0004534711,0.000205675,0.0006458498,0.00005768371,0.00001257202],"category_scores_gemma":[0.001642911,0.00007250248,0.00003483534,0.001620486,0.0002604847,0.0006178936,0.0004921997,0.0001845507,0.00002072452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002855337,"about_ca_system_score_gemma":0.0001322126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005208125,"about_ca_topic_score_gemma":0.000009210828,"domain_scores_codex":[0.9984334,0.0001247814,0.0002756693,0.0002725309,0.00055367,0.0003399223],"domain_scores_gemma":[0.9974735,0.0007858333,0.00002150228,0.0005714872,0.001066149,0.00008157371],"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.000009341585,0.0001329607,0.00002019821,0.0003066025,0.00001909732,0.000001598242,0.002393463,0.1256794,0.003001369,0.8661671,0.0002782286,0.001990706],"study_design_scores_gemma":[0.0001941728,0.00009700214,0.00001224378,0.0000349269,0.000001390138,0.000002914476,0.0002590437,0.9317005,0.004064215,0.0634445,0.0001205206,0.00006859446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02491623,0.00002795085,0.9726359,0.000941544,0.00003397413,0.000891408,0.00001117317,0.00008677624,0.0004550897],"genre_scores_gemma":[0.1710272,0.00007109307,0.8257183,0.00000872727,0.00003535342,0.0004580245,0.00002000619,0.00002425772,0.002636997],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8060211,"threshold_uncertainty_score":0.3487779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1320531363559367,"score_gpt":0.4352795687934838,"score_spread":0.3032264324375471,"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."}}