{"id":"W2966418478","doi":"10.48550/arxiv.1809.04092","title":"A Fixed-Depth Size-Hierarchy Theorem for AC$^0[\\\\oplus]$ via the Coin\\n Problem","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Circuit complexity; Boolean circuit; Mathematics; Boolean function; Discrete mathematics; Truth table; Combinatorics; Binary logarithm; Upper and lower bounds; Function (biology); Polynomial; Parity function; Computable function; Random oracle; Electronic circuit; Algorithm; Computer science; Boolean expression; Physics; Mathematical analysis; Quantum mechanics","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.001292254,0.0008327073,0.0007747259,0.0008780437,0.001398407,0.002747388,0.002371772,0.001113601,0.01580308],"category_scores_gemma":[0.01015883,0.0006314799,0.001613642,0.001014208,0.002519898,0.008976737,0.003574946,0.003933195,0.001487006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004511574,"about_ca_system_score_gemma":0.002605555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007378296,"about_ca_topic_score_gemma":0.01101607,"domain_scores_codex":[0.998041,0.000271068,0.00009407988,0.0004265184,0.0006657525,0.0005015541],"domain_scores_gemma":[0.994926,0.003257282,0.0002422853,0.0007713193,0.0005444202,0.0002586878],"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.0003392869,0.00009704568,0.001810201,0.0003771129,0.00003817083,0.000129043,0.0004069467,0.01131917,0.009703282,0.9007347,0.01219743,0.06284754],"study_design_scores_gemma":[0.00009469396,0.00009327344,0.001073956,0.00008838881,0.00009333831,0.0002502956,0.0001274864,0.08589727,0.01112998,0.8862398,0.01485604,0.00005550247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2796362,0.00181544,0.561761,0.009384718,0.0002937482,0.0003612941,0.002075317,0.003195842,0.1414764],"genre_scores_gemma":[0.8347149,0.0009123742,0.1282664,0.003045126,0.0002639565,0.0004313863,0.001335178,0.0007143648,0.0303162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01580308,"threshold_uncertainty_score":0.05286652,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02939916937462455,"score_gpt":0.1913531464959238,"score_spread":0.1619539771212992,"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."}}