{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928371,0.00005933626,0.00007131623,0.0001325343,0.0004477878,0.0001424015,0.0006721847,0.00003864906,0.0001585289],"category_scores_gemma":[0.0003827583,0.00004276035,0.00003805411,0.0007811405,0.001274632,0.0002977523,0.0001754256,0.0002243861,0.0001738262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004108069,"about_ca_system_score_gemma":0.0001449078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002999059,"about_ca_topic_score_gemma":0.0004377677,"domain_scores_codex":[0.9984735,0.0002585963,0.000316789,0.0002044398,0.0004753243,0.0002713676],"domain_scores_gemma":[0.9985803,0.0002429274,0.00006723873,0.0004118471,0.0006367532,0.00006095012],"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.00001211232,0.00003271643,0.00009709841,0.000002700525,0.000003718023,7.584666e-7,0.001164757,0.00001990388,0.0007463243,0.7500231,0.00003926484,0.2478575],"study_design_scores_gemma":[0.00001153645,0.0001235543,0.001445085,0.00001397742,0.00000119068,0.000004159043,0.001130283,0.1527375,0.1830946,0.6610109,0.0003428746,0.00008440005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006806106,0.00003030549,0.9810397,0.001415292,0.0002313258,0.000264238,7.379492e-7,0.00004511604,0.01016717],"genre_scores_gemma":[0.9923671,0.00004174553,0.00743422,0.00001344685,0.00002522935,0.00001572301,7.179501e-7,0.000003624576,0.00009820752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.985561,"threshold_uncertainty_score":0.4696436,"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."}}