{"id":"W2498324117","doi":"10.1007/978-3-319-40970-2_9","title":"Learning Rate Based Branching Heuristic for SAT Solvers","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Computer science; Leverage (statistics); Solver; Branching (polymer chemistry); Heuristic; Mathematical optimization; Reinforcement learning; Artificial intelligence; Optimization problem; Machine learning; Theoretical computer science; Algorithm; Mathematics; 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.002879259,0.0005003348,0.000483086,0.000749945,0.0004809752,0.0005222857,0.003055125,0.0002994893,0.00001660137],"category_scores_gemma":[0.0008630684,0.0004262063,0.0001786418,0.0003923381,0.00054319,0.000789654,0.0005853964,0.0007142372,0.00004994408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003944221,"about_ca_system_score_gemma":0.0005621945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003286552,"about_ca_topic_score_gemma":0.0000060855,"domain_scores_codex":[0.9963744,0.0001115876,0.0005432792,0.001550584,0.0006619251,0.0007582054],"domain_scores_gemma":[0.9960989,0.001774662,0.0004546731,0.001224847,0.0002860925,0.0001608345],"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.00001572494,0.00001027018,0.00002084192,0.00007850462,0.00000820318,0.00001134513,0.0003981867,0.04977031,0.0005361092,0.04488117,0.000009485648,0.9042599],"study_design_scores_gemma":[0.0004002025,0.000239532,0.00007520065,0.000393886,0.000009086832,0.00001192717,8.637917e-8,0.8792271,0.002935028,0.1131229,0.002981469,0.0006035533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002688859,0.0001150717,0.9937167,0.0004780106,0.002751699,0.0005612113,0.00000548527,0.0002612927,0.002083702],"genre_scores_gemma":[0.04797611,0.00001016328,0.9500322,0.001010619,0.0004340429,0.00002497855,0.000004912095,0.00004608005,0.0004609436],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9036563,"threshold_uncertainty_score":0.999819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02385397396974076,"score_gpt":0.2756599481661304,"score_spread":0.2518059741963897,"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."}}