{"id":"W267725155","doi":"","title":"Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable","year":2004,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Combinatorics; Mathematics; Discrete mathematics; Function (biology); Variable (mathematics); Propositional variable; Integer (computer science); Exponential function; Boolean satisfiability problem; Conjunctive normal form; Upper and lower bounds; Propositional formula; Exponential time hypothesis; Time complexity; Computer science; Theoretical computer science","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.00216225,0.0008020293,0.001382732,0.001133157,0.001062894,0.003288549,0.002130141,0.00135535,0.004118082],"category_scores_gemma":[0.01978036,0.0008624101,0.00119537,0.002264989,0.002039038,0.006747092,0.002083828,0.002146361,0.0006996281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001926206,"about_ca_system_score_gemma":0.001873186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003018196,"about_ca_topic_score_gemma":0.004815563,"domain_scores_codex":[0.998372,0.0004603569,0.0001659722,0.0003858308,0.000291996,0.0003238296],"domain_scores_gemma":[0.9840819,0.0131531,0.0008577998,0.001163085,0.0003869549,0.0003571397],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002672835,0.0005129885,0.01536207,0.0006872828,0.0002127677,0.0006674695,0.0006548049,0.7094588,0.01982741,0.142129,0.005692001,0.1021227],"study_design_scores_gemma":[0.00008116232,0.00006212205,0.0007752359,0.00002315349,0.0000505614,0.0001076618,0.0001155995,0.8683574,0.006962291,0.1227731,0.0006708414,0.0000209633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6621508,0.0003756498,0.3293651,0.001089235,0.00007246189,0.00007231967,0.0004645666,0.001876298,0.004533535],"genre_scores_gemma":[0.8476098,0.0001724868,0.1490376,0.0002012034,0.00006026432,0.00006346578,0.001145635,0.0002358496,0.001473753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004118082,"threshold_uncertainty_score":0.01397562,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01120732532794302,"score_gpt":0.2219414119875693,"score_spread":0.2107340866596263,"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."}}