{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003066641,0.0007223223,0.001056973,0.001774022,0.001118597,0.002598547,0.00145398,0.001162324,0.006148535],"category_scores_gemma":[0.03143372,0.0007742259,0.001285929,0.001190451,0.003662878,0.008081424,0.001609273,0.003199527,0.0008835643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002584424,"about_ca_system_score_gemma":0.001069206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001051313,"about_ca_topic_score_gemma":0.0007403642,"domain_scores_codex":[0.9962315,0.0009430104,0.0002848693,0.0009544021,0.001086851,0.000499322],"domain_scores_gemma":[0.9657453,0.02482118,0.002045266,0.003228692,0.002976539,0.001182933],"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.000696419,0.000140339,0.00568775,0.000428034,0.0001187165,0.0003302699,0.0005219042,0.07174565,0.02152661,0.836452,0.005639603,0.05671275],"study_design_scores_gemma":[0.00005853361,0.000206835,0.002853177,0.00008638884,0.00004625455,0.0005874262,0.00008606895,0.2385951,0.009343993,0.7393757,0.008643067,0.000117441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3564701,0.002038567,0.6064399,0.004346414,0.0003459903,0.0001614267,0.001447782,0.001153862,0.02759591],"genre_scores_gemma":[0.897415,0.000931058,0.0921415,0.0005898885,0.0004871681,0.000326826,0.0007009978,0.0003259428,0.007081555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006148535,"threshold_uncertainty_score":0.02056897,"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."}}