{"id":"W3006499216","doi":"10.1109/ictai.2019.00062","title":"A Divide and Conquer Algorithm for Dominance Testing in Acyclic CP-Nets","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Divide and conquer algorithms; Computer science; Dominance (genetics); Ceteris paribus; Preference; Net (polyhedron); Algorithm; Theoretical computer science; Mathematics; Statistics","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.0001209802,0.00005291689,0.00007495425,0.00005173823,0.00002720613,0.00006267249,0.00008421698,0.00002469569,0.00001897188],"category_scores_gemma":[0.00004705534,0.00004884128,0.00001022425,0.0001415357,0.00001376139,0.0002912978,0.00005027778,0.00003494053,0.00001189036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000130417,"about_ca_system_score_gemma":0.00002267026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003534492,"about_ca_topic_score_gemma":0.00003159192,"domain_scores_codex":[0.9995244,0.00001091951,0.0001079491,0.0001915123,0.0000516196,0.000113662],"domain_scores_gemma":[0.9996022,0.000192422,0.00003368641,0.0001124897,0.00003263206,0.00002656458],"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":[7.982857e-7,0.000006704552,0.01991222,0.000004659226,0.000001325716,7.501525e-7,0.0001023265,0.0001953063,0.0002869183,0.005151937,0.00008190351,0.9742551],"study_design_scores_gemma":[0.0007072107,0.00003125249,0.06483211,0.00001947783,8.191939e-7,0.00001191511,0.00001068347,0.9309997,0.0003030482,0.001543135,0.00143882,0.0001018144],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01929606,0.00001843064,0.9772314,0.0005289527,0.0001226199,0.0002507419,9.321868e-7,0.00005119061,0.002499615],"genre_scores_gemma":[0.5273614,0.000004889495,0.4715911,0.000397676,0.00001025988,0.00001528468,8.178198e-7,0.000003026883,0.0006154865],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9741533,"threshold_uncertainty_score":0.199169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01346909831196018,"score_gpt":0.237207959619433,"score_spread":0.2237388613074728,"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."}}