{"id":"W2092928619","doi":"10.1016/j.jcss.2007.06.015","title":"The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lemma (botany); Corollary; Combinatorics; Mathematics; Satisfiability; Randomized algorithm; Discrete mathematics; Time complexity; Boolean satisfiability problem; Computability; Ramsey's theorem","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.003063791,0.00005818349,0.0001373645,0.0001225315,0.0003503577,0.00020604,0.0003902274,0.00002537649,5.001001e-7],"category_scores_gemma":[0.00001274587,0.00003558562,0.00005118537,0.0002211583,0.0002693449,0.0006203636,0.00003592994,0.00004869115,1.574358e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001948331,"about_ca_system_score_gemma":0.0000846955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006337062,"about_ca_topic_score_gemma":0.00002909913,"domain_scores_codex":[0.9989802,0.00008139652,0.0004582044,0.0001031364,0.0002597538,0.0001172874],"domain_scores_gemma":[0.9988148,0.0002675012,0.0004483487,0.00009940327,0.0003016482,0.00006826389],"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.00004023049,0.00003715857,0.006811649,0.00005552128,0.00002281821,0.000002984496,0.001756962,0.00418996,0.0005389169,0.8003106,0.0001702577,0.1860629],"study_design_scores_gemma":[0.0004290729,0.0007453417,0.05027603,0.00008491796,0.000007035124,0.000338234,0.0006289356,0.9416112,0.0005718319,0.004636839,0.0005727578,0.00009778817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05055321,0.00006731369,0.947832,0.0005365195,0.0006551452,0.0000980909,6.798379e-7,0.00001138811,0.0002456285],"genre_scores_gemma":[0.8379368,0.000006440936,0.1619166,0.00003124623,0.000102777,2.88757e-7,1.421481e-7,0.000001117747,0.000004605718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9374213,"threshold_uncertainty_score":0.2694703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05216442578228685,"score_gpt":0.2959712926665272,"score_spread":0.2438068668842404,"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."}}