{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959972,0.0008417054,0.00136272,0.001676037,0.001779123,0.003856182,0.00301456,0.001476569,0.007117067],"category_scores_gemma":[0.01796636,0.0009279427,0.002485832,0.001709217,0.003711142,0.0135034,0.00449646,0.005188354,0.0008311108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004447208,"about_ca_system_score_gemma":0.001482775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003255289,"about_ca_topic_score_gemma":0.00287965,"domain_scores_codex":[0.9949479,0.0006946236,0.0002000376,0.001209586,0.00176638,0.001181395],"domain_scores_gemma":[0.98408,0.01048307,0.0009719752,0.002376229,0.001149188,0.0009395973],"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.0003709092,0.0001290801,0.003503029,0.0003043817,0.0001010377,0.00029641,0.0006944785,0.03557498,0.01169799,0.9060469,0.005306453,0.03597441],"study_design_scores_gemma":[0.00007050685,0.0000822865,0.001106297,0.00003793004,0.00009890572,0.0004386138,0.00008158434,0.1772418,0.006821498,0.8085996,0.005365641,0.00005531202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1676845,0.001785526,0.7918363,0.004055237,0.0001074769,0.0001431607,0.001002301,0.001079265,0.03230637],"genre_scores_gemma":[0.9303669,0.001130127,0.06095772,0.001178211,0.0003983889,0.0001966956,0.0004792786,0.0002424569,0.005050182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007117067,"threshold_uncertainty_score":0.03226691,"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."}}