{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002598109,0.00006001748,0.0000845359,0.0001999403,0.0007103371,0.0001680778,0.0006210239,0.00002769798,0.000002746007],"category_scores_gemma":[0.0002289648,0.00004640853,0.00003856687,0.0009117425,0.0007246332,0.0002849379,0.0003028578,0.0002370223,0.000002576655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002227648,"about_ca_system_score_gemma":0.00005482329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002986034,"about_ca_topic_score_gemma":0.000210178,"domain_scores_codex":[0.9985762,0.0001484764,0.0002918522,0.0001911287,0.0004870743,0.0003052754],"domain_scores_gemma":[0.9985734,0.0006398813,0.0000348016,0.0004272499,0.0002585467,0.00006608818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000365678,0.000253604,0.003340553,0.00006554186,0.00007443088,0.00001247284,0.006450556,0.003286427,0.2008318,0.2224058,0.001119939,0.5621223],"study_design_scores_gemma":[0.001528603,0.0008421242,0.03415653,0.0003805422,0.0000206825,0.00008728555,0.001963153,0.8543107,0.08759943,0.007396126,0.01098316,0.0007316919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4149922,0.0002068993,0.5772631,0.006731738,0.0001101892,0.0003105998,0.000003343039,0.00002406501,0.0003578418],"genre_scores_gemma":[0.9355729,0.00005869681,0.06418863,0.00007168707,0.00004174587,0.00001697509,0.000002302218,0.000004230018,0.00004282262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8510243,"threshold_uncertainty_score":0.5463411,"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."}}