{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006116548,0.000527298,0.0007595989,0.0003509024,0.0006697135,0.0003422003,0.0006205838,0.0004879847,0.00001816363],"category_scores_gemma":[0.001218845,0.0005513986,0.000405263,0.001096501,0.00007349953,0.0009717195,0.0006032555,0.0006126207,0.000003383186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002195652,"about_ca_system_score_gemma":0.0005310607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002444258,"about_ca_topic_score_gemma":0.00005695589,"domain_scores_codex":[0.9960306,0.0003278173,0.001138943,0.001065495,0.000747913,0.0006892657],"domain_scores_gemma":[0.9964999,0.0007114333,0.0006638331,0.0005988204,0.0008801938,0.0006458366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002743408,0.0007138078,0.0001653763,0.0004169608,0.0001877992,0.00002874755,0.005329983,0.0001054417,0.002428871,0.9812183,0.0005695767,0.008560738],"study_design_scores_gemma":[0.007394688,0.00210774,0.03037877,0.0008055341,0.000484808,0.00183974,0.001466887,0.3212649,0.006295656,0.01336892,0.6123816,0.002210748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1068356,0.00150884,0.7971929,0.07081798,0.002022548,0.002824686,0.0007795612,0.00074352,0.01727439],"genre_scores_gemma":[0.9785954,0.00005765877,0.0201324,0.0003501444,0.0004411476,0.0001332868,0.0001486601,0.0000357076,0.000105589],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9678494,"threshold_uncertainty_score":0.9996938,"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."}}