{"id":"W1759023222","doi":"10.1007/978-3-642-21043-3_33","title":"Finding Small Backdoors in SAT Instances","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backdoor; Computer science; Satisfiability; Boolean satisfiability problem; Theoretical computer science; Set (abstract data type); Algorithm; Time complexity; Programming language","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"],"consensus_categories":[],"category_scores_codex":[0.001998686,0.0005271055,0.0005394843,0.001399068,0.0001733025,0.0003608435,0.004804711,0.0004070872,0.00002558828],"category_scores_gemma":[0.0001869364,0.0005038432,0.0001059803,0.001077247,0.0006855143,0.001204937,0.001289162,0.001048393,0.00009342912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004860192,"about_ca_system_score_gemma":0.0004509213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004801711,"about_ca_topic_score_gemma":0.0003092231,"domain_scores_codex":[0.9960874,0.0000811257,0.0007109271,0.001627056,0.0007176823,0.0007758502],"domain_scores_gemma":[0.9973933,0.0003393558,0.0004005552,0.001577292,0.0001438934,0.0001456219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008019099,0.00002688041,0.0003752839,0.00004757286,0.000004794465,0.00006543072,0.002663295,0.004310764,0.00007090776,0.1432533,0.00000335462,0.8491704],"study_design_scores_gemma":[0.0006841694,0.000335,0.003157868,0.0014795,0.000008847503,0.0001118768,0.000001019442,0.3855104,0.005921621,0.596904,0.003967061,0.001918564],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006782558,0.0004236253,0.979462,0.0001311123,0.002667503,0.0003745811,0.000002199706,0.0001432154,0.01611752],"genre_scores_gemma":[0.07177765,0.0001065845,0.9270118,0.000585689,0.0002033427,0.00001336782,0.00000267677,0.00003158695,0.0002672362],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8472518,"threshold_uncertainty_score":0.9997413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05988371030649545,"score_gpt":0.278562548805241,"score_spread":0.2186788384987455,"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."}}