{"id":"W2136811867","doi":"10.1016/s0166-218x(01)00266-9","title":"Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Semidefinite programming; Polytope; Relaxation (psychology); Maximum cut; Intersection (aeronautics); Lagrangian relaxation; Flexibility (engineering); Combinatorics; Metric (unit); Constraint (computer-aided design); Set (abstract data type); Relaxation technique; Feasible region; Regular polygon; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Computer science; Geometry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002545654,0.00161871,0.001302812,0.001056393,0.0009165621,0.002535352,0.002327612,0.001539689,0.01104267],"category_scores_gemma":[0.006216742,0.0007393439,0.001864218,0.001167169,0.001545497,0.00409636,0.004901334,0.008867021,0.001575391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00104491,"about_ca_system_score_gemma":0.00137924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006722791,"about_ca_topic_score_gemma":0.0008053803,"domain_scores_codex":[0.9985663,0.0004755082,0.00005883887,0.0002276508,0.0004345863,0.0002371139],"domain_scores_gemma":[0.997705,0.001020899,0.0001850432,0.0004834147,0.0003086055,0.0002969775],"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.0003662872,0.0003419477,0.0002292053,0.0004426907,0.00006148338,0.0002145439,0.0003371474,0.05934327,0.00683442,0.8352473,0.01965695,0.07692476],"study_design_scores_gemma":[0.000121541,0.0001981002,0.0002677859,0.00009899285,0.00004451433,0.0002212923,0.0001226997,0.2668481,0.002585382,0.7158164,0.01363176,0.00004325016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04358098,0.0005477968,0.9032078,0.003060457,0.0007146361,0.000175517,0.0005405142,0.000426568,0.04774566],"genre_scores_gemma":[0.4818093,0.001252971,0.4691376,0.001567992,0.001477098,0.0006648318,0.00118865,0.0005107826,0.04239073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01104267,"threshold_uncertainty_score":0.03694135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03249075521729931,"score_gpt":0.2356156697719298,"score_spread":0.2031249145546305,"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."}}