{"id":"W1650544138","doi":"10.1145/2656209","title":"Exponential Lower Bounds for AC <sup>0</sup> -Frege Imply Superpolynomial Frege Lower Bounds","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Mathematics; Bounded function; Cryptography; Upper and lower bounds; Exponential function; Discrete mathematics; Transformation (genetics); Proof complexity; Polynomial; Combinatorics; Mathematical analysis; Algorithm","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001969246,0.0004012985,0.0003580068,0.0004386084,0.0006255886,0.0004660366,0.001581196,0.0002631338,0.00007765429],"category_scores_gemma":[0.0002809417,0.0004204442,0.000322473,0.0006484741,0.0002552441,0.00167009,0.00005154491,0.0003881607,0.0002128482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000314395,"about_ca_system_score_gemma":0.0003420886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002343805,"about_ca_topic_score_gemma":0.000004273807,"domain_scores_codex":[0.9967424,0.0005408236,0.0006729093,0.0008273565,0.0006261822,0.0005902753],"domain_scores_gemma":[0.9968414,0.0007988069,0.0002050316,0.001381621,0.0004582514,0.000314897],"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.002716437,0.002016956,0.00001968689,0.0000981741,0.0003779841,0.00001987066,0.01191992,0.1781721,0.001487807,0.2621926,0.006116779,0.5348617],"study_design_scores_gemma":[0.005808915,0.00246456,0.0002129466,0.00007654828,0.0001589469,0.0001263885,0.0009362809,0.6723976,0.01110514,0.2761085,0.0292,0.001404153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03359198,0.00006484737,0.9597372,0.0007277196,0.003994425,0.0007257567,0.00006189972,0.0005321323,0.0005639671],"genre_scores_gemma":[0.593916,0.000005838919,0.4043199,0.0005157461,0.0002898913,0.000204392,0.00003549054,0.00005074583,0.0006619349],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.560324,"threshold_uncertainty_score":0.9998248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04404148439805563,"score_gpt":0.3077857384622144,"score_spread":0.2637442540641588,"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."}}