{"id":"W2172276559","doi":"10.1109/lics.2011.25","title":"The Dichotomy for Conservative Constraint Satisfaction Problems Revisited","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Constraint satisfaction problem; Unary operation; Constraint satisfaction; Conjecture; Constraint (computer-aided design); Complexity of constraint satisfaction; Local consistency; Constraint satisfaction dual problem; Constraint logic programming; Mathematics; Computer science; Constraint graph; Discrete mathematics; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00330126,0.0005088564,0.001148635,0.001754133,0.002614837,0.00394935,0.00167148,0.002371694,0.009733411],"category_scores_gemma":[0.01302123,0.0005669689,0.001302811,0.002446529,0.006082559,0.0110782,0.004456197,0.0102336,0.0008423654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002576629,"about_ca_system_score_gemma":0.001356172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001670255,"about_ca_topic_score_gemma":0.0009783058,"domain_scores_codex":[0.9956185,0.001449316,0.000174324,0.0007674325,0.001370869,0.000619537],"domain_scores_gemma":[0.9879822,0.01003125,0.0004201074,0.0004884314,0.0006691754,0.0004087625],"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.00002806418,0.00002854691,0.0001961986,0.0000872716,0.00000842474,0.00009575582,0.0003003055,0.001508483,0.0003743787,0.9863608,0.003105659,0.007906117],"study_design_scores_gemma":[0.00001252756,0.000008130961,0.0001511349,0.0000262299,0.00000379078,0.00005787157,0.0001144375,0.003995026,0.0001403192,0.9917355,0.003748491,0.000006385936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1483942,0.01410815,0.5800984,0.06822503,0.0009973136,0.0001738141,0.001045265,0.0007887557,0.1861691],"genre_scores_gemma":[0.9275833,0.004374826,0.04508039,0.005427561,0.001249146,0.0002417209,0.000699368,0.0001994054,0.01514425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009733411,"threshold_uncertainty_score":0.03256148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06677475835128978,"score_gpt":0.3043379363671991,"score_spread":0.2375631780159093,"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."}}