{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004207079,0.001496625,0.003118161,0.001639679,0.003587245,0.008751538,0.007419641,0.002914011,0.01841643],"category_scores_gemma":[0.04005218,0.001677269,0.003500044,0.0035713,0.005114533,0.029907,0.01006823,0.01171971,0.001984605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004408424,"about_ca_system_score_gemma":0.004794464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003690131,"about_ca_topic_score_gemma":0.004831947,"domain_scores_codex":[0.9909814,0.001696042,0.0006422483,0.002037056,0.002461978,0.002181147],"domain_scores_gemma":[0.9229794,0.06362764,0.002276077,0.007175389,0.002229475,0.001712031],"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.003362873,0.000632862,0.00791471,0.002658716,0.0004063996,0.001005945,0.002039581,0.1419034,0.01174019,0.6862237,0.03580774,0.1063039],"study_design_scores_gemma":[0.0001512123,0.00008938006,0.0010669,0.00009209126,0.0001772526,0.000518275,0.0003225441,0.1911954,0.00532493,0.7963682,0.004615706,0.00007819859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2887507,0.003711066,0.6135734,0.017175,0.0007727354,0.0005250361,0.004235535,0.002990945,0.06826563],"genre_scores_gemma":[0.9192491,0.001166968,0.0655867,0.001524709,0.0006502277,0.0004233552,0.002008772,0.0009147277,0.008475281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01841643,"threshold_uncertainty_score":0.06160909,"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."}}