{"id":"W2909573631","doi":"10.1109/smc.2018.00569","title":"Constrained Optimization with Partial CP-Nets","year":2018,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Directed acyclic graph; Topological sorting; Computer science; Pruning; Partially ordered set; Preference; Set (abstract data type); Beam search; Bidirectional search; Theoretical computer science; Mathematics; Search algorithm; Algorithm; Combinatorics; Best-first search","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007681023,0.00008077406,0.00006706485,0.00006309288,0.0001193914,0.0001267211,0.0001549133,0.0000347294,0.0009980383],"category_scores_gemma":[0.00001478697,0.00006394559,0.00001587185,0.0002815211,0.0001310854,0.0004275872,0.00003386428,0.00003783886,0.00007797082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001524281,"about_ca_system_score_gemma":0.00008032972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000091875,"about_ca_topic_score_gemma":0.00002911927,"domain_scores_codex":[0.9993415,0.00002454956,0.0001203984,0.0002211573,0.0001469828,0.0001454505],"domain_scores_gemma":[0.9994987,0.00001986481,0.00004799126,0.0002196655,0.0001418642,0.0000719772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007585403,0.0001438161,0.006894449,0.000008836059,0.00007621277,0.00002239225,0.001437363,0.1982889,0.0006037507,0.5538676,0.005531771,0.233049],"study_design_scores_gemma":[0.0004785333,0.00014992,0.0005925848,0.000005896115,0.000003529279,0.00004107217,0.00002393949,0.9937017,0.002006523,0.0001042173,0.002748904,0.0001431744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005576277,0.000001514513,0.9540681,0.001385436,0.0001846045,0.0001021674,5.591066e-7,0.0002901193,0.04340988],"genre_scores_gemma":[0.546321,0.000001824023,0.4526634,0.0005986989,0.00005351434,0.000004253248,0.000003289819,0.000003902086,0.000350065],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7954128,"threshold_uncertainty_score":0.9999152,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008978296104518087,"score_gpt":0.220240159840578,"score_spread":0.21126186373606,"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."}}