{"id":"W1559927413","doi":"","title":"Detecting Backdoor Sets with Respect to Horn and Binary Clauses.","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Backdoor; Parameterized complexity; Satisfiability; Mathematics; Class (philosophy); Set (abstract data type); Binary number; Discrete mathematics; Combinatorics; Boolean satisfiability problem; French horn; Computer science; Artificial intelligence; Arithmetic; Physics","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.0002845431,0.0001094246,0.0001033718,0.0001843524,0.0001647921,0.0001218508,0.0004492015,0.00002772617,0.00001260697],"category_scores_gemma":[0.00005721483,0.00008185345,0.00001599334,0.0007839221,0.00006541119,0.0004094303,0.0003814597,0.000151327,0.00006877982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004839322,"about_ca_system_score_gemma":0.00005741092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002444013,"about_ca_topic_score_gemma":0.00008232347,"domain_scores_codex":[0.9988372,0.00003981618,0.00009557205,0.0004274784,0.0002499476,0.0003499317],"domain_scores_gemma":[0.9991618,0.00009963031,0.0000201504,0.0004673654,0.00006011505,0.0001908805],"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.000804379,0.0003024353,0.006500667,0.0001003103,0.0001252575,0.001517854,0.007405409,0.0102735,0.08577143,0.5866274,0.0006403517,0.299931],"study_design_scores_gemma":[0.0086076,0.01227031,0.05130352,0.0005435303,0.00001971776,0.001910664,0.002227363,0.01024474,0.3503485,0.5496563,0.009631695,0.003236085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5585001,0.00005865846,0.4362026,0.00136658,0.00003442996,0.0002132452,4.691022e-7,0.0002150957,0.003408752],"genre_scores_gemma":[0.7892391,0.000004481506,0.210188,0.0002548776,0.0000141576,0.00001113021,9.488691e-8,0.00001045422,0.0002777228],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2966949,"threshold_uncertainty_score":0.3337887,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02499197815101134,"score_gpt":0.3024142130318423,"score_spread":0.277422234880831,"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."}}