{"id":"W1988044523","doi":"10.1016/j.orl.2007.10.006","title":"The equivalence of semidefinite relaxations of polynomial 0–1 and ± 1 programs via scaling","year":2007,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Scaling; Semidefinite programming; Equivalence (formal languages); Semidefinite embedding; Polynomial; Mathematics; Mathematical optimization; Computer science; Combinatorics; Discrete mathematics; Mathematical analysis; Quadratically constrained quadratic program; 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.002815446,0.00117392,0.001455466,0.0009299571,0.001360526,0.004179128,0.001849006,0.001437287,0.008538838],"category_scores_gemma":[0.01353925,0.0009812929,0.001221497,0.001560813,0.003407477,0.008209981,0.003155375,0.006269392,0.0005651588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002029181,"about_ca_system_score_gemma":0.001259784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001546285,"about_ca_topic_score_gemma":0.001304075,"domain_scores_codex":[0.9976524,0.0008495528,0.0001211419,0.0004876079,0.0004926753,0.0003966116],"domain_scores_gemma":[0.9903657,0.00647996,0.0009795564,0.0008880869,0.0006134591,0.0006732103],"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.000135831,0.0001489131,0.0002197329,0.00006614865,0.00001366633,0.00004129332,0.0003348549,0.01455775,0.001080344,0.968298,0.002756411,0.01234706],"study_design_scores_gemma":[0.00002976032,0.00004565598,0.000246086,0.00001361001,0.000006295704,0.00004024041,0.0000878924,0.05425936,0.0003124713,0.9437576,0.001187854,0.00001313236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.433127,0.001138581,0.4239839,0.005845087,0.0004852749,0.0002237408,0.000727146,0.000785769,0.1336835],"genre_scores_gemma":[0.913384,0.0007445982,0.06374902,0.001414484,0.0006154787,0.0003336132,0.0008609689,0.0005034023,0.01839448],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008538838,"threshold_uncertainty_score":0.02856529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06701004283141021,"score_gpt":0.3507525235260223,"score_spread":0.2837424806946121,"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."}}