{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T21:17:52Z","timestamp":1783113472490,"version":"3.54.6"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2431657"],"award-info":[{"award-number":["2431657"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ipl.2026.106644","type":"journal-article","created":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T23:03:05Z","timestamp":1777417385000},"page":"106644","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Exponential-size circuit complexity is comeager in symmetric exponential time"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8614-7307","authenticated-orcid":false,"given":"John M.","family":"Hitchcock","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2026.106644_bib0001","series-title":"Proceedings of the Second Structure in Complexity Theory Conference","first-page":"81","article-title":"Resource-bounded Baire category and small circuits in exponential space","author":"Lutz","year":"1987"},{"key":"10.1016\/j.ipl.2026.106644_bib0002","series-title":"Resource-Bounded Category and Measure in Exponential Complexity Classes","author":"Lutz","year":"1987"},{"issue":"6","key":"10.1016\/j.ipl.2026.106644_bib0003","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/0219076","article-title":"Category and measure in complexity classes","volume":"19","author":"Lutz","year":"1990","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/j.ipl.2026.106644_bib0004","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(96)00016-6","article-title":"More on BPP and the polynomial-time hierarchy","volume":"57","author":"Canetti","year":"1996","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10.1016\/j.ipl.2026.106644_bib0005","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/s000370050007","article-title":"Symmetric alternation captures BPP","volume":"7","author":"Russell","year":"1998","journal-title":"Comput. Complex."},{"key":"10.1016\/j.ipl.2026.106644_bib0006","series-title":"2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"433","article-title":"The hardest explicit construction","author":"Korten","year":"2022"},{"key":"10.1016\/j.ipl.2026.106644_bib0007","series-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024","first-page":"1990","article-title":"Symmetric exponential time requires near-maximum circuit size","author":"Chen","year":"2024"},{"key":"10.1016\/j.ipl.2026.106644_bib0008","series-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024","first-page":"2000","article-title":"Symmetric exponential time requires near-maximum circuit size: simplified, truly uniform","author":"Li","year":"2024"},{"issue":"1-3","key":"10.1016\/j.ipl.2026.106644_bib0009","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0019-9958(82)90382-5","article-title":"Circuit-size lower bounds and non-reducibility to sparse sets","volume":"55","author":"Kannan","year":"1982","journal-title":"Inf. Control"},{"key":"10.1016\/j.ipl.2026.106644_bib0010","series-title":"Proceedings of the 13th Annual IEEE Conference on Computational Complexity","first-page":"8","article-title":"Nonrelativizing separations","author":"Buhrman","year":"1998"},{"issue":"2","key":"10.1016\/j.ipl.2026.106644_bib0011","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0304-3975(94)00023-C","article-title":"Almost every set in exponential time is P-bi-immune","volume":"136","author":"Mayordomo","year":"1994","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2026.106644_bib0012","series-title":"Proceedings of the Fifth Annual International Computing and Combinatorics Conference","first-page":"210","article-title":"Superpolynomial versus subexponential circuit size in the exponential hierarchy","author":"Miltersen","year":"1999"},{"issue":"4","key":"10.1016\/j.ipl.2026.106644_bib0013","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.jcss.2005.10.002","article-title":"Dimension, entropy rates, and compression","volume":"72","author":"Hitchcock","year":"2006","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ipl.2026.106644_bib0014","series-title":"Technical Report","article-title":"A Note on Exponential Circuit Lower Bounds from Derandomizing Arthur-Merlin Games","author":"Aaronson","year":"2010"},{"issue":"2","key":"10.1016\/j.ipl.2026.106644_bib0015","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s00037-011-0010-8","article-title":"Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds","volume":"20","author":"Aydinlioglu","year":"2011","journal-title":"Comput. Complex."},{"issue":"2","key":"10.1016\/j.ipl.2026.106644_bib0016","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","article-title":"Almost everywhere high nonuniform complexity","volume":"44","author":"Lutz","year":"1992","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.ipl.2026.106644_bib0017","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.jcss.2003.07.015","article-title":"S2p\u2286 ZPPNP","volume":"73","author":"Cai","year":"2007","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.ipl.2026.106644_bib0018","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.ipl.2005.03.009","article-title":"Reviewing bounds on the circuit size of the hardest functions","volume":"95","author":"Frandsen","year":"2005","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ipl.2026.106644_bib0019","series-title":"Proceedings of the 40th Computational Complexity Conference (CCC 2025)","first-page":"20:1","article-title":"Counting martingales for measure and dimension in complexity classes","volume":"339","author":"Hitchcock","year":"2025"},{"issue":"5","key":"10.1016\/j.ipl.2026.106644_bib0020","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1137\/S0097539700389652","article-title":"Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses","volume":"31","author":"Klivans","year":"2002","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ipl.2026.106644_bib0021","first-page":"83","article-title":"Twelve problems in resource-bounded measure","author":"Lutz","year":"2001"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019026000256?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019026000256?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:34:29Z","timestamp":1783110869000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019026000256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":21,"alternative-id":["S0020019026000256"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2026.106644","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exponential-size circuit complexity is comeager in symmetric exponential time","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2026.106644","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"106644"}}