{"id":"W2139991023","doi":"10.1002/rsa.10065","title":"The shortest disjunctive normal form of a random Boolean function","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Boolean function; Logarithm; Function (biology); Discrete mathematics; Parity function; Disjunctive normal form; Binary logarithm; Mathematical proof; 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.0007398885,0.0002715954,0.0004692986,0.00006244073,0.0007930304,0.00006391481,0.0001704852,0.0001222703,0.00007183974],"category_scores_gemma":[0.0004628494,0.0001471167,0.0002141858,0.0001405359,0.0003547097,0.0001186575,0.00006244923,0.0002446493,3.463481e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357401,"about_ca_system_score_gemma":0.00002556915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001274867,"about_ca_topic_score_gemma":0.00002034797,"domain_scores_codex":[0.9984398,0.0001803833,0.0004566598,0.0002638102,0.0003165405,0.0003427604],"domain_scores_gemma":[0.9979519,0.001268218,0.0002263153,0.0003532039,0.0001040814,0.00009628305],"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.002441243,0.00003338134,0.001064247,0.00007198027,0.000411076,0.000004647466,0.001923663,0.00001305497,0.0002081362,0.9474118,0.0006316747,0.0457851],"study_design_scores_gemma":[0.009309184,0.0001684351,0.003420918,0.00002082427,0.0001959442,0.00006068376,0.0007796978,0.0003412217,0.00118918,0.9798094,0.004466471,0.0002380401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9304155,0.004910425,0.04735082,0.0001085949,0.002546878,0.001581293,0.00008399004,0.0001225501,0.01288],"genre_scores_gemma":[0.9973463,0.0002324771,0.001847031,0.00005101768,0.0001749517,0.000023792,0.000004545881,0.00002850839,0.0002913947],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06693083,"threshold_uncertainty_score":0.6099429,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01229884077066146,"score_gpt":0.2507774985054351,"score_spread":0.2384786577347737,"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."}}