{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T23:04:19Z","timestamp":1762211059287,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649769","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1405-1414","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Black-Box PPP Is Not Turing-Closed"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8636-1290","authenticated-orcid":false,"given":"Noah","family":"Fleming","sequence":"first","affiliation":[{"name":"Memorial University of Newfoundland, St. John's, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9774-3385","authenticated-orcid":false,"given":"Stefan","family":"Grosser","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8668-2174","authenticated-orcid":false,"given":"Toniann","family":"Pitassi","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6065-6023","authenticated-orcid":false,"given":"Robert","family":"Robere","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Miklos Ajtai. 1988. The complexity of the pigeonhole principle. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. 346\u2013355. https:\/\/doi.org\/10.1109\/SFCS.1988.21951 10.1109\/SFCS.1988.21951","key":"e_1_3_2_1_1_1","DOI":"10.1109\/SFCS.1988.21951"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/237814.237838"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/FOCS.2004.20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1016\/J.IPL.2018.12.009"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1006\/jcss.1998.1575"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/SFCS.1994.365714"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/129712.129733"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1090\/S0002-9947-1914-1500976-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.4230\/LIPICS.ITCS.2023.22"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/CCC.2004.1313795"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.4230\/LIPICS.ITCS.2023.30"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1112\/plms\/s3-69.1.1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1016\/j.apal.2012.01.015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/FOCS.2013.45"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1516512.1516516"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1142\/9789813272880_0009"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1137\/070699652"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.4230\/LIPICS.CCC.2023.36"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1112\/jlms\/s1-35.1.85"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1561\/0400000086"},{"volume-title":"Expansion Fools the Sherali-Adams System: Compromising Local and Global Arguments","author":"Georgiou Konstantinos","unstructured":"Konstantinos Georgiou and Avner Magen. 2008. Expansion Fools the Sherali-Adams System: Compromising Local and Global Arguments. University of Toronto.","key":"e_1_3_2_1_21_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.4230\/LIPICS.CCC.2021.36"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/FOCS54457.2022.00111"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.4230\/LIPIcs.ITCS.2019.38"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1016\/0304-3975(85)90144-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.4230\/LIPICS.MFCS.2021.60"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/3406325.3451093"},{"unstructured":"Siddhartha Jain Jiawei Li Robert Robere and Zhiyang Xun. 2023. Pigeonhole Principle and Ramsey in TFNP. Manuscript in preparation.","key":"e_1_3_2_1_28_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1016\/J.JCSS.2015.08.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1016\/0022-0000(88)90046-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3341106"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/3055399.3055438"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/2746539.2746599"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1016\/0304-3975(91)90200-L"},{"volume-title":"Classification of search problems and their definability in bounded arithmetic. Master\u2019s thesis","author":"Morioka Tsuyoshi","unstructured":"Tsuyoshi Morioka. 2001. Classification of search problems and their definability in bounded arithmetic. Master\u2019s thesis. University of Toronto. https:\/\/www.collectionscanada.ca\/obj\/s4\/f2\/dsk3\/ftp04\/MQ58775.pdf","key":"e_1_3_2_1_35_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1016\/s0022-0000(05)80063-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.4230\/LIPICS.ITCS.2023.88"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1007\/s00153-015-0439-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1007\/S000370050013"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1007\/3-540-46011-X_8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/1060590.1060603"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1109\/FOCS.2018.00023"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '24","name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649769","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":42,"alternative-id":["10.1145\/3618260.3649769","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649769","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}