{"id":"W2949591167","doi":"10.1137/1.9781611973082.52","title":"The Local Lemma is Tight for SAT","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Lemma (botany); Combinatorics; Variable (mathematics); Function (biology); Discrete mathematics; Binary tree; Class (philosophy); Binary number; Discretization; Upper and lower bounds; Order (exchange); Mathematical analysis; Computer science; Arithmetic","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.0001791839,0.0001239177,0.0001022674,0.00003936425,0.0001837842,0.0002419328,0.0006739554,0.0001291572,0.0002031146],"category_scores_gemma":[0.00001067791,0.00008142433,0.0001137333,0.000053881,0.00006803771,0.0000900827,0.0004998775,0.000157765,0.00008856592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003529158,"about_ca_system_score_gemma":0.0001417538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004450034,"about_ca_topic_score_gemma":0.0001089674,"domain_scores_codex":[0.9991773,0.00002341738,0.0001835941,0.0003328651,0.0001245059,0.000158289],"domain_scores_gemma":[0.9990713,0.00009621946,0.00009075241,0.0005757246,0.000114365,0.00005165339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004973097,0.000009880711,0.00009261436,0.00001594165,0.00003092139,5.299029e-7,0.0004694894,0.0004127837,0.00000227391,0.3390902,0.0329769,0.6268935],"study_design_scores_gemma":[0.0003171217,0.0000416018,0.001543671,0.00002946208,0.00001750892,0.00001036665,0.00004800371,0.6459665,0.001304524,0.1018273,0.248463,0.0004309241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000272897,0.0000481236,0.9738355,0.00389045,0.001092632,0.0003263033,0.000004992826,0.0001509925,0.02062369],"genre_scores_gemma":[0.2727215,0.0003477898,0.6890712,0.0047835,0.0003569306,0.0003059057,0.00004363948,0.00003837511,0.03233119],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6455537,"threshold_uncertainty_score":0.3320388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03308395663944832,"score_gpt":0.254220605228909,"score_spread":0.2211366485894607,"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."}}