{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003201347,0.001094156,0.002753211,0.003418571,0.003023327,0.01047362,0.004139638,0.003963979,0.01411941],"category_scores_gemma":[0.03620664,0.001503896,0.001773402,0.004699309,0.007716201,0.02666851,0.004552566,0.008126996,0.001334546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004726346,"about_ca_system_score_gemma":0.001832561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001989656,"about_ca_topic_score_gemma":0.001542984,"domain_scores_codex":[0.9955283,0.00142172,0.000170598,0.0007235969,0.00148632,0.0006694092],"domain_scores_gemma":[0.9477097,0.04373525,0.002099811,0.003519109,0.001351517,0.001584642],"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.0001135512,0.00004329123,0.001024214,0.00007478799,0.0000221987,0.00004599384,0.0002720108,0.007485757,0.0003302486,0.9799163,0.003558496,0.007113116],"study_design_scores_gemma":[0.00001901553,0.000006089757,0.0003508464,0.00001009851,0.00001065899,0.00004728551,0.00004329874,0.01504957,0.0001343451,0.9835235,0.0007946072,0.0000107259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6649363,0.004320522,0.1788,0.02888606,0.0004504453,0.0001111809,0.002127273,0.0005551264,0.119813],"genre_scores_gemma":[0.9715989,0.001659351,0.01170771,0.0007998447,0.0009226816,0.0001757881,0.001035055,0.0002488716,0.01185181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01411941,"threshold_uncertainty_score":0.04723418,"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."}}