{"id":"W2556118493","doi":"","title":"Depth-based Local Search Heuristics for Boolean Circuit Satisfiability","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Heuristics; Boolean satisfiability problem; Heuristic; Satisfiability; Completeness (order theory); Local search (optimization); Maximum satisfiability problem; Computer science; Algorithm; Theoretical computer science; Variable (mathematics); Mathematical optimization; Mathematics; Boolean function","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.00151325,0.0001001349,0.0001117008,0.00005879557,0.0001234222,0.0001024966,0.0008321461,0.00009621273,0.00004050484],"category_scores_gemma":[0.0005240318,0.00009220984,0.00006039524,0.0002084729,0.0001690694,0.0002139758,0.00008937049,0.0002350833,0.00004936814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004011458,"about_ca_system_score_gemma":0.0001609322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003828757,"about_ca_topic_score_gemma":0.00007008504,"domain_scores_codex":[0.9987731,0.00008566088,0.0002267244,0.0003653567,0.0002622457,0.0002869359],"domain_scores_gemma":[0.9982934,0.0003769179,0.00004249018,0.0009642831,0.0002025436,0.0001203394],"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.000006419794,0.00006021477,0.002853035,0.00003637476,0.000002734561,5.059076e-7,0.00005496097,0.000248773,0.002339576,0.6860237,0.0002920412,0.3080817],"study_design_scores_gemma":[0.000280762,0.0001106394,0.01855664,0.000002798639,0.000003173986,0.000003415068,0.00001206214,0.9172728,0.04507397,0.01308137,0.005429859,0.000172482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01013666,0.00000221923,0.9839016,0.0003311395,0.0005968562,0.0003439952,0.000004125788,0.0002092687,0.004474115],"genre_scores_gemma":[0.4956537,1.168829e-7,0.5040432,0.0001634625,0.00003571039,0.00002059859,0.000001886587,0.000004964296,0.00007636514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9170241,"threshold_uncertainty_score":0.3760208,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05270903099005436,"score_gpt":0.3290128017679618,"score_spread":0.2763037707779074,"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."}}