{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259155,0.00007193493,0.00006026497,0.00009318988,0.0003151383,0.0003716806,0.0001285625,0.0000290624,0.000002197763],"category_scores_gemma":[0.0000281391,0.00005251174,0.00002697587,0.0002087859,0.00007244126,0.001587359,0.00004263943,0.00006984296,0.000007560578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949883,"about_ca_system_score_gemma":0.00004537084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005651456,"about_ca_topic_score_gemma":0.00001024398,"domain_scores_codex":[0.9993042,0.00003000579,0.0002357934,0.00008745963,0.0002035368,0.0001389718],"domain_scores_gemma":[0.9993209,0.0002261536,0.0001334817,0.00009380203,0.0002034436,0.00002223185],"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.000006867746,0.000002782664,0.000140838,0.00001485541,0.000003670599,5.537564e-8,0.0003433744,0.005315599,0.00002731065,0.5300096,0.0001054371,0.4640296],"study_design_scores_gemma":[0.0004622655,0.00003724811,0.01192595,0.00001028,0.000003131669,0.00001492876,0.0002003145,0.676091,0.0001657375,0.3069376,0.004066169,0.00008537693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009397312,0.0000314538,0.9866529,0.0007936696,0.00008367066,0.0005581792,0.000004042428,0.0001102786,0.002368556],"genre_scores_gemma":[0.9511014,0.000006374371,0.04854,0.0002145487,0.00002865784,0.00008003114,0.00001643538,0.000002629066,0.00000994445],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9417041,"threshold_uncertainty_score":0.3584124,"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."}}