{"id":"W579949368","doi":"10.1007/978-1-4613-0279-7_25","title":"Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem","year":2001,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Maximum cut; Semidefinite embedding; Mathematics; Relaxation (psychology); Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematical optimization; Computer science; Quadratically constrained quadratic program; Artificial intelligence; Quadratic programming","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002089746,0.0003131581,0.0002517302,0.0001820402,0.001000311,0.0003653205,0.000751167,0.0002413639,0.0001022381],"category_scores_gemma":[0.000025364,0.00026653,0.0001425981,0.0002545848,0.0001195667,0.0002690879,0.0002038041,0.0002871839,0.00002654176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004261314,"about_ca_system_score_gemma":0.0001225883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004145845,"about_ca_topic_score_gemma":0.00001273955,"domain_scores_codex":[0.9983873,0.00001539761,0.0004719329,0.000624187,0.000243721,0.0002574781],"domain_scores_gemma":[0.9978314,0.000523621,0.0004104901,0.000708385,0.0004103617,0.0001157274],"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.00000176423,0.00002887478,7.094851e-7,0.00003167345,0.00004851861,2.342938e-7,0.0001348417,0.006705541,7.797309e-7,0.878615,0.0005205103,0.1139116],"study_design_scores_gemma":[0.0002338707,0.00003380793,7.899532e-7,0.00003998655,0.00005932959,0.00001143816,0.00001387309,0.3574862,0.000004874538,0.03755789,0.6043054,0.0002525666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[1.054528e-7,0.001008575,0.9068833,0.002623453,0.00009252688,0.002421708,0.00008147977,0.0002601756,0.0866287],"genre_scores_gemma":[0.0002452194,0.007822995,0.7846038,0.0009269472,0.0004532297,0.004267463,0.0006268008,0.0001143507,0.2009392],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8410571,"threshold_uncertainty_score":0.9999787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03075724069593366,"score_gpt":0.2522711380501114,"score_spread":0.2215138973541777,"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."}}