{"id":"W1626677565","doi":"10.1609/aaai.v24i1.7554","title":"Propagating Conjunctions of AllDifferent Constraints","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche; Australian Government","keywords":"Bipartite graph; Matching (statistics); Mathematics; Propagator; Combinatorics; 3-dimensional matching; Constraint (computer-aided design); Time complexity; Graph; Discrete 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.0003264857,0.0001555573,0.0002024326,0.0001254302,0.0001553034,0.00011199,0.0009379755,0.00008402833,0.0003151956],"category_scores_gemma":[0.0004963198,0.0001178902,0.000101142,0.0004570154,0.0006244623,0.0002853321,0.0001823426,0.0003626268,0.00002458791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001527664,"about_ca_system_score_gemma":0.0001347876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001569525,"about_ca_topic_score_gemma":0.00002119079,"domain_scores_codex":[0.9985603,0.00001229099,0.0005440499,0.0003120238,0.0003696614,0.0002016707],"domain_scores_gemma":[0.9983168,0.00008624871,0.0004759201,0.0002516497,0.0007952207,0.00007419442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000008084334,0.00006828831,0.0007718112,0.00001555205,0.000007841917,6.807489e-8,0.0003196928,0.00002777644,0.1757304,0.7201394,0.00001837403,0.1028927],"study_design_scores_gemma":[0.00004263868,0.0001149473,0.001962978,0.0001189667,0.00001177198,0.00001165528,0.0004361821,0.06286051,0.8736846,0.06053261,0.00003915807,0.0001839998],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6717104,0.000004149832,0.2715783,0.005588816,0.002145199,0.0009575739,0.00001406477,0.0002095312,0.04779195],"genre_scores_gemma":[0.9888776,0.000006533382,0.01091074,0.00007998232,0.00003211046,0.00001382909,3.83537e-7,0.000006336816,0.0000725115],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6979542,"threshold_uncertainty_score":0.4807425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04567041664019401,"score_gpt":0.2747648551204846,"score_spread":0.2290944384802906,"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."}}