{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:39:43Z","timestamp":1787495983430,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["615075"],"award-info":[{"award-number":["615075"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451010","type":"proceedings-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T21:26:13Z","timestamp":1623792373000},"page":"234-247","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Iterated lower bound formulas: a diagonalization-based approach to proof complexity"],"prefix":"10.1145","author":[{"given":"Rahul","family":"Santhanam","sequence":"first","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5558-9911","authenticated-orcid":false,"given":"Iddo","family":"Tzameret","sequence":"additional","affiliation":[{"name":"Imperial College London, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21951"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701389944"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384245"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409472"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2016.32"},{"key":"e_1_3_2_1_8_1","unstructured":"Harvey Friedman. 1979. On the consistency completeness and correctness problems. Unpublished."},{"key":"e_1_3_2_1_9_1","first-page":"13","volume-title":"Resolution Lower Bounds for Refutation Statements. In 44th Int. Symp. Math. Found. CS MFCS","author":"Garl\u00edk Michal","year":"2019","unstructured":"Michal Garl\u00edk. 2019. Resolution Lower Bounds for Refutation Statements. In 44th Int. Symp. Math. Found. CS MFCS 2019. LIPIcs. 138, Pages 37:1\u201337:13."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2019.38"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230742"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275541"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2687774"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm182-2-7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1080938841"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1082418532"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070103"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1107632"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00080"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200117"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2984450.2984455"},{"key":"e_1_3_2_1_23_1","first-page":"1986","article-title":"On the length of proofs of finitistic consistency statements in first order theories","volume":"120","author":"Pudlak Pavel","year":"1986","unstructured":"Pavel Pudlak. 1986. On the length of proofs of finitistic consistency statements in first order theories. Studies in Logic and the Foundations of Mathematics, 120, 1986. Pages 165\u2013196.","journal-title":"Studies in Logic and the Foundations of Mathematics"},{"key":"e_1_3_2_1_24_1","first-page":"1987","article-title":"Improved bounds to the length of proofs of finite consistency statements","volume":"65","author":"Pudlak Pavel","year":"1987","unstructured":"Pavel Pudlak. 1987. Improved bounds to the length of proofs of finite consistency statements. Contemp. Math., 65, 1987. Pages 309\u2013331.","journal-title":"Contemp. Math."},{"key":"e_1_3_2_1_25_1","volume-title":"ArXiV","author":"Pudlak Pavel","year":"2020","unstructured":"Pavel Pudlak. 2020. Reflection principles, propositional proof systems, and theories. ArXiV, July, 2020."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2010.v006a007"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2015.181.2.1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1494"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63248-4_8"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-95-08105-8"},{"key":"e_1_3_2_1_32_1","first-page":"1973","article-title":"Vermeidung von Divisionen","volume":"264","author":"Strassen Volker","year":"1973","unstructured":"Volker Strassen. 1973. Vermeidung von Divisionen. J. Reine Angew. Math., 264, 1973. Pages 182\u2013202.","journal-title":"J. Reine Angew. Math."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_3_2_1_35_1","first-page":"380","volume-title":"Logic and Algorithmic: International Symposium in honour of Ernst Specker, 30","author":"Valiant Leslie G.","year":"1982","unstructured":"Leslie G. Valiant. 1982. Reducibility by algebraic projections. Logic and Algorithmic: International Symposium in honour of Ernst Specker, 30, 1982. Pages 365\u2013380."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451010","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:01:44Z","timestamp":1750183304000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":35,"alternative-id":["10.1145\/3406325.3451010","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451010","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}