{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003413995,0.002497717,0.003448006,0.001879525,0.0018784,0.005358968,0.004901013,0.0035528,0.02404435],"category_scores_gemma":[0.02600182,0.002899114,0.004625121,0.00312245,0.004427108,0.01272064,0.007824913,0.009076949,0.003330785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002103615,"about_ca_system_score_gemma":0.001916177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001147838,"about_ca_topic_score_gemma":0.002033906,"domain_scores_codex":[0.9947091,0.00201497,0.0002842136,0.001163732,0.001019792,0.0008081796],"domain_scores_gemma":[0.9707172,0.02413253,0.0008267596,0.003464282,0.0004153998,0.0004437069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002760031,0.0008528583,0.00313251,0.002661494,0.0007913244,0.000830053,0.001108987,0.1762463,0.008719009,0.5161903,0.03808775,0.2486194],"study_design_scores_gemma":[0.0002948457,0.0001689144,0.0003477806,0.0001726668,0.0002013213,0.0003137277,0.0002530979,0.1389063,0.004371791,0.8495186,0.005398817,0.00005209559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1811041,0.002711398,0.7436955,0.006124324,0.0008243863,0.0009489986,0.003607942,0.006270542,0.05471282],"genre_scores_gemma":[0.7036834,0.0011426,0.2703341,0.001481084,0.0004097538,0.0006652597,0.003718775,0.001654975,0.01691006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02404435,"threshold_uncertainty_score":0.08043629,"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."}}