{"id":"W2615489195","doi":"","title":"The Complexity of Integer Bound Propagation","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Search tree; Constraint (computer-aided design); Set (abstract data type); Integer (computer science); Fixed point; Tree (set theory); Constraint satisfaction problem; Local consistency; Upper and lower bounds; Time complexity; Polynomial; Algorithm; Discrete mathematics; Computer science; Combinatorics; Search algorithm","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004279196,0.001025562,0.001619294,0.001107469,0.001863673,0.006354688,0.00302206,0.001849221,0.01321607],"category_scores_gemma":[0.03373686,0.0009920738,0.00216738,0.002904812,0.002606675,0.01179588,0.003904441,0.00455524,0.002309848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002898431,"about_ca_system_score_gemma":0.002923114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004541015,"about_ca_topic_score_gemma":0.003873173,"domain_scores_codex":[0.9928093,0.002025795,0.0004044035,0.001164761,0.002374333,0.001221335],"domain_scores_gemma":[0.9565377,0.03657946,0.001340461,0.003643427,0.00146959,0.000429338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00145685,0.0003849737,0.004168014,0.001613129,0.0002353359,0.0005175493,0.001232195,0.2788041,0.008166364,0.3804395,0.03536938,0.2876126],"study_design_scores_gemma":[0.0001471024,0.00005190842,0.0007025928,0.0001015477,0.0001001134,0.0002436606,0.0002622524,0.4958062,0.004218779,0.4906403,0.007677089,0.00004856055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1415798,0.002104793,0.7792831,0.01350884,0.0003484047,0.0004825496,0.002787396,0.003665515,0.0562396],"genre_scores_gemma":[0.635612,0.001806942,0.3430706,0.00156559,0.0003589993,0.0004599679,0.00314212,0.001306466,0.01267737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01321607,"threshold_uncertainty_score":0.04421216,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4425624707903778,"score_gpt":0.4107181668670509,"score_spread":0.03184430392332688,"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."}}