{"id":"W2102573817","doi":"10.1145/2528401","title":"The expressibility of functions on the boolean domain, with applications to counting CSPs","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Unary operation; Counting problem; Boolean function; clone (Java method); Set (abstract data type); Complexity of constraint satisfaction; Bipartite graph; Function (biology); Binary number; Arity","routes":{"ca_aff":true,"ca_fund":true,"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.0005211174,0.0000501947,0.00006296732,0.00002768977,0.0003843162,0.0001247054,0.001360306,0.00001437548,0.00002787921],"category_scores_gemma":[0.0003162163,0.00001955837,0.00005706817,0.0002547902,0.00007005919,0.0001791041,0.0001960473,0.000150661,0.00001389403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000303578,"about_ca_system_score_gemma":0.00006218745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009228548,"about_ca_topic_score_gemma":0.0000183528,"domain_scores_codex":[0.9992781,0.00007833797,0.0002310618,0.00007161564,0.0002596819,0.00008125041],"domain_scores_gemma":[0.997921,0.0003909979,0.0003230197,0.001041134,0.0002873833,0.00003646356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0002058516,0.0005933904,0.05528592,0.00003895256,0.0004627714,0.000001849718,0.008595886,0.08006842,0.02565958,0.2419529,0.2091076,0.3780269],"study_design_scores_gemma":[0.001501119,0.0007135222,0.6918157,0.0003778792,0.0001006821,0.0002720831,0.00652776,0.01585762,0.009354864,0.1458454,0.1271137,0.0005197391],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1553695,0.00002552413,0.7556182,0.08604601,0.0002873476,0.0005282789,0.000001589147,0.00001588931,0.002107641],"genre_scores_gemma":[0.9808163,0.000004982014,0.01811675,0.0007633312,0.00006725054,0.00001992941,5.309023e-8,0.000003342875,0.0002080616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8254467,"threshold_uncertainty_score":0.2955889,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01345587245328604,"score_gpt":0.23035774983965,"score_spread":0.216901877386364,"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."}}