{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:58:15Z","timestamp":1781078295010,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","funder":[{"name":"NSERC","award":["CGS-D-569525"],"award-info":[{"award-number":["CGS-D-569525"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718216","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:24:47Z","timestamp":1750026287000},"page":"1341-1347","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Student-Teacher Constructive Separations and (Un)Provability in Bounded Arithmetic: Witnessing the Gap"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9774-3385","authenticated-orcid":false,"given":"Stefan","family":"Grosser","sequence":"first","affiliation":[{"name":"McGill University, Montreal, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1118-1352","authenticated-orcid":false,"given":"Marco","family":"Carmosino","sequence":"additional","affiliation":[{"name":"IBM Research, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2004.160.781"},{"key":"e_1_3_2_1_2_1","volume-title":"Bounded arithmetic and constant depth Frege proofs. Complexity of computations and proofs, 13","author":"Buss Samuel R","year":"2004","unstructured":"Samuel R Buss. 2004. Bounded arithmetic and constant depth Frege proofs. Complexity of computations and proofs, 13 (2004), 153\u2013174."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00080"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2025.30"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649624"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00069"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00040"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00009"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00062"},{"key":"e_1_3_2_1_10_1","volume-title":"Logical foundations of proof complexity. 11","author":"Cook Stephen","unstructured":"Stephen Cook and Phuong Nguyen. 2010. Logical foundations of proof complexity. 11, Cambridge University Press Cambridge."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803756"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803756"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2178\/JSL"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2016.19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2178\/JSL"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2178\/JSL"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585187"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.APAL.2003.12.003"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/JCSS.2001.1763"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00051"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3446207"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/BSL.2023.40"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01625836"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649615"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808706"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.APAL.2019.102735"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188910"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/2269958"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.APAL.2014.08.004"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00067"},{"key":"e_1_3_2_1_31_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_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559903"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","location":"Prague Czechia","acronym":"STOC '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:44:07Z","timestamp":1750693447000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":32,"alternative-id":["10.1145\/3717823.3718216","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718216","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}