{"id":"W2998252087","doi":"","title":"Equivalences and Differences in Conic Relaxations of Combinatorial Quadratic Optimization Problems","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Quadratic assignment problem; Mathematics; Combinatorial optimization; Conic section; Conic optimization; Quadratic unconstrained binary optimization; Quadratic programming; Mathematical optimization; Optimization problem; Quadratic equation; Binary number; Generalization; Integer programming; Combinatorics; Convex optimization; 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.00030539,0.0000865624,0.0002156624,0.0001057603,0.0001887312,0.00008228502,0.0002286493,0.00006237224,0.0001636473],"category_scores_gemma":[0.001844681,0.00007189908,0.00001740117,0.00009233539,0.0002499546,0.0003861462,0.000105605,0.00009712952,0.000001424893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002279938,"about_ca_system_score_gemma":0.00004926547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005931221,"about_ca_topic_score_gemma":0.00007024758,"domain_scores_codex":[0.9990514,0.00006344076,0.0003265943,0.0001652846,0.0002474335,0.000145878],"domain_scores_gemma":[0.9988344,0.0003784405,0.0002926937,0.0003028463,0.0001479479,0.00004364532],"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.0000485333,0.0006399677,0.0900784,0.0007921074,0.00005860915,0.00000386011,0.002408152,0.02358822,0.0001710706,0.8796421,0.00007835852,0.002490613],"study_design_scores_gemma":[0.001730213,0.0001564571,0.006386318,0.0001729175,0.00001374272,0.000002058182,0.0004657602,0.6762615,0.0002853946,0.3143287,0.000005597546,0.0001913223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2009833,0.0001697447,0.7784423,0.001125995,0.0004279164,0.001634713,0.00001332037,0.0001019247,0.01710077],"genre_scores_gemma":[0.8724592,0.0001790471,0.1267587,0.000002681206,0.00001502535,0.00003360177,0.000002279858,0.000009638821,0.0005397605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6714759,"threshold_uncertainty_score":0.2931959,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1073065012644062,"score_gpt":0.3775436971562838,"score_spread":0.2702371958918776,"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."}}