{"id":"W2012205236","doi":"10.1016/j.dam.2013.06.021","title":"Semidefinite resolution and exactness of semidefinite relaxations for satisfiability","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"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":"Semidefinite programming; Semidefinite embedding; Mathematics; Satisfiability; Transformation (genetics); Resolution (logic); Quadratically constrained quadratic program; Discrete mathematics; Combinatorics; Algorithm; Mathematical optimization; Computer science; 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.0007277497,0.0001463833,0.0002526152,0.00008566893,0.0001188233,0.0000761812,0.0003595758,0.00009633936,0.0000087052],"category_scores_gemma":[0.0004523538,0.0001326936,0.00005032916,0.0002753736,0.0001298989,0.0003788978,0.0001598347,0.00009112339,0.00001638472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003071048,"about_ca_system_score_gemma":0.00002922513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001117867,"about_ca_topic_score_gemma":0.000001253822,"domain_scores_codex":[0.9987226,0.00003170884,0.000530108,0.0002924175,0.0002120946,0.0002111051],"domain_scores_gemma":[0.9980064,0.0006135253,0.0003872732,0.000773688,0.0001514701,0.00006765596],"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.000002922796,0.00003682032,0.00004876231,0.0003092624,0.00001045827,2.551318e-8,0.001377777,0.00007089943,0.007797964,0.9835446,0.0001024515,0.006698018],"study_design_scores_gemma":[0.000395079,0.00006287693,0.003342358,0.00006552525,0.00003031806,0.000004728901,0.0003511232,0.3025778,0.01288829,0.679717,0.0002846806,0.000280203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03489888,0.00003015469,0.957913,0.0001166493,0.00006039236,0.0009457262,0.00001586672,0.0001004515,0.005918887],"genre_scores_gemma":[0.2316318,0.00001349623,0.7679123,0.00003079751,0.00001148725,0.0003439334,0.00001021076,0.00001197826,0.00003395204],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3038276,"threshold_uncertainty_score":0.5411088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02418181407687494,"score_gpt":0.2668779148487238,"score_spread":0.2426961007718489,"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."}}