{"id":"W2118223706","doi":"10.1016/j.tcs.2005.09.011","title":"The complexity of partition functions","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Constraint satisfaction problem; Adjacency matrix; Homomorphism; Partition (number theory); Counting problem; Discrete mathematics; Time complexity; Equivalence (formal languages); Graph","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.00217506,0.0001058375,0.0001225357,0.0001169198,0.0009741614,0.0002173172,0.002738653,0.00002444873,0.00003168154],"category_scores_gemma":[0.0001374726,0.00006938363,0.00006509703,0.001408809,0.0150193,0.0007307766,0.0009703197,0.0001909413,0.0001145798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004992185,"about_ca_system_score_gemma":0.00009757566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001097821,"about_ca_topic_score_gemma":0.000002625632,"domain_scores_codex":[0.9978547,0.0001618083,0.0002659381,0.0004134055,0.0007797646,0.0005243713],"domain_scores_gemma":[0.9979419,0.0004596811,0.0000697653,0.001035446,0.0003104666,0.0001828021],"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.000007764982,0.0000375174,0.00001752892,0.00000145432,0.000002098548,5.062492e-7,0.00009689214,0.0004013423,0.0006314819,0.9236303,0.00005305828,0.07512006],"study_design_scores_gemma":[0.00009608372,0.0001053865,0.0007206265,0.000006131927,0.000001215869,0.00001149376,0.000005378414,0.3416099,0.006977708,0.649463,0.0009237322,0.00007934462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01020814,0.00003856308,0.9798897,0.005097442,0.0002574704,0.0001343944,0.000001555152,0.0001122185,0.004260549],"genre_scores_gemma":[0.8961343,0.000005752139,0.1035922,0.0001451223,0.00008640872,0.000007773617,2.884546e-7,0.000003581962,0.00002459692],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8859261,"threshold_uncertainty_score":0.9876612,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04045361536678201,"score_gpt":0.3106491400712147,"score_spread":0.2701955247044327,"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."}}