{"id":"W2949059408","doi":"10.48550/arxiv.0909.3273","title":"Decomposition of the NVALUE constraint","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Local consistency; Heuristics; Consistency (knowledge bases); Decomposition; Constraint (computer-aided design); Decomposition method (queueing theory); Mathematical optimization; Computer science; Range (aeronautics); Upper and lower bounds; Global optimization; Benders' decomposition; Constraint programming; Theoretical computer science; Constraint satisfaction; Mathematics; Discrete mathematics; Artificial intelligence; Engineering","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.0002120173,0.0001726948,0.0002049069,0.00008376329,0.0001002876,0.00006236305,0.0007583589,0.0001721207,0.00005824301],"category_scores_gemma":[0.00004304187,0.0001402711,0.0001797186,0.0001898854,0.0001238244,0.0001233177,0.0004912937,0.0003771145,0.00002541839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006960913,"about_ca_system_score_gemma":0.0002327721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002828879,"about_ca_topic_score_gemma":0.00001550357,"domain_scores_codex":[0.9987468,0.0001312464,0.0003565336,0.0003695247,0.0002412867,0.0001545938],"domain_scores_gemma":[0.9986129,0.00005018735,0.0003318504,0.0008097706,0.0001421691,0.00005310346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00002324822,0.0004124519,0.488873,0.0002509785,0.000237023,0.00002191175,0.002374424,0.07959098,0.009016642,0.125497,0.002059581,0.2916427],"study_design_scores_gemma":[0.0003417929,0.0000394817,0.9450827,0.0002779034,0.00003522174,0.00003649398,0.00002732778,0.03743948,0.008505443,0.007458285,0.0004110949,0.0003447204],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4132513,0.00007012088,0.5767061,0.003244942,0.001395551,0.0003867047,0.00001058873,0.0001515679,0.004783094],"genre_scores_gemma":[0.9833328,0.00004040022,0.01598349,0.0004973368,0.00005819293,0.000007988669,0.000009721169,0.000006310871,0.0000637594],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5700815,"threshold_uncertainty_score":0.5720088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02780240486610733,"score_gpt":0.2749630706695686,"score_spread":0.2471606658034613,"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."}}