{"id":"W1836420046","doi":"10.1007/3-540-45578-7_13","title":"A Filtering Algorithm for the Stretch Constraint","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Constraint (computer-aided design); Pruning; Computer science; Sequence (biology); Algorithm; Filter (signal processing); Time constraint; Mathematical optimization; Mathematics; Computer vision","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.001219752,0.001438898,0.001802938,0.001966257,0.001493228,0.002176199,0.002248022,0.002243977,0.0174229],"category_scores_gemma":[0.004832367,0.000949622,0.00155215,0.002695387,0.0009423085,0.004027375,0.001886941,0.002463335,0.003324954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001163774,"about_ca_system_score_gemma":0.001578366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006175154,"about_ca_topic_score_gemma":0.005809083,"domain_scores_codex":[0.9990815,0.0001055614,0.00006534076,0.0002742823,0.0003539093,0.0001192901],"domain_scores_gemma":[0.9978668,0.001126455,0.0001043352,0.0003828082,0.0004225719,0.0000970649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003171768,0.0001853398,0.0004666107,0.0002246822,0.00006367962,0.0001019702,0.0001652445,0.05742749,0.01246507,0.07481723,0.01628598,0.8374795],"study_design_scores_gemma":[0.0001435747,0.0001646209,0.0004027314,0.0000652441,0.00006230078,0.0002287711,0.00007963544,0.8623943,0.01089914,0.1067507,0.01874712,0.00006182538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003372592,0.0001430268,0.9933407,0.00008583816,0.00006364871,0.00005802055,0.0000744777,0.0006752653,0.002186425],"genre_scores_gemma":[0.03738435,0.0002416518,0.9524437,0.0001200074,0.00009917418,0.0001380911,0.0004770682,0.0004719605,0.008624031],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0174229,"threshold_uncertainty_score":0.05828536,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01939056500295277,"score_gpt":0.2478496464567211,"score_spread":0.2284590814537683,"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."}}