{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246516,0.001160098,0.001027445,0.001500911,0.001134831,0.002816683,0.002473957,0.001885366,0.03057143],"category_scores_gemma":[0.01315621,0.0008065627,0.001354937,0.002659911,0.0009167491,0.003961013,0.0013588,0.001847766,0.002923706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001428099,"about_ca_system_score_gemma":0.002009321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006624286,"about_ca_topic_score_gemma":0.01761181,"domain_scores_codex":[0.9987018,0.0003349945,0.00009804625,0.0003801477,0.0002504014,0.0002345753],"domain_scores_gemma":[0.9907222,0.007486787,0.0003446793,0.0005678643,0.0006123745,0.0002661666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002387111,0.0009841317,0.01442115,0.00291465,0.0004604677,0.001268609,0.000520533,0.4647806,0.009112928,0.1212979,0.08904548,0.2928064],"study_design_scores_gemma":[0.000277736,0.0001790244,0.002652389,0.00007478798,0.0001022689,0.0002741264,0.0004456165,0.8276461,0.007558046,0.1545468,0.006208852,0.00003424413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4776878,0.00128858,0.4487228,0.004061045,0.0002952291,0.0004187268,0.02039351,0.007077612,0.04005467],"genre_scores_gemma":[0.6097418,0.0004261039,0.3380055,0.0005007643,0.0001749102,0.0001613958,0.03798573,0.001409053,0.01159464],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03057143,"threshold_uncertainty_score":0.1022716,"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."}}