{"id":"W2079817983","doi":"10.1016/j.dam.2013.03.028","title":"Some advances on Lovász–Schrijver semidefinite programming relaxations of the fractional stable set polytope","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Universidad Nacional de Rosario; Consejo Nacional de Investigaciones Científicas y Técnicas; Agencia Nacional de Promoción Científica y Tecnológica; University of Waterloo","keywords":"Polytope; Mathematics; Semidefinite programming; Combinatorics; Operator (biology); Hierarchy; Set (abstract data type); Relaxation (psychology); Birkhoff polytope; Regular polygon; Convex polytope; Discrete mathematics; Convex set; Convex optimization; Mathematical optimization; Computer science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"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.0001543649,0.0001682674,0.0002038206,0.00007599602,0.0002661985,0.000135447,0.0008040375,0.00005563254,0.00005727589],"category_scores_gemma":[0.00004980083,0.0001166802,0.0001061071,0.0004425826,0.0001323545,0.0005119696,0.0002919906,0.0002224036,0.0001072866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002292236,"about_ca_system_score_gemma":0.00004039495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001504559,"about_ca_topic_score_gemma":0.000003242292,"domain_scores_codex":[0.9986231,0.00001831026,0.0003552586,0.0002545057,0.000482048,0.0002668287],"domain_scores_gemma":[0.9985051,0.0003116596,0.0003140876,0.0007390454,0.00007061661,0.00005952782],"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.000001422858,0.0001018235,0.00003035648,0.00006829491,0.00002136076,2.260267e-7,0.0007739148,0.0003925764,0.0008859453,0.991583,0.0004004038,0.005740693],"study_design_scores_gemma":[0.0003498844,0.00006055912,0.0006154577,0.0001345064,0.00002318585,0.000008013955,0.0007351515,0.03730858,0.007760743,0.9422966,0.0103418,0.0003654911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04344378,0.0004879262,0.9185532,0.002347444,0.0008495175,0.002359793,0.00007534251,0.000441123,0.03144188],"genre_scores_gemma":[0.5301964,0.00005070817,0.4685688,0.000435142,0.0001257942,0.0001896702,0.00001339478,0.00002819019,0.0003918064],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4867527,"threshold_uncertainty_score":0.4758082,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02021042504802122,"score_gpt":0.2494301890171953,"score_spread":0.229219763969174,"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."}}