{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:01:54Z","timestamp":1773187314783,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451090","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1711-1724","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Sparse nonnegative convolution is equivalent to dense nonnegative convolution"],"prefix":"10.1145","author":[{"given":"Karl","family":"Bringmann","sequence":"first","affiliation":[{"name":"Saarland University, Germany \/ MPI-INF, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Fischer","sequence":"additional","affiliation":[{"name":"Saarland University, Germany \/ MPI-INF, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasileios","family":"Nakos","sequence":"additional","affiliation":[{"name":"Saarland University, Germany \/ MPI-INF, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Gaussian smoothing. https:\/\/homepages.inf.ed.ac.uk\/rbf\/HIPR2\/gsmooth.htm."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216067"},{"key":"e_1_3_2_1_3_1","first-page":"12","volume-title":"Proceedings of the 46th International Colloquium Automata, Languages, and Programming, ICALP '19","author":"Afshani Peyman","unstructured":"Peyman Afshani, Casper B. Freksen, Lior Kamma, and Kasper G. Larsen. Lower bounds for multiplication via network coding. In Proceedings of the 46th International Colloquium Automata, Languages, and Programming, ICALP '19, pages 10:1\u201310:12. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 2019."},{"key":"e_1_3_2_1_4_1","first-page":"372","article-title":"On the relationship between histogram indexing and block-mass indexing. Philosophical Transactions of the Royal Society A: Mathematical","author":"Amir Amihood","year":"2014","unstructured":"Amihood Amir, Ayelet Butman, and Ely Porat. On the relationship between histogram indexing and block-mass indexing. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 372, 2014.","journal-title":"Physical and Engineering Sciences"},{"key":"e_1_3_2_1_5_1","first-page":"194","volume-title":"Proceedings of the 18th Symposium on Combinatorial Pattern Matching, CPM '07","author":"Amir Amihood","unstructured":"Amihood Amir, Oren Kapah, and Ely Porat. Deterministic length reduction: Fast convolution in sparse data and applications. In Proceedings of the 18th Symposium on Combinatorial Pattern Matching, CPM '07, pages 183\u2013194. Springer, 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00097-X"},{"key":"e_1_3_2_1_7_1","first-page":"36","volume-title":"Proceedings of the 40th International Symposium on Symbolic and Algebraic Computation, ISSAC '15","author":"Arnold Andrew","unstructured":"Andrew Arnold and Daniel S. Roche. Output-sensitive algorithms for sumset and sparse polynomial multiplication. In Proceedings of the 40th International Symposium on Symbolic and Algebraic Computation, ISSAC '15, pages 29\u201336. ACM, 2015."},{"key":"e_1_3_2_1_8_1","first-page":"1282","volume-title":"Proceedings of the 50th ACM Symposium on Theory of Computing, STOC '18","author":"Bateni MohammadHossein","unstructured":"MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, and Cliff Stein. Fast algorithms for knapsack via convolution and prediction. In Proceedings of the 50th ACM Symposium on Theory of Computing, STOC '18, pages 1269\u20131282. ACM, 2018."},{"key":"e_1_3_2_1_9_1","first-page":"309","volume-title":"Proceedings of the 20th ACM Symposium on Theory of Computing, STOC '88","author":"Ben-Or Michael","unstructured":"Michael Ben-Or and Prasoon Tiwari. A deterministic algorithm for sparse multivariate polynomial interpolation. In Proceedings of the 20th ACM Symposium on Theory of Computing, STOC '88, pages 301\u2013309. ACM, 1988."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAU.1970.1162132"},{"key":"e_1_3_2_1_11_1","first-page":"1084","volume-title":"Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms, SODA '17","author":"Bringmann Karl","unstructured":"Karl Bringmann. A near-linear pseudopolynomial time algorithm for subset sum. In Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms, SODA '17, pages 1073\u20131084. SIAM, 2017."},{"key":"e_1_3_2_1_12_1","first-page":"995","volume-title":"Proceedings of the 52nd ACM Symposium on Theory of Computing, STOC '20","author":"Bringmann Karl","unstructured":"Karl Bringmann and Vasileios Nakos. Top-$k$-convolution and the quest for near-linear output-sensitive subset sum. In Proceedings of the 52nd ACM Symposium on Theory of Computing, STOC '20, pages 982\u2013995. ACM, 2020."},{"key":"e_1_3_2_1_13_1","first-page":"165","volume-title":"Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS '98","author":"David","unstructured":"David E. Cardoze and Leonard J. Schulman. Pattern matching for spatial point sets. In Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS '98, pages 156\u2013165. IEEE Computer Society, 1998."},{"key":"e_1_3_2_1_14_1","first-page":"7","volume-title":"Proceedings of the 3rd Symposium on Simplicity in Algorithms, SOSA '20","author":"Timothy","unstructured":"Timothy M. Chan and Qizheng He. Reducing 3SUM to convolution-3SUM. In Proceedings of the 3rd Symposium on Simplicity in Algorithms, SOSA '20, pages 1\u20137. SIAM, 2020."},{"key":"e_1_3_2_1_15_1","first-page":"40","volume-title":"Proceedings of the 47th ACM Symposium on Theory of Computing, STOC '15","author":"Timothy","unstructured":"Timothy M. Chan and Moshe Lewenstein. Clustered integer 3SUM via additive combinatorics. In Proceedings of the 47th ACM Symposium on Theory of Computing, STOC '15, pages 31\u201340. ACM, 2015."},{"key":"e_1_3_2_1_16_1","first-page":"601","volume-title":"Proceedings of the 34th ACM Symposium on Theory of Computing, STOC '02","author":"Cole Richard","unstructured":"Richard Cole and Ramesh Hariharan. Verifying candidate matches in sparse and wildcard matching. In Proceedings of the 34th ACM Symposium on Theory of Computing, STOC '02, pages 592\u2013601. ACM, 2002."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0914081"},{"key":"e_1_3_2_1_18_1","first-page":"113","article-title":"String matching and other products","volume":"7","author":"Fischer Michael J.","year":"1974","unstructured":"Michael J. Fischer and Michael S. Paterson. String matching and other products. Complexity of Computation, 7:113\u2013125, 1974.","journal-title":"Complexity of Computation"},{"key":"e_1_3_2_1_19_1","first-page":"161","volume-title":"Proceedings of the 34th ACM Symposium on Theory of Computing, STOC '02","author":"Gilbert Anna C.","unstructured":"Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, and Martin J. Strauss. Near-optimal sparse Fourier representations via sampling. In Proceedings of the 34th ACM Symposium on Theory of Computing, STOC '02, pages 152\u2013161. ACM, 2002."},{"key":"e_1_3_2_1_20_1","first-page":"484","volume-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC '10","author":"Gilbert Anna C.","unstructured":"Anna C. Gilbert, Yi Li, Ely Porat, and Martin J. Strauss. Approximate sparse recovery: Optimizing time and measurements. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC '10, pages 475\u2013484. ACM, 2010."},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of SPIE \u2013 The International Society for Optical Engineering","author":"Gilbert Anna C.","year":"2005","unstructured":"Anna C. Gilbert, S. Muthukrishnan, and Martin J. Strauss. Improved time bounds for near-optimal space Fourier representations. Proceedings of SPIE \u2013 The International Society for Optical Engineering, 2005."},{"key":"e_1_3_2_1_22_1","first-page":"472","volume-title":"Proceedings of the 40th International Colloquium Automata, Languages, and Programming, ICALP '13","author":"Gilbert Anna C.","unstructured":"Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, and Martin J. Strauss. $L_2\/L_2$-foreach sparse recovery with low risk. In Proceedings of the 40th International Colloquium Automata, Languages, and Programming, ICALP '13, pages 461\u2013472. Springer, 2013."},{"key":"e_1_3_2_1_23_1","first-page":"209","volume-title":"Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, ISSAC '20","author":"Giorgi Pascal","unstructured":"Pascal Giorgi, Bruno Grenet, and Armelle Perret du Cray. Essentially optimal sparse polynomial multiplication. In Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, ISSAC '20, pages 202\u2013209. ACM, 2020."},{"key":"e_1_3_2_1_24_1","volume-title":"Krieger","author":"Gold Bernard","year":"1969","unstructured":"Bernard Gold and Charles M. Rader. Digital processing of signals. Krieger, 1969."},{"key":"e_1_3_2_1_25_1","first-page":"578","volume-title":"Proceedings of the 44th ACM Symposium on Theory of Computing, STOC '12","author":"Hassanieh Haitham","unstructured":"Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price. Nearly optimal sparse Fourier transform. In Proceedings of the 44th ACM Symposium on Theory of Computing, STOC '12, pages 563\u2013578. ACM, 2012."},{"key":"e_1_3_2_1_26_1","volume-title":"Springer","author":"Haviv Ishay","year":"2017","unstructured":"Ishay Haviv and Oded Regev. The restricted isometry property of subsampled Fourier matrices. In Geometric aspects of functional analysis, pages 163\u2013179. Springer, 2017."},{"key":"e_1_3_2_1_27_1","first-page":"226","volume-title":"Proceedings of the 44th International Symposium on Symbolic and Algebraic Computation, ISSAC '19","author":"Huang Qiao-Long","unstructured":"Qiao-Long Huang. Sparse polynomial interpolation over fields with large or zero characteristic. In Proceedings of the 44th International Symposium on Symbolic and Algebraic Computation, ISSAC '19, pages 219\u2013226. ACM, 2019."},{"key":"e_1_3_2_1_28_1","first-page":"173","volume-title":"Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS '98","author":"Indyk Piotr","unstructured":"Piotr Indyk. Faster algorithms for string matching problems: matching the convolution bound. In Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS '98, pages 166\u2013173. IEEE Computer Society, 1998."},{"key":"e_1_3_2_1_29_1","first-page":"523","volume-title":"Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS '14","author":"Indyk Piotr","unstructured":"Piotr Indyk and Michael Kapralov. Sample-optimal Fourier sampling in any constant dimension. In Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS '14, pages 514\u2013523. IEEE Computer Society, 2014."},{"key":"e_1_3_2_1_30_1","first-page":"499","volume-title":"Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms, SODA '14","author":"Indyk Piotr","unstructured":"Piotr Indyk, Michael Kapralov, and Eric Price. (Nearly) sample-optimal sparse Fourier transform. In Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms, SODA '14, pages 480\u2013499. SIAM, 2014."},{"key":"e_1_3_2_1_31_1","first-page":"294","volume-title":"Proceedings of the 52nd IEEE Annual Symposium on Foundations of Computer Science, FOCS '11","author":"Indyk Piotr","unstructured":"Piotr Indyk, Eric Price, and David P. Woodruff. On the power of adaptivity in sparse recovery. In Proceedings of the 52nd IEEE Annual Symposium on Foundations of Computer Science, FOCS '11, pages 285\u2013294. IEEE Computer Society, 2011."},{"key":"e_1_3_2_1_32_1","first-page":"17","volume-title":"Proceedings of the 10th Innovations in Theoretical Computer Science Conference, ITCS '19","author":"Jansen Klaus","unstructured":"Klaus Jansen and Lars Rohwedder. On integer programming and convolution. In Proceedings of the 10th Innovations in Theoretical Computer Science Conference, ITCS '19, pages 43:1\u201343:17. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, 2019."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2017.11.017"},{"key":"e_1_3_2_1_34_1","first-page":"277","volume-title":"Proceedings of the 48th ACM Symposium on Theory of Computing, STOC '16","author":"Kapralov Michael","unstructured":"Michael Kapralov. Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time. In Proceedings of the 48th ACM Symposium on Theory of Computing, STOC '16, pages 264\u2013277. ACM, 2016."},{"key":"e_1_3_2_1_35_1","first-page":"662","volume-title":"Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS '17","author":"Kapralov Michael","unstructured":"Michael Kapralov. Sample efficient estimation and recovery in sparse FFT via isolation on average. In Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS '17, pages 651\u2013662. IEEE Computer Society, 2017."},{"key":"e_1_3_2_1_36_1","first-page":"2728","volume-title":"Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms, SODA '19","author":"Kapralov Michael","unstructured":"Michael Kapralov, Ameya Velingker, and Amir Zandieh. Dimension-independent sparse Fourier transform. In Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms, SODA '19, pages 2709\u20132728. SIAM, 2019."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90177-B"},{"key":"e_1_3_2_1_38_1","first-page":"352","volume-title":"Proceedings of the 57th IEEE Annual Symposium on Foundations of Computer Science, FOCS '16","author":"Knudsen Mathias B. T.","unstructured":"Mathias B. T. Knudsen. Linear hashing is awesome. In Proceedings of the 57th IEEE Annual Symposium on Foundations of Computer Science, FOCS '16, pages 345\u2013352. IEEE Computer Society, 2016."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3329863"},{"key":"e_1_3_2_1_40_1","first-page":"5","volume-title":"Proceedings of the 1st Symposium on Simplicity in Algorithms, SOSA '18","author":"Kopelowitz Tsvi","unstructured":"Tsvi Kopelowitz and Ely Porat. A simple algorithm for approximating the text-to-pattern hamming distance. In Proceedings of the 1st Symposium on Simplicity in Algorithms, SOSA '18, pages 10:1\u201310:5. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, 2018."},{"key":"e_1_3_2_1_41_1","first-page":"17","article-title":"On the arithmetic operational complexity for solving Vandermonde linear equations","author":"Li Lei","year":"2000","unstructured":"Lei Li. On the arithmetic operational complexity for solving Vandermonde linear equations. Japan Journal of Industrial and Applied Mathematics, 17, 2000.","journal-title":"Japan Journal of Industrial and Applied Mathematics"},{"key":"e_1_3_2_1_42_1","first-page":"270","volume-title":"Proceedings of the 34th International Symposium on Symbolic and Algebraic Computation, ISSAC '09","author":"Monagan Michael","unstructured":"Michael Monagan and Roman Pearce. Parallel sparse polynomial multiplication using heaps. In Proceedings of the 34th International Symposium on Symbolic and Algebraic Computation, ISSAC '09, pages 263\u2013270. ACM, 2009."},{"key":"e_1_3_2_1_43_1","first-page":"348","volume-title":"Computer Mathematics","author":"Monagan Michael","unstructured":"Michael Monagan and Roman Pearce. POLY: A new polynomial data structure for Maple 17. In Computer Mathematics, pages 325\u2013348. Springer, 2014."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2733693.2733720"},{"key":"e_1_3_2_1_45_1","first-page":"88","volume-title":"Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms, SODA '19","author":"Mucha Marcin","unstructured":"Marcin Mucha, Karol Wegrzycki, and Michal Wlodarczyk. A subquadratic approximation scheme for partition. In Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms, SODA '19, pages 70\u201388. SIAM, 2019."},{"key":"e_1_3_2_1_46_1","first-page":"317","volume-title":"Proceedings of the 6th Symposium on Combinatorial Pattern Matching, CPM '95","author":"Muthukrishnan Shanmugavelayutham","unstructured":"Shanmugavelayutham Muthukrishnan. New results and open problems related to non-standard stringology. In Proceedings of the 6th Symposium on Combinatorial Pattern Matching, CPM '95, pages 298\u2013317. Springer, 1995."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2989385"},{"key":"e_1_3_2_1_48_1","first-page":"1577","volume-title":"Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS '19","author":"Nakos Vasileios","unstructured":"Vasileios Nakos, Zhao Song, and Zhengyu Wang. (Nearly) sample-optimal sparse Fourier transform in any dimension; RIPless and filterless. In Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS '19, pages 1568\u20131577. IEEE Computer Society, 2019."},{"key":"e_1_3_2_1_49_1","first-page":"610","volume-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC '10","author":"Patrascu Mihai","unstructured":"Mihai Patrascu. Towards polynomial lower bounds for dynamic problems. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC '10, pages 603\u2013610. ACM, 2010."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209022"},{"key":"e_1_3_2_1_51_1","first-page":"600","volume-title":"Proceedings of the 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS '15","author":"Price Eric","unstructured":"Eric Price and Zhao Song. A robust sparse Fourier transform in the continuous setting. In Proceedings of the 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS '15, pages 583\u2013600. IEEE Computer Society, 2015."},{"key":"e_1_3_2_1_52_1","first-page":"2450","volume-title":"Proceedings of the 45th IEEE International Symposium on Information Theory, ISIT '12","author":"Price Eric","unstructured":"Eric Price and David P. Woodruff. Applications of the Shannon-Hartley theorem to data streams and recovery. In Proceedings of the 45th IEEE International Symposium on Information Theory, ISIT '12, pages 2446\u20132450. IEEE, 2012."},{"key":"e_1_3_2_1_53_1","first-page":"72","volume-title":"Proceedings of Milestones in Computer Algebra","author":"Roche Daniel S.","year":"2008","unstructured":"Daniel S. Roche. Adaptive polynomial multiplication. Proceedings of Milestones in Computer Algebra, pages 65\u201372, 2008."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.08.013"},{"key":"e_1_3_2_1_55_1","first-page":"30","volume-title":"Proceedings of the 43rd International Symposium on Symbolic and Algebraic Computation, ISSAC '18","author":"Roche Daniel S.","unstructured":"Daniel S. Roche. What can (and can't) we do with sparse polynomials? In Proceedings of the 43rd International Symposium on Symbolic and Algebraic Computation, ISSAC '18, pages 25\u201330. ACM, 2018."},{"key":"e_1_3_2_1_56_1","unstructured":"Allan Steel. Multivariate polynomial rings. http:\/\/magma.maths.usyd.edu.au\/magma\/handbook\/text\/223#1924 2018."},{"key":"e_1_3_2_1_57_1","first-page":"218","volume-title":"Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12","author":"Der Hoeven Joris Van","unstructured":"Joris Van Der Hoeven and Gr\u00e9goire Lecerf. On the complexity of multivariate blockwise polynomial multiplication. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pages 211\u2013218. ACM, 2012."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2012.06.004"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054056"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205008"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451090","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":60,"alternative-id":["10.1145\/3406325.3451090","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451090","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}