{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T15:48:33Z","timestamp":1782056913691,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":35,"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\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2106429"],"award-info":[{"award-number":["2106429"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2107187"],"award-info":[{"award-number":["2107187"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800775","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"584-594","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Boolean Function Monotonicity Testing Requires (Almost)\n                    <i>\n                      n\n                      <sup>1\/2<\/sup>\n                    <\/i>\n                    Queries"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1378-5504","authenticated-orcid":false,"given":"Mark","family":"Chen","sequence":"first","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5661-515X","authenticated-orcid":false,"given":"Xi","family":"Chen","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8712-0017","authenticated-orcid":false,"given":"Hao","family":"Cui","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2242-1078","authenticated-orcid":false,"given":"William","family":"Pires","sequence":"additional","affiliation":[{"name":"Columbia University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6742-881X","authenticated-orcid":false,"given":"Jonah","family":"Stockwell","sequence":"additional","affiliation":[{"name":"Columbia University, New York, 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.1016\/j.ic.2006.06.001"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897567"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing. 164-173","author":"Berman Piotr","year":"2014","unstructured":"Piotr Berman, Sofya Raskhodnikova, and Grigory Yaroslavtsev. 2014. \ud835\udc3f \ud835\udc5d -testing. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing. 164-173."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/100808186"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-8622-1"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2133-2151","author":"Black Hadley","year":"2018","unstructured":"Hadley Black, Deeparnab Chakrabarty, and Comandur Seshadhri. 2018. A \ud835\udc5c (\ud835\udc51 ) \u2022 polylog(\ud835\udc5b) monotonicity tester for boolean functions over the hypergrid [\ud835\udc5b] \ud835\udc51 . In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2133-2151."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.122"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585167"},{"key":"e_1_3_2_1_9_1","volume-title":"FOCS23-147","author":"Black Hadley","year":"2025","unstructured":"Hadley Black, Deeparnab Chakrabarty, and C Seshadhri. 2025. A \ud835\udc51 1\/2+\ud835\udc5c (1) monotonicity tester for Boolean functions on \ud835\udc51-dimensional hypergrids. SIAM J. Comput. 0 (2025), FOCS23-147."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21211"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2014.38"},{"key":"e_1_3_2_1_12_1","volume-title":"Improved monotonicity testers via hypercube embeddings. arXiv preprint arXiv:2211.09229","author":"Braverman Mark","year":"2022","unstructured":"Mark Braverman, Subhash Khot, Guy Kindler, and Dor Minzer. 2022. Improved monotonicity testers via hypercube embeddings. arXiv preprint arXiv:2211.09229 (2022)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-018-0168-4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488660"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488661"},{"key":"e_1_3_2_1_16_1","unstructured":"Deeparnab Chakrabarty and C. Seshadhri. 2016. A \ud835\udc42 (\ud835\udc5b) Non-Adaptive Tester for Unateness. CoRR abs\/1608.06980 (2016). arXiv:1608.06980 http:\/\/arxiv.org\/ abs\/1608.06980"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of Innovations in Theoretical Computer Science (ITCS).","author":"Chakrabarty Deeparnab","unstructured":"Deeparnab Chakrabarty and C. Seshadhri. 2019. Adaptive Boolean Monotonicity Testing in Total Influence Time. In Proceedings of Innovations in Theoretical Computer Science (ITCS)."},{"key":"e_1_3_2_1_18_1","unstructured":"Mark Chen Xi Chen Hao Cui William Pires and Jonah Stockwell. 2025. Boolean function monotonicity testing requires (almost) \ud835\udc5b 1\/2 queries. arXiv:2511.04558 [cs.CC] https:\/\/arxiv.org\/abs\/2511.04558"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.11"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746570"},{"key":"e_1_3_2_1_21_1","unstructured":"Xi Chen Diptaksho Palit Kabir Peshawaria William Pires Rocco A. Servedio and Yiding Zhang. 2025. Relative-error unateness testing. arXiv:2510.21589 [cs.CC] https:\/\/arxiv.org\/abs\/2510.21589"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.38"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316351"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055461"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1798596.1798605"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509977"},{"key":"e_1_3_2_1_27_1","volume-title":"Introduction to Property Testing","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2017. Introduction to Property Testing. Cambridge University Press."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743493"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/050645804"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1387068.1387072"},{"key":"e_1_3_2_1_31_1","volume-title":"Downsampling for testing and learning in product distributions. arXiv preprint arXiv:2007.07449","author":"Harms Nathaniel","year":"2020","unstructured":"Nathaniel Harms and Yuichi Yoshida. 2020. Downsampling for testing and learning in product distributions. arXiv preprint arXiv:2007.07449 (2020)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1065872"},{"key":"e_1_3_2_1_33_1","volume-title":"A Distance Amplification Lemma for Monotonicity. arXiv preprint arXiv:2512.13566","author":"Minzer Dor","year":"2025","unstructured":"Dor Minzer. 2025. A Distance Amplification Lemma for Monotonicity. arXiv preprint arXiv:2512.13566 (2025)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347187"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01844850"}],"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.3800775","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T15:28:45Z","timestamp":1782055725000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":35,"alternative-id":["10.1145\/3798129.3800775","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800775","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"}}]}}