{"id":"W1558278838","doi":"10.1145/3095799","title":"An Average-Case Depth Hierarchy Theorem for Boolean Circuits","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hierarchy; Conjecture; Boolean function; Discrete mathematics; Combinatorics; Converse; Bounded function; Boolean circuit; Random variable; Polynomial; Statistics; Mathematical analysis","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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000960427,0.00009619107,0.0001605072,0.00006896025,0.0009341972,0.000545538,0.008680812,0.0000363723,0.000007224439],"category_scores_gemma":[0.0009464288,0.00006017123,0.0002527037,0.00006261044,0.0001168205,0.0008706469,0.000898214,0.0002428257,0.000002255925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002337431,"about_ca_system_score_gemma":0.00007257118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006254405,"about_ca_topic_score_gemma":0.00001644106,"domain_scores_codex":[0.9990788,0.00008533624,0.0002461571,0.0001378202,0.0002505925,0.0002013215],"domain_scores_gemma":[0.9961566,0.0001786204,0.0005085377,0.002882485,0.0001567846,0.0001170218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005063911,0.0003597965,0.00244571,0.00003288254,0.0001604563,0.001014658,0.002564157,0.0003635594,0.001490062,0.1608506,0.007876555,0.8227909],"study_design_scores_gemma":[0.001075584,0.000416118,0.01316528,0.00007889936,0.00002841984,0.006333132,0.00005018515,0.02309602,0.003240236,0.9443263,0.007983472,0.000206363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3413288,0.0001810272,0.6371099,0.01526584,0.00404292,0.0003058925,0.00001085375,0.00004096629,0.001713796],"genre_scores_gemma":[0.9497581,0.000008617408,0.04921359,0.0003960354,0.0004901596,0.000001416356,8.122858e-8,0.000007368534,0.0001246529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8225845,"threshold_uncertainty_score":0.9966827,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05825755211603171,"score_gpt":0.3181386363919909,"score_spread":0.2598810842759591,"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."}}