{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002639356,0.002101344,0.001505238,0.001500193,0.001181708,0.002890345,0.00226087,0.001550293,0.008794226],"category_scores_gemma":[0.005599465,0.0007923824,0.002397897,0.002464543,0.001822915,0.005323227,0.00222634,0.00610596,0.000985211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001990437,"about_ca_system_score_gemma":0.001232388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231546,"about_ca_topic_score_gemma":0.002407567,"domain_scores_codex":[0.9990023,0.0003681495,0.00004352927,0.0002239402,0.0002563589,0.0001057104],"domain_scores_gemma":[0.9988381,0.0006889084,0.00009226189,0.0001151779,0.000167611,0.00009792954],"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.00007924093,0.0001611602,0.0002296252,0.0003920899,0.0000501641,0.00008017883,0.0002516711,0.06716773,0.001585452,0.8782039,0.009675389,0.04212346],"study_design_scores_gemma":[0.00002822395,0.00008359746,0.0002471187,0.0001224787,0.00003461347,0.00007373848,0.0001428937,0.3487247,0.0008297922,0.6300792,0.01958734,0.00004640093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03408399,0.0155366,0.8265309,0.004748282,0.001271361,0.000132504,0.000539194,0.0001679714,0.1169893],"genre_scores_gemma":[0.5267398,0.02478404,0.3953654,0.002443811,0.003233064,0.0004860944,0.001645894,0.0006487081,0.04465318],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008794226,"threshold_uncertainty_score":0.0294196,"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."}}