{"id":"W2176819926","doi":"10.1609/aaai.v28i1.9125","title":"Linear-Time Filtering Algorithms for the Disjunctive Constraint","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Algorithm; Constraint (computer-aided design); Logarithm; Time complexity; Time constraint; Data structure; Tree (set theory); Constant (computer programming); Running time; Theoretical computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002874957,0.002046999,0.001460807,0.002564015,0.001366718,0.002978283,0.003996514,0.001836205,0.01464906],"category_scores_gemma":[0.01293656,0.0009205702,0.001842202,0.004242743,0.001223829,0.006179598,0.002086643,0.003166762,0.003570485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003202581,"about_ca_system_score_gemma":0.003467792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01006604,"about_ca_topic_score_gemma":0.01203355,"domain_scores_codex":[0.9962842,0.0005325363,0.0003838285,0.0008294876,0.00141579,0.0005541059],"domain_scores_gemma":[0.9897878,0.005456122,0.0007288575,0.001934392,0.001758197,0.0003346025],"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.0005137066,0.0005294948,0.001155331,0.000466888,0.0001114591,0.00008377508,0.0002409748,0.1071979,0.006758999,0.07778569,0.02233231,0.7828234],"study_design_scores_gemma":[0.0002037531,0.0001202572,0.0003879044,0.00004602139,0.00005411156,0.000146569,0.00007331829,0.8852973,0.009722007,0.09056565,0.01331977,0.00006345194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002641964,0.0001945001,0.9929891,0.0001249451,0.00004874514,0.00009285186,0.0001011746,0.001503087,0.002303613],"genre_scores_gemma":[0.03156659,0.0001762131,0.963824,0.0001505716,0.00007721193,0.0002373774,0.0005884052,0.0004709168,0.002908735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01464906,"threshold_uncertainty_score":0.04900599,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06594457206901701,"score_gpt":0.2901017018172611,"score_spread":0.2241571297482441,"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."}}