{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005440749,0.0001986068,0.0001719804,0.00008150704,0.0006469614,0.0001293575,0.001652126,0.00007959381,0.00004956032],"category_scores_gemma":[0.00009235264,0.0001534087,0.0001499721,0.0007378599,0.0002975086,0.0003466585,0.0004152162,0.0002498434,0.0001469929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005096311,"about_ca_system_score_gemma":0.00008657727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006877682,"about_ca_topic_score_gemma":0.00005493064,"domain_scores_codex":[0.998515,0.0001720648,0.0001370972,0.0006274751,0.00009730562,0.0004511332],"domain_scores_gemma":[0.9982354,0.000517031,0.0001240119,0.000816962,0.0001751307,0.000131467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009418187,0.0001284476,0.002034322,0.00003147824,0.00009509781,0.00005458527,0.001894192,0.004370798,0.0002189177,0.9588968,0.003264517,0.02891671],"study_design_scores_gemma":[0.0009066362,0.0004270537,0.001104328,0.00002182168,0.00002983994,0.00001892407,0.00009053016,0.8477772,0.0003698796,0.1187468,0.03016841,0.0003385681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0294066,0.00001609647,0.9569759,0.001031773,0.0003112639,0.0003591761,0.000003868286,0.0002880959,0.01160724],"genre_scores_gemma":[0.9804278,0.000009209723,0.01126104,0.0005392576,0.0002647439,0.000002275517,0.00000193388,0.00001719936,0.007476566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9510212,"threshold_uncertainty_score":0.6255828,"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."}}