{"id":"W2131358503","doi":"10.1016/j.ic.2006.09.005","title":"Towards a dichotomy theorem for the counting constraint satisfaction problem","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Discrete mathematics; Counting problem; Homomorphism; Complexity of constraint satisfaction; Combinatorics; Time complexity; Class (philosophy); Constraint (computer-aided design); Constraint graph; Set (abstract data type); Constraint satisfaction dual problem; Constraint satisfaction; Local consistency; Computer science","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.006097498,0.00113006,0.002738138,0.003144052,0.003867462,0.008166187,0.005002664,0.005099284,0.01461891],"category_scores_gemma":[0.02702711,0.001208374,0.002584398,0.003950836,0.007238871,0.01845817,0.009088867,0.01744456,0.001821282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003972527,"about_ca_system_score_gemma":0.002622185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001950521,"about_ca_topic_score_gemma":0.001709836,"domain_scores_codex":[0.994609,0.001765263,0.00022207,0.001130785,0.001543417,0.0007294407],"domain_scores_gemma":[0.977019,0.01903363,0.0005684256,0.001344159,0.001297311,0.0007375108],"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.00005296092,0.00005362959,0.000170767,0.00007373542,0.00001614176,0.00003599775,0.0001206566,0.001784111,0.000329024,0.9842934,0.005748023,0.007321541],"study_design_scores_gemma":[0.00001901765,0.000007373025,0.00004689908,0.00001502721,0.000006419561,0.00001688623,0.00002202447,0.01179651,0.0001209131,0.9866506,0.001291951,0.000006293223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05266651,0.001635686,0.8016187,0.03392016,0.001028921,0.0001808109,0.0008846699,0.0008131407,0.1072513],"genre_scores_gemma":[0.650587,0.002384215,0.2918137,0.01578589,0.0041702,0.001009122,0.002585296,0.0008948838,0.03076962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01461891,"threshold_uncertainty_score":0.04890507,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01361824642734606,"score_gpt":0.278929148448292,"score_spread":0.265310902020946,"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."}}