{"id":"W1871585472","doi":"10.14288/1.0051500","title":"SATenstein : automatically building local search SAT solvers from components","year":2009,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Boolean satisfiability problem; Satisfiability; Task (project management); Context (archaeology); Solver; Local search (optimization); Range (aeronautics); Satisfiability modulo theories; Theoretical computer science; Selection (genetic algorithm); Programming language; Algorithm; 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.0001306221,0.00004276745,0.0001872526,0.00005741469,0.0002230123,0.000193181,0.0005012599,0.00008393022,0.000115281],"category_scores_gemma":[0.00001124572,0.0001501893,0.00008680304,0.0002964498,0.0001678061,0.0005810638,0.0001345632,0.0001263422,0.00003957094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009970208,"about_ca_system_score_gemma":0.00007762593,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.02673743,"about_ca_topic_score_gemma":0.01963608,"domain_scores_codex":[0.9988852,0.00006471616,0.0001283532,0.0003597793,0.000335493,0.0002264667],"domain_scores_gemma":[0.999321,0.00005156414,0.00006958964,0.0002767996,0.0001301655,0.0001508151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00000356148,0.00006199402,0.003076031,0.000006465898,0.00001869241,0.0001002573,0.000220371,0.0007360907,0.001566546,0.0000585907,0.0004280119,0.9937234],"study_design_scores_gemma":[0.000637917,0.00004568376,0.8526651,0.00007327259,0.000008586896,0.00002258077,0.0002353194,0.1454987,0.000005149478,0.00062784,0.00004425567,0.0001356807],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5321909,0.00001049998,0.4667941,0.0002685092,0.00007131486,0.0000765633,0.00001578619,0.0001201615,0.0004521626],"genre_scores_gemma":[0.9450041,0.00001676157,0.05475555,0.0001224689,0.00001047543,5.557252e-8,0.00001505494,0.000003766241,0.00007175826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9935877,"threshold_uncertainty_score":0.998253,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009889219578066074,"score_gpt":0.1833860784666706,"score_spread":0.1734968588886046,"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."}}