{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003803505,0.0002200506,0.0002327579,0.0000775123,0.0005988064,0.0002672415,0.001048411,0.00007135259,0.0001171153],"category_scores_gemma":[0.00005411865,0.0001607303,0.0001435713,0.0004334984,0.00009421452,0.0001718306,0.0002781072,0.0002011095,0.00007760745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002172608,"about_ca_system_score_gemma":0.00001372847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002083187,"about_ca_topic_score_gemma":0.00001540571,"domain_scores_codex":[0.9985418,0.00001358459,0.0004415024,0.0003445611,0.0002756238,0.0003829352],"domain_scores_gemma":[0.9976311,0.001092624,0.0002681217,0.0008719118,0.0000609216,0.00007532629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000153977,0.00009960788,0.000002022408,0.0001357894,0.0000637069,9.189293e-7,0.005906743,0.0001600979,0.0003972108,0.9640932,0.00153508,0.02760405],"study_design_scores_gemma":[0.0003663596,0.00003135755,0.00000843104,0.0000357588,0.0000325717,0.00001301223,0.0003336195,0.5764612,0.0007081677,0.4133924,0.008358352,0.0002587448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008453712,0.0001247253,0.973694,0.0008868697,0.0001061706,0.0008399551,0.00002885107,0.0002500431,0.02322401],"genre_scores_gemma":[0.1196402,0.00002774968,0.8784306,0.0003623544,0.0001109117,0.0005051718,0.00001104572,0.00003708993,0.0008749413],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5763011,"threshold_uncertainty_score":0.6554391,"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."}}