{"id":"W3006858192","doi":"10.1137/18m1169710","title":"A notion of total dual integrality for convex, semidefinite, and extended formulations","year":2020,"lang":"pt","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Office of Naval Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Polytope; Mathematics; Semidefinite programming; Combinatorics; Polyhedral combinatorics; Generalization; Linear programming; Rank (graph theory); Duality (order theory); Maximum cut; Linear programming relaxation; Integer programming; Convex analysis; Regular polygon; Dual (grammatical number); Discrete mathematics; Cutting-plane method; Convex optimization; Mathematical optimization; Convex set; Graph","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.00276181,0.0009860331,0.0008064801,0.00141472,0.0008966582,0.003878822,0.001354545,0.0007929942,0.004831987],"category_scores_gemma":[0.005218378,0.0004540092,0.001460397,0.001405903,0.00432674,0.005812507,0.002971757,0.005380826,0.0005718106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00211225,"about_ca_system_score_gemma":0.001009466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005221912,"about_ca_topic_score_gemma":0.0004250734,"domain_scores_codex":[0.9980981,0.0005300264,0.0001275117,0.0003849245,0.0006397428,0.0002196365],"domain_scores_gemma":[0.9975188,0.001030482,0.0003357609,0.000456566,0.000437891,0.0002205549],"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.000009235968,0.00001514959,0.00009074563,0.00003620513,0.00001120723,0.00003454712,0.0001401499,0.006201375,0.0005973956,0.9854821,0.0004842554,0.00689753],"study_design_scores_gemma":[0.00001327501,0.00005942307,0.0001761887,0.00007579025,0.00002508531,0.0001546894,0.0001345255,0.07151078,0.001509227,0.9093947,0.01692414,0.00002214299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02066615,0.0006638899,0.9347072,0.0008934969,0.0001374423,0.00006785632,0.0001700227,0.0001006203,0.04259334],"genre_scores_gemma":[0.6725442,0.001658901,0.3096543,0.0008394996,0.0007486729,0.0003624048,0.0003945733,0.0002466924,0.01355077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004831987,"threshold_uncertainty_score":0.01616466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04571706200810552,"score_gpt":0.2681223265057611,"score_spread":0.2224052644976556,"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."}}