{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006837927,0.00008500057,0.00008643755,0.0000455001,0.0003191436,0.000082123,0.0004944691,0.00002933484,0.00003337933],"category_scores_gemma":[0.0001625382,0.00005215336,0.00004920591,0.0002868878,0.0002489634,0.0003509593,0.0001008276,0.0001028294,0.00002549556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002418291,"about_ca_system_score_gemma":0.0000498692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003086384,"about_ca_topic_score_gemma":0.00003812895,"domain_scores_codex":[0.9990608,0.00009790379,0.0001669769,0.0002459659,0.0001541146,0.0002742038],"domain_scores_gemma":[0.9986135,0.0005913216,0.0000680923,0.0004268545,0.0002342309,0.00006601366],"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.00001783294,0.000008719961,0.001809603,0.00000712252,0.00001760832,7.964737e-7,0.0004252808,0.000001017996,0.0005231965,0.9573848,0.000557565,0.03924643],"study_design_scores_gemma":[0.0006244516,0.0002659311,0.01506032,0.00002688556,0.000004206209,0.0000162514,0.0002412427,0.01199002,0.007599941,0.947988,0.01596962,0.0002130912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002447887,0.00006086108,0.9806413,0.0006045303,0.00007298386,0.000979951,0.000003351218,0.000148535,0.01504057],"genre_scores_gemma":[0.8397797,0.00005274296,0.1576435,0.0004239245,0.00002366351,0.000429332,0.000001621797,0.00001261488,0.001632925],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8373318,"threshold_uncertainty_score":0.2454626,"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."}}