{"id":"W1979831715","doi":"10.1016/j.tcs.2005.02.004","title":"Computing unsatisfiable<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-SAT instances with few occurrences per variable","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Mathematics; Function (biology); Combinatorics; Variable (mathematics); Discrete mathematics; Exponential function; Exponential time hypothesis; Time complexity; Mathematical analysis","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001358766,0.0003071107,0.0002167649,0.0001759557,0.001060045,0.001232286,0.001554532,0.0001638636,0.0001540111],"category_scores_gemma":[0.000114854,0.0003022967,0.0001164567,0.001086143,0.002159419,0.001564864,0.0008385922,0.0004007433,0.0003865989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003457096,"about_ca_system_score_gemma":0.0006167982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003796549,"about_ca_topic_score_gemma":0.00002746236,"domain_scores_codex":[0.9964684,0.0001138755,0.0005001186,0.0009637802,0.001141932,0.00081187],"domain_scores_gemma":[0.9979594,0.000451876,0.0002962798,0.0008010225,0.0001570647,0.0003343054],"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.00002685253,0.00005562141,0.00006148568,0.00002974343,0.00002151892,0.00001836905,0.0008823588,0.01975651,0.0001047011,0.9557669,0.00008720539,0.02318878],"study_design_scores_gemma":[0.0003803981,0.0003001358,0.0002135218,0.0001883937,0.00002467162,0.0001934792,0.00007438609,0.9921981,0.001525758,0.003991777,0.0005422042,0.0003671492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4380883,0.00004885755,0.5563406,0.0004472235,0.0005993101,0.00005094037,0.000005178838,0.0001959512,0.004223597],"genre_scores_gemma":[0.7686179,0.00002368345,0.2301297,0.0009462879,0.0002340127,0.00001288685,0.000006622121,0.00001863134,0.00001032151],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9724416,"threshold_uncertainty_score":0.9999429,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01148018586768381,"score_gpt":0.2327873710725958,"score_spread":0.221307185204912,"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."}}