{"id":"W2082779900","doi":"10.1007/s10601-012-9119-x","title":"Improved filtering for weighted circuit constraints","year":2012,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Relaxation (psychology); Constraint satisfaction problem; Computer science; Travelling salesman problem; Search tree; Linear programming relaxation; Bounding overwatch; Domain (mathematical analysis); Context (archaeology); Mathematical optimization; Solver; Tree (set theory); Constraint (computer-aided design); Constraint satisfaction; Algorithm; Constraint logic programming; Routing (electronic design automation); Lagrangian relaxation; Integer programming; Mathematics; Probabilistic logic; Search algorithm; Artificial intelligence; Stochastic programming","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.000389319,0.0002087968,0.0002091649,0.0001451837,0.0001977008,0.0001491653,0.0003936805,0.0001174812,0.0007039347],"category_scores_gemma":[0.0001250815,0.0002178951,0.0001224905,0.0002276403,0.0003581586,0.0007954943,0.00008967886,0.0001297197,0.00006987114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006997109,"about_ca_system_score_gemma":0.0001337113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002029139,"about_ca_topic_score_gemma":0.000001770823,"domain_scores_codex":[0.9984956,0.0000445782,0.0003431637,0.0003492615,0.000157744,0.0006096634],"domain_scores_gemma":[0.9988598,0.0001797576,0.0001402097,0.0003975093,0.0001361926,0.0002865632],"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.000005624422,0.00006855388,0.001718326,0.0000278758,0.00004982156,0.000002280796,0.0006411527,0.000006414393,0.01119461,0.1689758,0.0005266523,0.8167829],"study_design_scores_gemma":[0.02631546,0.0009730595,0.0792232,0.0007001071,0.0003688542,0.002433131,0.002672219,0.6193424,0.1312662,0.05224437,0.07501241,0.009448552],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00324182,0.00004492961,0.9832955,0.0003375844,0.00138912,0.0005082748,0.00003501841,0.000342908,0.01080482],"genre_scores_gemma":[0.9010993,0.000006118435,0.09798452,0.0005124927,0.0001582309,0.00005965587,0.00001745715,0.00001505517,0.0001471288],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8978575,"threshold_uncertainty_score":0.8885503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02837333951332646,"score_gpt":0.2540666528241169,"score_spread":0.2256933133107905,"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."}}