{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005988596,0.0001731474,0.0001826664,0.00006496356,0.0003265853,0.0002198717,0.001167022,0.00006220959,0.00007854339],"category_scores_gemma":[0.0006344282,0.0001088357,0.0001294151,0.0003281374,0.0003442074,0.000278849,0.0002049926,0.0001835305,0.00005064276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003061841,"about_ca_system_score_gemma":0.00006408624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001074202,"about_ca_topic_score_gemma":0.000003812981,"domain_scores_codex":[0.9986984,0.00001649988,0.0003811133,0.0003604303,0.0002919195,0.0002516999],"domain_scores_gemma":[0.9984333,0.000385128,0.00028549,0.0002548391,0.0005808754,0.00006037697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000252964,0.00003502569,0.00003908508,0.00001288104,0.00001711339,3.616078e-8,0.0006188325,0.0007447391,0.01016116,0.6512861,0.0001183879,0.3369413],"study_design_scores_gemma":[0.00003663126,0.000127991,0.0001597754,0.00006921727,0.00001258963,0.000004100395,0.0002495383,0.8243713,0.125152,0.04921086,0.000456712,0.0001492196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002772925,0.000004769604,0.9845219,0.006858664,0.0006410148,0.0005711158,0.000007591788,0.00009135922,0.004530692],"genre_scores_gemma":[0.9789952,0.00001214056,0.02019162,0.0003276636,0.0001437986,0.00005668711,6.416071e-7,0.000009931203,0.0002623126],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9762223,"threshold_uncertainty_score":0.443819,"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."}}