{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002808464,0.0001916477,0.000217845,0.00006910412,0.0003280805,0.0003643481,0.0008169948,0.00005538923,0.00009270242],"category_scores_gemma":[0.00002379456,0.0001261867,0.00003486963,0.0005962523,0.00009433871,0.0007397677,0.0001929269,0.0001404724,0.0002293549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005700626,"about_ca_system_score_gemma":0.0003177299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003147181,"about_ca_topic_score_gemma":0.000231959,"domain_scores_codex":[0.9985484,0.00003406393,0.0001921044,0.0004853056,0.0002879044,0.0004522063],"domain_scores_gemma":[0.9991999,0.00008854624,0.00009095597,0.0003798618,0.0001208379,0.0001198991],"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.000005043455,0.0001097588,0.01121083,0.00002976205,0.00002591871,0.00001440637,0.001914975,0.003645466,0.00006971508,0.9740642,0.0007467195,0.008163161],"study_design_scores_gemma":[0.01706364,0.005015739,0.04756226,0.00243467,0.0001808204,0.001074368,0.004921747,0.2346596,0.01787124,0.442204,0.2185345,0.008477411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03025433,0.0004686871,0.7831588,0.0002108594,0.0004147924,0.0001250957,8.17881e-7,0.0003629294,0.1850036],"genre_scores_gemma":[0.7568263,0.00001336792,0.2418209,0.0002829752,0.00008227942,0.000003910478,0.000001713476,0.00000596299,0.0009626278],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.726572,"threshold_uncertainty_score":0.5145742,"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."}}