{"id":"W2741405093","doi":"10.23638/lmcs-15(3:3)2019","title":"Subspace-Invariant AC$^0$ Formulas","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Combinatorics; Mathematics; Invariant (physics); Parity function; Omega; Subspace topology; Hamming weight; Upper and lower bounds; Discrete mathematics; Boolean function; Hamming code; Mathematical analysis; Physics; Pure mathematics; Algorithm; Mathematical physics; Quantum mechanics","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":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.008532467,0.0006910733,0.001084928,0.001011243,0.0003385437,0.001592168,0.01198703,0.0005148023,0.00003220235],"category_scores_gemma":[0.0004331706,0.0005831478,0.0003784048,0.003139812,0.001037512,0.0008975148,0.02153348,0.002168383,0.00007677163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000313897,"about_ca_system_score_gemma":0.0007571205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000684118,"about_ca_topic_score_gemma":0.000008925913,"domain_scores_codex":[0.9921243,0.001017383,0.0009518294,0.003133757,0.001347532,0.001425233],"domain_scores_gemma":[0.9936832,0.001600864,0.0004178988,0.003599847,0.000289708,0.0004084847],"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.00001096739,0.0003104892,0.0004463741,0.0001247643,0.00001882663,0.0001525454,0.0009007981,0.02981728,0.0004201463,0.314506,0.0001398283,0.6531519],"study_design_scores_gemma":[0.0002165251,0.0001544527,0.003929472,0.0001536057,0.00000401649,0.00004180177,0.000002964743,0.6720014,0.0007156731,0.3215428,0.0006546417,0.0005826703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001811274,0.0002834059,0.9842668,0.001304455,0.009126912,0.0007394592,0.000005617266,0.0004177182,0.002044366],"genre_scores_gemma":[0.0305225,0.00005868045,0.9677388,0.001209435,0.0003491863,0.00005234648,0.000002248065,0.00001754731,0.00004925146],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6525693,"threshold_uncertainty_score":0.999662,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1122676605300957,"score_gpt":0.402389845439322,"score_spread":0.2901221849092263,"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."}}