{"id":"W1989224068","doi":"10.1007/s10472-006-9041-2","title":"An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs","year":2006,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Satisfiability; Semidefinite embedding; Mathematical proof; Mathematics; Dimension (graph theory); Discrete mathematics; Grid; Characterization (materials science); Theoretical computer science; Combinatorics; Computer science; Quadratically constrained quadratic program; Mathematical optimization; Quadratic programming","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.0009647281,0.0001107413,0.0002192053,0.00009062343,0.00006936806,0.00005134355,0.0003203771,0.00005264686,0.000003974916],"category_scores_gemma":[0.0001698781,0.0001019393,0.00005617732,0.0002133001,0.00009593677,0.0003658734,0.00003103865,0.00004464802,0.000001219924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003868144,"about_ca_system_score_gemma":0.00001716841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002712028,"about_ca_topic_score_gemma":0.00000996957,"domain_scores_codex":[0.9987292,0.00004490093,0.0006521671,0.000231294,0.0001965954,0.0001458066],"domain_scores_gemma":[0.9986909,0.0002267216,0.0004119704,0.0003821533,0.0002522447,0.00003603244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001309949,0.0002657834,0.00005257304,0.0001205382,0.000003467977,8.087898e-8,0.0005940428,0.0001124699,0.06463222,0.8871742,0.000004535005,0.04702701],"study_design_scores_gemma":[0.00001030206,0.0002506806,0.000692653,0.00005477963,0.000002530943,4.792964e-7,0.00009050324,0.08961985,0.5592427,0.349913,0.00003861569,0.00008385746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4613835,0.00001468176,0.5381329,0.00008209801,0.00007594948,0.0001630518,0.00002723337,0.0000164194,0.0001041757],"genre_scores_gemma":[0.7693368,0.00004749247,0.2304973,0.00004325352,0.00003663991,0.00002088608,0.000009266207,0.000005580978,0.000002843457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5372612,"threshold_uncertainty_score":0.4156964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1218296641122958,"score_gpt":0.3611550192838475,"score_spread":0.2393253551715517,"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."}}