{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:56:49Z","timestamp":1781031409801,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":100,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800793","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"788-798","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-1711","authenticated-orcid":false,"given":"Jiawei","family":"Li","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5281-8742","authenticated-orcid":false,"given":"Yuhao","family":"Li","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7632-7574","authenticated-orcid":false,"given":"Hanlin","family":"Ren","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study, Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2024.12"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00394-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"Albert Atserias Sam Buss and Moritz M\u00fcller. 2023. On the Consistency of Circuit Lower Bounds for Non-deterministic Time. In STOC. ACM 1257\u20131270. https:\/\/doi.org\/10.1145\/3564246.3585253 10.1145\/3564246.3585253","DOI":"10.1145\/3564246.3585253"},{"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.1145\/2629555"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/JCSS.1998.1575"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365714"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Paul Beame and Toniann Pitassi. 1996. Simplified and improved resolution lower bounds. In FOCS. 274\u2013282. https:\/\/doi.org\/10.1109\/SFCS.1996.548486 10.1109\/SFCS.1996.548486","DOI":"10.1109\/SFCS.1996.548486"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3060145"},{"key":"e_1_3_2_1_10_1","volume-title":"TR20-105","author":"Bell Zo\u00eb","year":"2020","unstructured":"Zo\u00eb Bell. 2020. Automating Regular or Ordered Resolution is -Hard. Electron. Colloquium Comput. Complex., TR20-105 (2020), https:\/\/eccc.weizmann.ac.il\/report\/2020\/105"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375835"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01456931"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2004.1313795"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2023.30"},{"key":"e_1_3_2_1_15_1","volume-title":"Bounded arithmetic","author":"Buss Samuel R.","unstructured":"Samuel R. Buss. 1985. Bounded arithmetic. Princeton University."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294258"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2015-06233-3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/JSL.2013.37"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-69.1.1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-16(2:12)2020"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00153-019-00681-Y"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00080"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.46298\/theoretics.24.3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Lijie Chen Jiatu Li and Igor Carboni Oliveira. 2024. On the Unprovability of Circuit Size Bounds in Intuitionistic \u00a7 ^1_2. Electron. Colloquium Comput. Complex. TR24\u2013083. https:\/\/eccc.weizmann.ac.il\/report\/2024\/083","DOI":"10.46298\/lmcs-21(3:26)2025"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00040"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00062"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48016"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","unstructured":"Matthew Clegg Jeffery Edmonds and Russell Impagliazzo. 1996. Using the Groebner basis algorithm to find proofs of unsatisfiability. In STOC. 174\u2013183. https:\/\/doi.org\/10.1145\/237814.237860 10.1145\/237814.237860","DOI":"10.1145\/237814.237860"},{"key":"e_1_3_2_1_30_1","unstructured":"Stephen A. Cook. 2007. Bounded Reverse Mathematics. Plenary lecture for CiE 2007"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.2178\/JSL\/1203350791"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511676277"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90141-J"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45220-1_14"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Susanna F. de Rezende Mika G\u00f6\u00f6s Jakob Nordstr\u00f6m Toniann Pitassi Robert Robere and Dmitry Sokolov. 2021. Automating algebraic proof systems is -hard. In STOC. ACM 209\u2013222. https:\/\/doi.org\/10.1145\/3406325.3451080 10.1145\/3406325.3451080","DOI":"10.1145\/3406325.3451080"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3532737.3532746"},{"key":"e_1_3_2_1_40_1","volume-title":"Variants of Pseudo-deterministic Algorithms and Duality in. Master\u2019s thesis","author":"Ebtehaj Mohammad Hossein","year":"1972","unstructured":"Mohammad Hossein Ebtehaj. 2023. Variants of Pseudo-deterministic Algorithms and Duality in. Master\u2019s thesis. University of Waterloo. http:\/\/hdl.handle.net\/10012\/19721"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.MFCS.2019.37"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2024.33"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JCSS.2017.12.003"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00111"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","unstructured":"Mika G\u00f6\u00f6s Sajin Koroth Ian Mertz and Toniann Pitassi. 2020. Automating cutting planes is -hard. In STOC. ACM 68\u201377. https:\/\/doi.org\/10.1145\/3357713.3384248 10.1145\/3357713.3384248","DOI":"10.1145\/3357713.3384248"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00037-007-0235-8"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","unstructured":"Rahul Ilango Jiatu Li and R. Ryan Williams. 2023. Indistinguishability Obfuscation Range Avoidance and Bounded Arithmetic. In STOC. ACM 1076\u20131089. https:\/\/doi.org\/10.1145\/3564246.3585187 10.1145\/3564246.3585187","DOI":"10.1145\/3564246.3585187"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.MFCS.2022.59"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2003.12.003"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.2178\/JSL\/1191333850"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1093\/LOGCOM\/EXM017"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.2178\/JSL\/1245158087"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_2_1_55_1","volume-title":"Some hardness escalation results in computational complexity theory. Ph. D. Dissertation","author":"Kamath Pritish","unstructured":"Pritish Kamath. 2019. Some hardness escalation results in computational complexity theory. Ph. D. Dissertation. Massachusetts Institute of Technology. https:\/\/hdl.handle.net\/1721.1\/128290"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2021.44"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.APAL.2010.12.002"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00051"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2022.37"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021906132250012X"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52753-2_40"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275541"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1080938841"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219061311000979"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-13(1:4)2017"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.2178\/JSL\/1185803628"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm170-1-8"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","unstructured":"Jan Kraj\u00ed\u010dek. 2019. Proof Complexity. Cambridge University Press. https:\/\/doi.org\/10.1017\/9781108242066 10.1017\/9781108242066","DOI":"10.1017\/9781108242066"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585144"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","unstructured":"Wolfgang Maass. 1984. Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract). In STOC. ACM 401\u2013408. https:\/\/doi.org\/10.1145\/800057.808706 10.1145\/800057.808706","DOI":"10.1145\/800057.808706"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1090\/DIMACS\/039\/12"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1006\/JCSS.2002.1830"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90200-L"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.APAL.2020.102930"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2019.102735"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"key":"e_1_3_2_1_77_1","volume-title":"Bounded reverse mathematics. Ph. D. Dissertation","author":"Nguyen Phuong","unstructured":"Phuong Nguyen. 2008. Bounded reverse mathematics. Ph. D. Dissertation. University of Toronto."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2024.22"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0022481200028061"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.APAL.2014.08.004"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00080"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","unstructured":"J\u00e1n Pich and Rahul Santhanam. 2021. Strong co-nondeterministic lower bounds for cannot be proved feasibly. In STOC. ACM 223\u2013233. https:\/\/doi.org\/10.1145\/3406325.3451117 10.1145\/3406325.3451117","DOI":"10.1145\/3406325.3451117"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","unstructured":"J\u00e1n Pich and Rahul Santhanam. 2023. Towards \u00b6 \u2260 from Extended Frege Lower Bounds. arXiv math.LO https:\/\/doi.org\/10.48550\/arXiv.2312.08163 10.48550\/arXiv.2312.08163","DOI":"10.48550\/arXiv.2312.08163"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2007.14835"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.APAL.2011.06.014"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00037-019-00182-7"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01137685"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2566-9_12"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1070\/IM1995v059n01ABEH000009"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/S000370050013"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2015.181.2.1"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","unstructured":"Rahul Santhanam and Iddo Tzameret. 2021. Iterated lower bound formulas: a diagonalization-based approach to proof complexity. In STOC. ACM 234\u2013247. https:\/\/doi.org\/10.1145\/3406325.3451010 10.1145\/3406325.3451010","DOI":"10.1145\/3406325.3451010"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00037-014-0087-Y"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFB0029954"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/pdq044"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","unstructured":"Roman Smolensky. 1987. Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In STOC. ACM 77\u201382. https:\/\/doi.org\/10.1145\/28395.28404 10.1145\/28395.28404","DOI":"10.1145\/28395.28404"},{"key":"e_1_3_2_1_98_1","volume-title":"The weak pigeonhole principle in models of bounded arithmetic. Ph. D. Dissertation","author":"Thapen Neil","unstructured":"Neil Thapen. 2002. The weak pigeonhole principle in models of bounded arithmetic. Ph. D. Dissertation. University of Oxford."},{"key":"e_1_3_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.8928"},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","unstructured":"Bernhard Von Stengel. 2023. Zero-sum games and linear programming duality. Mathematics of Operations Research https:\/\/doi.org\/10.1287\/moor.2022.0149 10.1287\/moor.2022.0149","DOI":"10.1287\/moor.2022.0149"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800793","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:57:06Z","timestamp":1781027826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":100,"alternative-id":["10.1145\/3798129.3800793","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800793","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}