{"id":"W2112167630","doi":"10.1016/j.tcs.2009.06.003","title":"The complexity of weighted Boolean #CSP with mixed signs","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Parameterized complexity; Discrete mathematics; Sign (mathematics); Partition (number theory); Weight function; Combinatorics; Function (biology); Boolean function; Polynomial; Affine transformation; Pure mathematics","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.002343103,0.0002160815,0.0002637415,0.0001796486,0.0009332238,0.0003523739,0.005304048,0.00003887524,0.00001238661],"category_scores_gemma":[0.00008948912,0.0001234946,0.00007367387,0.002361223,0.01764596,0.0006239759,0.0007893346,0.0003208162,0.00002313033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004768133,"about_ca_system_score_gemma":0.0001791481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001511269,"about_ca_topic_score_gemma":0.000001716851,"domain_scores_codex":[0.9964632,0.0002778928,0.0003359414,0.0007069194,0.001339844,0.0008761726],"domain_scores_gemma":[0.9968957,0.0006130867,0.0001198079,0.001598661,0.0004495853,0.0003231713],"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.00005044531,0.00006787699,0.00001847032,0.000002324757,0.000004394848,0.000009024992,0.0001685832,0.00005751847,0.001871531,0.9493023,0.00002241961,0.04842509],"study_design_scores_gemma":[0.0002617815,0.001070473,0.001622327,0.00002287397,0.000002560853,0.00003114796,0.00001017228,0.1623802,0.02012131,0.8142076,0.00008618397,0.0001833703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02617905,0.00003833257,0.9659081,0.003587421,0.0001557715,0.0002579794,0.000001434832,0.0001602564,0.003711712],"genre_scores_gemma":[0.8346222,0.000004576826,0.1650705,0.0002444462,0.00003718129,0.000003276055,3.214464e-7,0.000005608037,0.00001189642],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8084431,"threshold_uncertainty_score":0.9856328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02581801843068483,"score_gpt":0.2847712129943751,"score_spread":0.2589531945636903,"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."}}