{"id":"W2521729967","doi":"10.1016/j.dam.2016.09.008","title":"On semidefinite least squares and minimal unsatisfiability","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjunctive normal form; Satisfiability; Semidefinite programming; Semidefinite embedding; Positive-definite matrix; Quadratically constrained quadratic program; Combinatorics; Connection (principal bundle); Explained sum of squares; Discrete mathematics; Mathematical optimization; Quadratic programming","routes":{"ca_aff":true,"ca_fund":true,"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.0004913098,0.0003171096,0.0004282265,0.000128535,0.000152141,0.00005870279,0.000244917,0.0001296802,0.0005390171],"category_scores_gemma":[0.001319715,0.0002068618,0.00006771484,0.0002072106,0.0003143426,0.0001229263,0.0001831822,0.0001743362,0.0001602174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008111069,"about_ca_system_score_gemma":0.00003655074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.285572e-7,"about_ca_topic_score_gemma":0.00000258935,"domain_scores_codex":[0.9979082,0.00003854133,0.0005344847,0.0004736475,0.0005880854,0.0004569968],"domain_scores_gemma":[0.9960054,0.002768749,0.000203169,0.0007259503,0.00009847377,0.0001982999],"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.00006630986,0.0001896973,0.00004769754,0.0003366774,0.00004252315,0.000004243373,0.0007404341,0.00002780715,0.003666181,0.9826235,0.000906967,0.01134792],"study_design_scores_gemma":[0.001280479,0.0001146024,0.000129572,0.0001822424,0.00003328103,0.00001080828,0.000556975,0.002485753,0.003799652,0.9906281,0.000338218,0.0004403328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1664492,0.00003290306,0.7914923,0.0009255947,0.00006857916,0.00145987,0.0001964546,0.0004589757,0.03891616],"genre_scores_gemma":[0.4228536,0.00006113527,0.5749473,0.0001035,0.00006813285,0.0002052479,0.000009105074,0.0001278699,0.00162408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2564044,"threshold_uncertainty_score":0.8435578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03465292663337363,"score_gpt":0.3217420098769667,"score_spread":0.2870890832435931,"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."}}