{"id":"W1542640015","doi":"10.1007/978-3-540-30201-8_23","title":"A Domain Consistency Algorithm for the Stretch Constraint","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; University of Waterloo","funders":"","keywords":"Local consistency; Constraint (computer-aided design); Consistency (knowledge bases); Computer science; Benchmark (surveying); Domain (mathematical analysis); Constraint satisfaction; Constraint satisfaction problem; Algorithm; Constraint programming; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; Probabilistic logic","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007726546,0.00043664,0.0003859297,0.0004124089,0.0005098548,0.0006101515,0.001934872,0.0002615516,0.0001229899],"category_scores_gemma":[0.00005561779,0.0003349347,0.0001959736,0.0004147705,0.001589085,0.0003461846,0.0004551483,0.0005546815,0.00001706898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003767028,"about_ca_system_score_gemma":0.001495073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001934352,"about_ca_topic_score_gemma":0.00008948966,"domain_scores_codex":[0.997114,0.00002349621,0.0005155345,0.001132608,0.0006781652,0.0005361731],"domain_scores_gemma":[0.9972907,0.0009111477,0.0002843125,0.001046929,0.0003296227,0.0001372914],"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.00000121293,0.000008701443,0.000003794089,0.000008694961,0.00001171966,0.00001403998,0.0003369137,0.01091579,0.000006167197,0.1659363,0.000008148421,0.8227485],"study_design_scores_gemma":[0.000504781,0.0001018116,0.00004632985,0.0001686417,0.00001140155,0.0001270595,0.000001170532,0.6468995,0.0001028312,0.3494961,0.002100559,0.000439836],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004572539,0.0002933689,0.991691,0.003197181,0.001981153,0.0009440011,0.00002520451,0.0001477843,0.001715749],"genre_scores_gemma":[0.01767104,0.00005897207,0.9800211,0.001794641,0.0002953893,0.00003299151,0.000007364496,0.00002436924,0.00009411295],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8223087,"threshold_uncertainty_score":0.9999103,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01430726267530474,"score_gpt":0.2393092456827425,"score_spread":0.2250019830074378,"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."}}