{"id":"W2407347952","doi":"","title":"Compression of Boolean Functions.","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Boolean function; Boolean circuit; Circuit complexity; Implicant; Circuit minimization for Boolean functions; Discrete mathematics; Binary decision diagram; Mathematics; Monotone polygon; Branching (polymer chemistry); Quadratic equation; Combinatorics; Function (biology); Electronic circuit; Algorithm; Boolean expression","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.00004501679,0.00004307302,0.00006361121,0.0000525619,0.00005279644,0.000035998,0.0003674192,0.00001691753,0.0004834952],"category_scores_gemma":[0.000005078085,0.00003332612,0.00003738252,0.0001781237,0.00003428677,0.0002928448,0.0001716215,0.00004359914,0.0001985475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003077879,"about_ca_system_score_gemma":0.000007942966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000119775,"about_ca_topic_score_gemma":0.000002331037,"domain_scores_codex":[0.9995645,0.00001386639,0.0001064758,0.0001148475,0.0001127063,0.00008759255],"domain_scores_gemma":[0.9995364,0.00003157059,0.00002936091,0.0003086549,0.00005631822,0.00003770949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001332809,0.0001796802,0.001373057,0.00001675043,0.00001583873,9.312582e-7,0.0002250787,0.000070547,0.005330139,0.3654917,0.08790524,0.5393897],"study_design_scores_gemma":[0.000749379,0.0002772287,0.07262361,0.00006516241,0.000006036003,0.0000211308,0.0001915977,0.6132684,0.02636637,0.2189992,0.06696066,0.0004712789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01740947,0.0000449424,0.9466713,0.0005826346,0.0002929343,0.00008384703,6.134595e-7,0.0001085853,0.03480565],"genre_scores_gemma":[0.8735623,0.000003852419,0.1240709,0.000213699,0.00002538911,0.000007252856,0.00000104864,0.000002228292,0.00211331],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8561528,"threshold_uncertainty_score":0.5293934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01212308748978913,"score_gpt":0.2079682523820154,"score_spread":0.1958451648922263,"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."}}