{"id":"W64307931","doi":"10.5591/978-1-57735-516-8/ijcai11-092","title":"Depth-driven circuit-level stochastic local search for SAT","year":2011,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Boolean satisfiability problem; Completeness (order theory); Computer science; Local search (optimization); Boolean circuit; Satisfiability; Heuristic; Key (lock); Algorithm; Theoretical computer science; Search algorithm; Stochastic computing; Logic gate; Mathematics; Artificial intelligence","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.0001033667,0.00007352831,0.00007485761,0.00008276334,0.00008723824,0.00004412738,0.0002667665,0.00004286733,0.0002458878],"category_scores_gemma":[0.00001308736,0.00006789246,0.00004479431,0.0001436892,0.00005084823,0.0002440128,0.00006487731,0.00005540507,0.0001200593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003376045,"about_ca_system_score_gemma":0.00008194948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004303685,"about_ca_topic_score_gemma":0.0001140646,"domain_scores_codex":[0.9993094,0.00001830905,0.0001233109,0.0002244113,0.0001327429,0.0001918468],"domain_scores_gemma":[0.9995124,0.0000595271,0.00002240424,0.0002168165,0.00009959145,0.00008924837],"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.00001041009,0.00005773624,0.001849246,0.00001185595,0.00002155459,0.000002744588,0.001831123,0.008527895,0.000160957,0.4199238,0.0004476001,0.5671551],"study_design_scores_gemma":[0.0005299305,0.00009691245,0.03048107,0.00000756629,0.000005527561,0.00002281003,0.0001355646,0.9646941,0.00100272,0.00272022,0.0001099086,0.0001936409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005820892,0.000003299332,0.9907486,0.0001239558,0.000206962,0.0002142298,0.000003084804,0.0001456041,0.007972172],"genre_scores_gemma":[0.8652405,6.359634e-7,0.1341269,0.0001641571,0.00001843281,0.0000149516,0.000003255891,0.000005112777,0.0004259924],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9561662,"threshold_uncertainty_score":0.2768574,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1223191680826042,"score_gpt":0.2738664491365895,"score_spread":0.1515472810539854,"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."}}