{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:13:22Z","timestamp":1781259202080,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":80,"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":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2047933"],"award-info":[{"award-number":["2047933"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2211971"],"award-info":[{"award-number":["2211971"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}],"id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SEAS Innovations Award","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]},{"name":"Renaissance Philanthropy AI for Math Award","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800903","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1984-1994","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Mixture Models via Efficient High-Dimensional Sparse Fourier Transforms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1479-5268","authenticated-orcid":false,"given":"Alkis","family":"Kalavasis","sequence":"first","affiliation":[{"name":"Yale University, New Haven, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8689-6770","authenticated-orcid":false,"given":"Pravesh K.","family":"Kothari","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6653-7889","authenticated-orcid":false,"given":"Shuchen","family":"Li","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4967-5927","authenticated-orcid":false,"given":"Manolis","family":"Zampetakis","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, 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.1007\/11503415_31"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/3214842"},{"key":"e_1_3_2_1_3_1","volume-title":"Conference on Learning Theory. PMLR, 1135-1164","author":"Anderson Joseph","year":"2014","unstructured":"Joseph Anderson, Mikhail Belkin, Navin Goyal, Luis Rademacher, and James Voss. 2014. The more, the merrier: the blessing of dimensionality for learning large Gaussian mixtures. In Conference on Learning Theory. PMLR, 1135-1164."},{"key":"e_1_3_2_1_4_1","volume-title":"Dimension reduction via sum-of-squares and improved clustering algorithms for non-spherical mixtures. arXiv preprint arXiv:2411.12438","author":"Anderson Prashanti","year":"2024","unstructured":"Prashanti Anderson, Mitali Bafna, Rares-Darius Buhai, Pravesh K. Kothari, and David Steurer. 2024. Dimension reduction via sum-of-squares and improved clustering algorithms for non-spherical mixtures. arXiv preprint arXiv:2411.12438 (2024)."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","author":"Bakshi Ainesh","year":"2022","unstructured":"Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, and Santosh S. Vempala. 2022. Robustly learning mixtures of \ud835\udc58 arbitrary Gaussians. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Rome, Italy) (STOC 2022). Association for Computing Machinery, New York, NY, USA, 1234--1247."},{"key":"e_1_3_2_1_6_1","volume-title":"Outlier-robust clustering of nonspherical mixtures. arXiv preprint arXiv:2005.02970","author":"Bakshi Ainesh","year":"2020","unstructured":"Ainesh Bakshi and Pravesh Kothari. 2020. Outlier-robust clustering of nonspherical mixtures. arXiv preprint arXiv:2005.02970 (2020)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.16"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591881"},{"key":"e_1_3_2_1_9_1","volume-title":"Conference on Learning Theory. PMLR, 742-778","author":"Bhaskara Aditya","year":"2014","unstructured":"Aditya Bhaskara, Moses Charikar, and Aravindan Vijayaraghavan. 2014. Uniqueness of tensor decompositions with applications to polynomial identifiability. In Conference on Learning Theory. PMLR, 742-778."},{"key":"e_1_3_2_1_10_1","volume-title":"2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 551-560","author":"Spencer","unstructured":"Spencer C. Brubaker and Santosh S. Vempala. 2008. Isotropic PCA and affineinvariant clustering. In 2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 551-560."},{"key":"e_1_3_2_1_11_1","volume-title":"Continuous LWE. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. 694-707","author":"Bruna Joan","year":"2021","unstructured":"Joan Bruna, Oded Regev, Min Jae Song, and Yi Tang. 2021. Continuous LWE. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. 694-707."},{"key":"e_1_3_2_1_12_1","volume-title":"The Thirty Sixth Annual Conference on Learning Theory. PMLR, 548-611","author":"Buhai Rares-Darius","year":"2023","unstructured":"Rares-Darius Buhai and David Steurer. 2023. Beyond parallel pancakes: quasipolynomial time guarantees for non-spherical Gaussian mixtures. In The Thirty Sixth Annual Conference on Learning Theory. PMLR, 548-611."},{"key":"e_1_3_2_1_13_1","volume-title":"Towards a mathematical theory of super-resolution. Communications on pure and applied Mathematics 67, 6","author":"Cand\u00e8s Emmanuel J","year":"2014","unstructured":"Emmanuel J Cand\u00e8s and Carlos Fernandez-Granda. 2014. Towards a mathematical theory of super-resolution. Communications on pure and applied Mathematics 67, 6 (2014), 906-956."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1956"},{"key":"e_1_3_2_1_15_1","volume-title":"Learning mixtures of spherical gaussians via fourier analysis. arXiv preprint arXiv:2004.05813","author":"Chakraborty Somnath","year":"2020","unstructured":"Somnath Chakraborty and Hariharan Narayanan. 2020. Learning mixtures of spherical gaussians via fourier analysis. arXiv preprint arXiv:2004.05813 (2020)."},{"key":"e_1_3_2_1_16_1","volume-title":"Learning general Gaussian mixtures with efficient score matching. arXiv preprint 2404.18893","author":"Chen Sitan","year":"2024","unstructured":"Sitan Chen, Vasilis Kontonis, and Kulin Shah. 2024. Learning general Gaussian mixtures with efficient score matching. arXiv preprint 2404.18893 (2024)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384333"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451078"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.84"},{"key":"e_1_3_2_1_20_1","volume-title":"DDPM Score Matching and Distribution Learning. arXiv preprint arXiv:2504.05161","author":"Chewi Sinho","year":"2025","unstructured":"Sinho Chewi, Alkis Kalavasis, Anay Mehrotra, and Omar Montasser. 2025. DDPM Score Matching and Distribution Learning. arXiv preprint arXiv:2504.05161 (2025)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634112"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649754"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"e_1_3_2_1_24_1","volume-title":"Robustly learning any clusterable mixture of Gaussians. arXiv preprint arXiv:2005.06417","author":"Diakonikolas Ilias","year":"2020","unstructured":"Ilias Diakonikolas, Samuel B. Hopkins, Daniel M. Kane, and Sushrut Karmalkar. 2020. Robustly learning any clusterable mixture of Gaussians. arXiv preprint arXiv:2005.06417 (2020)."},{"key":"e_1_3_2_1_25_1","volume-title":"Sos certifiability of subgaussian distributions and its algorithmic applications. arXiv preprint arXiv:2410.21194","author":"Diakonikolas Ilias","year":"2024","unstructured":"Ilias Diakonikolas, Samuel B Hopkins, Ankit Pensia, and Stefan Tiegel. 2024. Sos certifiability of subgaussian distributions and its algorithmic applications. arXiv preprint arXiv:2410.21194 (2024)."},{"key":"e_1_3_2_1_26_1","volume-title":"Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination. arXiv preprint arXiv:2502.14772","author":"Diakonikolas Ilias","year":"2025","unstructured":"Ilias Diakonikolas, Giannis Iakovidis, Daniel M Kane, and Thanasis Pittas. 2025. Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination. arXiv preprint arXiv:2502.14772 (2025)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1126680"},{"key":"e_1_3_2_1_28_1","volume-title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 184-195","author":"Diakonikolas Ilias","unstructured":"Ilias Diakonikolas and Daniel M. Kane. 2020. Small covers for near-zero sets of polynomials and learning latent variable models. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 184-195."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108943161"},{"key":"e_1_3_2_1_30_1","volume-title":"Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models. arXiv preprint arXiv:2411.15669","author":"Diakonikolas Ilias","year":"2024","unstructured":"Ilias Diakonikolas and Daniel M Kane. 2024. Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models. arXiv preprint arXiv:2411.15669 (2024)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.9"},{"key":"e_1_3_2_1_32_1","volume-title":"Entangled Mean Estimation in High-Dimensions. arXiv preprint arXiv:2501.05425","author":"Diakonikolas Ilias","year":"2025","unstructured":"Ilias Diakonikolas, Daniel M Kane, Sihan Liu, and Thanasis Pittas. 2025. Entangled Mean Estimation in High-Dimensions. arXiv preprint arXiv:2501.05425 (2025)."},{"key":"e_1_3_2_1_33_1","unstructured":"Ilias Diakonikolas Daniel M. Kane and Alistair Stewart. 2016. Efficient Robust Proper Learning of Log-concave Distributions. arXiv:1606.03077 [cs.DS]"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897552"},{"key":"e_1_3_2_1_35_1","volume-title":"Conference on Learning Theory. PMLR, 850-878","author":"Diakonikolas Ilias","year":"2016","unstructured":"Ilias Diakonikolas, Daniel M Kane, and Alistair Stewart. 2016. Properly learning poisson binomial distributions in almost polynomial time. In Conference on Learning Theory. PMLR, 850-878."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.16"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188758"},{"key":"e_1_3_2_1_38_1","volume-title":"Woodruff","author":"Diakonikolas Ilias","year":"2019","unstructured":"Ilias Diakonikolas, Santosh Vempala, and David P. Woodruff. 2019. Research Vignette: Foundations of Data Science. https:\/\/simons.berkeley.edu\/news\/researchvignette-foundations-data-science"},{"key":"e_1_3_2_1_39_1","volume-title":"Robust Mixture Learning when Outliers Overwhelm Small Groups. arXiv preprint arXiv:2407.15792","author":"Dmitriev Daniil","year":"2024","unstructured":"Daniil Dmitriev, Rares-Darius Buhai, Stefan Tiegel, Alexander Wolters, Gleb Novikov, Amartya Sanyal, David Steurer, and Fanny Yang. 2024. Robust Mixture Learning when Outliers Overwhelm Small Groups. arXiv preprint arXiv:2407.15792 (2024)."},{"key":"e_1_3_2_1_40_1","series-title":"SIAM journal on mathematical analysis 23, 5","volume-title":"Superresolution via sparsity constraints","author":"Donoho David L","year":"1992","unstructured":"David L Donoho. 1992. Superresolution via sparsity constraints. SIAM journal on mathematical analysis 23, 5 (1992), 1309-1331."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214504000000089"},{"key":"e_1_3_2_1_42_1","volume-title":"International Conference on Computational Learning Theory. Springer, 20-34","author":"Feldman Jon","year":"2006","unstructured":"Jon Feldman, Rocco A. Servedio, and Ryan O'Donnell. 2006. PAC learning axisaligned mixtures of Gaussians with no separation assumption. In International Conference on Computational Learning Theory. Springer, 20-34."},{"key":"e_1_3_2_1_43_1","volume-title":"Learning mixtures of gaussians using diffusion models. arXiv preprint arXiv:2404.18869","author":"Gatmiry Khashayar","year":"2024","unstructured":"Khashayar Gatmiry, Jonathan Kelner, and Holden Lee. 2024. Learning mixtures of gaussians using diffusion models. arXiv preprint arXiv:2404.18869 (2024)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746616"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00112"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746579"},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. 1021-1034","author":"Samuel","unstructured":"Samuel B. Hopkins and Jerry Li. 2018. Mixture models, robustness, and sum of squares proofs. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. 1021-1034."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422439"},{"key":"e_1_3_2_1_49_1","volume-title":"Super-resolution off the grid. Advances in Neural Information Processing Systems 28","author":"Huang Qingqing","year":"2015","unstructured":"Qingqing Huang and Sham M Kakade. 2015. Super-resolution off the grid. Advances in Neural Information Processing Systems 28 (2015)."},{"key":"e_1_3_2_1_50_1","volume-title":"Robust statistics","author":"Huber Peter J","unstructured":"Peter J Huber and Elvezio M Ronchetti. 2011. Robust statistics. John Wiley & Sons."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch176"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806765"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Alkis Kalavasis Pravesh K. Kothari Shuchen Li and Manolis Zampetakis. 2026. Learning Mixture Models via Efficient High-dimensional Sparse Fourier Transforms. arXiv:2601.05157 [cs.DS] https:\/\/arxiv.org\/abs\/2601.05157","DOI":"10.1145\/3798129.3800903"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.76"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_30"},{"key":"e_1_3_2_1_56_1","volume-title":"Kothari","author":"Karmalkar Sushrut","year":"2019","unstructured":"Sushrut Karmalkar, Adam R. Klivans, and Pravesh K. Kothari. 2019. List- Decodable Linear Regression. http:\/\/arxiv.org\/abs\/1905.05679 arXiv:1905.05679 [cs, stat]."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3529457"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1711.07465"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188970"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1711.11581"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.76"},{"key":"e_1_3_2_1_62_1","volume-title":"Conference on Learning Theory. PMLR, 1302-1382","author":"Li Jerry","year":"2017","unstructured":"Jerry Li and Ludwig Schmidt. 2017. Robust and proper learning for mixtures of Gaussians via systems of polynomial inequalities. In Conference on Learning Theory. PMLR, 1302-1382."},{"key":"e_1_3_2_1_63_1","volume-title":"Robust Mean Estimation Against Oblivious Adversaries. Master's thesis","author":"Shuchen Li.","unstructured":"Shuchen Li. 2023. Robust Mean Estimation Against Oblivious Adversaries. Master's thesis. Carnegie Mellon University."},{"key":"e_1_3_2_1_64_1","volume-title":"Conference on Learning Theory. PMLR, 2712-2737","author":"Liang Yingyu","year":"2020","unstructured":"Yingyu Liang and Hui Yuan. 2020. Learning entangled single-sample Gaussians in the subset-of-signals model. In Conference on Learning Theory. PMLR, 2712-2737."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1214\/cbms\/1462106013"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520012"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451084"},{"key":"e_1_3_2_1_68_1","volume-title":"Conference on Learning Theory. PMLR, 2815-2895","author":"Liu Allen","year":"2022","unstructured":"Allen Liu and Ankur Moitra. 2022. Learning GMMs with nearly optimal robustness guarantees. In Conference on Learning Theory. PMLR, 2815-2895."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iax001"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"crossref","unstructured":"Ankur Moitra. 2015. Super-resolution Extremal Functions and the Condition Number of Vandermonde Matrices. http:\/\/arxiv.org\/abs\/1408.1681 arXiv:1408.1681 [cs math stat].","DOI":"10.1145\/2746539.2746561"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.15"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1894.0003"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.42"},{"key":"e_1_3_2_1_74_1","first-page":"20850","article-title":"A fourier approach to mixture learning","volume":"35","author":"Qiao Mingda","year":"2022","unstructured":"Mingda Qiao, Guru Guruganesh, Ankit Rawat, Kumar Avinava Dubey, and Manzil Zaheer. 2022. A fourier approach to mixture learning. Advances in Neural Information Processing Systems 35 (2022), 20850-20861.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_75_1","unstructured":"Prasad Raghavendra and Morris Yau. 2019. List Decodable Learning via Sum of Squares. http:\/\/arxiv.org\/abs\/1905.04660 arXiv:1905.04660 [cs]."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1137\/1026034"},{"key":"e_1_3_2_1_77_1","unstructured":"Oded Regev and Aravindan Vijayaraghavan. 2017. On Learning Mixtures of Well-Separated Gaussians. http:\/\/arxiv.org\/abs\/1710.11592 arXiv:1710.11592 [cs]."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00087"},{"key":"e_1_3_2_1_79_1","volume-title":"Makov","author":"Titterington D. Michael","year":"1985","unstructured":"D. Michael Titterington, Adrian F. M. Smith, and Udi E. Makov. 1985. Statistical analysis of finite mixture distributions. John Wiley & Sons, Ltd., Chichester. x+243 pages."},{"key":"e_1_3_2_1_80_1","volume-title":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. IEEE, 113-122","author":"Santosh","unstructured":"Santosh S. Vempala and Grant Wang. 2002. A spectral algorithm for learning mixtures of distributions. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. IEEE, 113-122."}],"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.3800903","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:27:00Z","timestamp":1781216820000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":80,"alternative-id":["10.1145\/3798129.3800903","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800903","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"}}]}}