{"id":"W2036975612","doi":"10.1007/978-3-540-74970-7_52","title":"Solution Counting Algorithms for Constraint-Centered Search Heuristics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Benchmark (surveying); Computer science; Exploit; Constraint (computer-aided design); Key (lock); Inference; Counting problem; Constraint programming; Search algorithm; Algorithm; Theoretical computer science; Mathematical optimization; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001494325,0.0004000354,0.0003810452,0.0008613082,0.0004014954,0.0005829333,0.001319666,0.0003292097,0.00002895912],"category_scores_gemma":[0.0001450202,0.0004183466,0.0001350581,0.0004473579,0.0007869306,0.0004577884,0.0004745116,0.0006008985,0.00001880833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000429285,"about_ca_system_score_gemma":0.0007019368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001614063,"about_ca_topic_score_gemma":0.00007960566,"domain_scores_codex":[0.9966012,0.00002330951,0.0005918719,0.001185594,0.0008669935,0.0007309995],"domain_scores_gemma":[0.9976636,0.0005990391,0.0002629639,0.0006843491,0.0006181114,0.0001719878],"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.000006012996,0.00001808403,0.00005684883,0.00003867057,0.000009309801,0.00002024865,0.0002637316,0.01861143,0.00005970829,0.02498015,0.00002103627,0.9559148],"study_design_scores_gemma":[0.0004305788,0.0001228278,0.00008126961,0.0002029101,0.000007245401,0.00008612329,4.093871e-7,0.9809648,0.0004315488,0.01595619,0.001246944,0.0004691776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000105565,0.00009745856,0.9937517,0.000544101,0.002309692,0.0006438256,0.00002197477,0.0001857344,0.002434945],"genre_scores_gemma":[0.03623941,0.00003913028,0.961995,0.0009275382,0.0005038334,0.000007066863,0.00002670092,0.00003146287,0.0002298227],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9623533,"threshold_uncertainty_score":0.9998268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05260028224120177,"score_gpt":0.2967685776612226,"score_spread":0.2441682954200208,"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."}}