{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:10:06Z","timestamp":1750695006221,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","funder":[{"name":"NSF (National Science Foundation)","award":["2339942"],"award-info":[{"award-number":["2339942"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718258","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"1626-1637","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Strong XOR Lemma for Information Complexity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8531-174X","authenticated-orcid":false,"given":"Pachara","family":"Sawettamalya","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1450-1896","authenticated-orcid":false,"given":"Huacheng","family":"Yu","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/J.JCSS.2003.11.006"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1806689.1806701"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.4230\/LIPIcs.CCC.2024.16"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1137\/130938517"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1007\/978-3-642-39206-1_20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/FOCS.2013.85"},{"key":"e_1_3_2_1_7_1","volume-title":"Peem Lerdputtipongporn, and Hariharan Srinivasulu.","author":"Brody Joshua","year":"2020","unstructured":"Joshua Brody, Jae Tak Kim, Peem Lerdputtipongporn, and Hariharan Srinivasulu. 2020. A Strong XOR Lemma for Randomized Query Complexity. CoRR, abs\/2007.05580 (2020), arXiv:2007.05580. arxiv:2007.05580"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/SFCS.2001.959901"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/S00037-012-0043-7"},{"doi-asserted-by":"publisher","unstructured":"Oded Goldreich Noam Nisan and Avi Wigderson. 2011. On Yao\u2019s XOR-Lemma. In Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad Mihir Bellare Zvika Brakerski Shafi Goldwasser Shai Halevi Tali Kaufman Leonid Levin Noam Nisan Dana Ron Madhu Sudan Luca Trevisan Salil Vadhan Avi Wigderson David Zuckerman Oded Goldreich (Ed.) (Lecture Notes in Computer Science Vol. 6650). Springer 273\u2013301. https:\/\/doi.org\/10.1007\/978-3-642-22670-0_23 10.1007\/978-3-642-22670-0_23","key":"e_1_3_2_1_10_1","DOI":"10.1007\/978-3-642-22670-0_23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/CCC.2007.32"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1250790.1250852"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.4230\/LIPIcs.CCC.2024.1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/SFCS.1995.492584"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/258533.258590"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.48550\/ARXIV.2407.01802"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/3618260.3649726"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/2699432"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1007\/3-540-45061-0_26"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/1806689.1806702"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/BF02579323"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1374376.1374378"},{"volume-title":"Communication Complexity: and Applications","author":"Rao Anup","unstructured":"Anup Rao and Amir Yehudayoff. 2020. Communication Complexity: and Applications. Cambridge University Press.","key":"e_1_3_2_1_23_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1137\/S0097539795280895"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/FOCS.2008.49"},{"doi-asserted-by":"crossref","unstructured":"Pachara Sawettamalya and Huacheng Yu. 2024. Strong XOR Lemma for Information Complexity. arXiv preprint arXiv:2411.13015.","key":"e_1_3_2_1_26_1","DOI":"10.1145\/3717823.3718258"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1007\/S00037-003-0175-X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/1993636.1993643"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1109\/SFCS.1982.45"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1109\/FOCS54457.2022.00114"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '25","name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","location":"Prague Czechia"},"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.3718258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:46:51Z","timestamp":1750693611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":30,"alternative-id":["10.1145\/3717823.3718258","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718258","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"}}]}}