{"id":"W142773386","doi":"10.1007/978-3-642-13059-5_56","title":"Predicting Optimal Constraint Satisfaction Methods","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Constraint satisfaction problem; Computer science; Constraint satisfaction dual problem; Constraint satisfaction; A priori and a posteriori; Variety (cybernetics); Constraint (computer-aided design); Constraint learning; Local consistency; Mathematical optimization; Backtracking; Artificial intelligence; Machine learning; Algorithm; Mathematics","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.001465791,0.0005030368,0.0004637616,0.0008999628,0.0004116838,0.0006872119,0.00133894,0.0005455532,0.0001767136],"category_scores_gemma":[0.0002307007,0.000500958,0.00014636,0.0005013238,0.0009751499,0.0008582708,0.0007016875,0.001601937,0.00003348414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000284778,"about_ca_system_score_gemma":0.0007514028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004033093,"about_ca_topic_score_gemma":0.0002257284,"domain_scores_codex":[0.9965239,0.00007135676,0.0006348498,0.001435009,0.0007653346,0.0005695348],"domain_scores_gemma":[0.9973663,0.0006237323,0.0004130622,0.001072107,0.000299378,0.0002253956],"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.000002272571,0.000006545585,0.0004111181,0.00001181026,0.000008927515,0.00001866605,0.0003694581,0.03193009,0.00114368,0.01373187,0.00000175564,0.9523638],"study_design_scores_gemma":[0.0003153247,0.0001073436,0.001602515,0.0001802557,0.00001326313,0.000336219,5.036704e-7,0.9527532,0.004137787,0.038926,0.0008710213,0.0007566057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001491168,0.00006792745,0.9901809,0.0006077921,0.00391259,0.0003934765,0.000005491478,0.0003589191,0.004323865],"genre_scores_gemma":[0.05245996,0.00002794792,0.9464677,0.000532789,0.0003525433,0.000007981204,0.000004631579,0.00002773636,0.0001187165],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9516072,"threshold_uncertainty_score":0.9997442,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01719898647720418,"score_gpt":0.2846491178294287,"score_spread":0.2674501313522245,"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."}}