{"id":"W2032487621","doi":"10.1145/1970398.1970400","title":"Complexity of conservative constraint satisfaction problems","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unary operation; Constraint satisfaction problem; Mathematics; Constraint satisfaction; Constraint (computer-aided design); Constraint logic programming; Set (abstract data type); Constraint programming; Time complexity; Complexity of constraint satisfaction; Mathematical proof; Constraint graph; Local consistency; Constraint satisfaction dual problem; Variable (mathematics); Discrete mathematics; Computer science; Mathematical optimization; Programming language","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.0002767025,0.0001530977,0.0001965897,0.0002460566,0.0002105926,0.00002115175,0.0006286067,0.00005941178,0.0002475572],"category_scores_gemma":[0.00004948295,0.0001458001,0.0001028258,0.0005860768,0.0006831394,0.0003829389,0.00002303721,0.0002513723,0.00005813881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000056499,"about_ca_system_score_gemma":0.0001172142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007661943,"about_ca_topic_score_gemma":0.00003141644,"domain_scores_codex":[0.9984904,0.0001881941,0.0003377989,0.0003618381,0.0003978117,0.0002239743],"domain_scores_gemma":[0.998376,0.0005620361,0.000146249,0.0004675456,0.0003586937,0.00008951571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005971554,0.0003144553,0.00059805,0.00002560898,0.00007669454,0.000006020633,0.0009979744,0.04329232,0.0003128838,0.920845,0.00001190853,0.03345932],"study_design_scores_gemma":[0.0004177953,0.0003588485,0.03420271,0.00002164947,0.000006000316,0.00003163394,0.00008068935,0.01959391,0.001732318,0.9433887,0.00001580584,0.0001499609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01201083,0.00001447631,0.9852003,0.0005435931,0.0001309079,0.0003199648,0.00003862103,0.0001414878,0.001599799],"genre_scores_gemma":[0.669648,0.000003940199,0.330145,0.000144223,0.000003743093,0.00002639761,0.000004261858,0.000005445033,0.00001897255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6576372,"threshold_uncertainty_score":0.5945556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1657644237840136,"score_gpt":0.3205390979875744,"score_spread":0.1547746742035607,"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."}}