{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:15Z","timestamp":1775638455647,"version":"3.50.1"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:00:00Z","timestamp":1643587200000},"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":["SIGMOD Rec."],"published-print":{"date-parts":[[2022,1,31]]},"abstract":"<jats:p>The research area of data summarization seeks to find small data structures that can be updated flexibly, and answer certain queries on the input accurately. Summaries are widely used across the area of data management, and are studied from both theoretical and practical perspectives. They are the subject of ongoing research to improve their performance and broaden their applicability. In this column, recent developments in data summarization are surveyed, with the intent of inspiring further advances.<\/jats:p>","DOI":"10.1145\/3516431.3516433","type":"journal-article","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T23:31:58Z","timestamp":1643671918000},"page":"6-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Current Trends in Data Summaries"],"prefix":"10.1145","volume":"50","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[]}],"member":"320","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451041"},{"key":"e_1_2_1_2_1","volume-title":"Learning with privacy at scale. https:\/\/docs-assets.developer.apple. com\/ml-research\/papers\/ learning-with-privacy-at-scale.pdf","author":"Privacy Team Apple Differential","year":"2017","unstructured":"Apple Differential Privacy Team . Learning with privacy at scale. https:\/\/docs-assets.developer.apple. com\/ml-research\/papers\/ learning-with-privacy-at-scale.pdf , 2017 . Apple Differential Privacy Team. Learning with privacy at scale. https:\/\/docs-assets.developer.apple. com\/ml-research\/papers\/ learning-with-privacy-at-scale.pdf, 2017."},{"key":"e_1_2_1_3_1","first-page":"1","volume-title":"48th International Colloquium on Automata, Languages, and Programming, ICALP 2021","volume":"198","author":"Basat R. B.","year":"2021","unstructured":"R. B. Basat , M. Mitzenmacher , and S. Vargaftik . How to send a real number using a single bit (and some shared randomness). In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021 , volume 198 of LIPIcs, pages 25: 1 -- 25 :20. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik , 2021 . R. B. Basat, M. Mitzenmacher, and S. Vargaftik. How to send a real number using a single bit (and some shared randomness). In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, volume 198 of LIPIcs, pages 25:1--25:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2021."},{"key":"e_1_2_1_4_1","first-page":"16","article-title":"Practical locally private heavy 12 SIGMOD Record, December 2021 (Vol. 50, No. 4) hitters","volume":"21","author":"Bassily R.","year":"2020","unstructured":"R. Bassily , K. Nissim , U. Stemmer , and A. Thakurta . Practical locally private heavy 12 SIGMOD Record, December 2021 (Vol. 50, No. 4) hitters . J. Mach. Learn. Res. , 21 : 16 :1--16:42, 2020 . R. Bassily, K. Nissim, U. Stemmer, and A. Thakurta. Practical locally private heavy 12 SIGMOD Record, December 2021 (Vol. 50, No. 4) hitters. J. Mach. Learn. Res., 21:16:1--16:42, 2020.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387658"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387643"},{"key":"e_1_2_1_7_1","first-page":"992","volume-title":"Proceedings of the 38th International Conference on Machine Learning, ICML, volume 139 of Proceedings of Machine Learning Research","author":"Blalock D. W.","year":"2021","unstructured":"D. W. Blalock and J. V. Guttag . Multiplying matrices without multiplying . In Proceedings of the 38th International Conference on Machine Learning, ICML, volume 139 of Proceedings of Machine Learning Research , pages 992 -- 1004 . PMLR, 2021 . D. W. Blalock and J. V. Guttag. Multiplying matrices without multiplying. In Proceedings of the 38th International Conference on Machine Learning, ICML, volume 139 of Proceedings of Machine Learning Research, pages 992--1004. PMLR, 2021."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"e_1_2_1_10_1","volume-title":"NeurIPS","author":"Braverman V.","year":"2021","unstructured":"V. Braverman , A. Hasidim , Y. Matias , M. Schain , S. Silwal , and S. Zhou . Adversarial robustness of streaming algorithms through importance sampling . In NeurIPS , 2021 . V. Braverman, A. Hasidim, Y. Matias, M. Schain, S. Silwal, and S. Zhou. Adversarial robustness of streaming algorithms through importance sampling. In NeurIPS, 2021."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043621.2043626"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0047"},{"key":"e_1_2_1_14_1","first-page":"2404","volume-title":"The 24th International Conference on Artificial Intelligence and Statistics, AISTATS, volume 130 of Proceedings of Machine Learning Research","author":"Cohen E.","year":"2021","unstructured":"E. Cohen , O. Geri , T. Sarl\u00b4os , and U. Stemmer . Differentially private weighted sampling . In The 24th International Conference on Artificial Intelligence and Statistics, AISTATS, volume 130 of Proceedings of Machine Learning Research , pages 2404 -- 2412 . PMLR, 2021 . E. Cohen, O. Geri, T. Sarl\u00b4os, and U. Stemmer. Differentially private weighted sampling. In The 24th International Conference on Artificial Intelligence and Statistics, AISTATS, volume 130 of Proceedings of Machine Learning Research, pages 2404--2412. PMLR, 2021."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452021.3458323"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467152"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.5"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387650"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108769938"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0018"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476276"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_2_1_25_1","volume-title":"A survey on the evolution of stream processing systems. CoRR, abs\/2008.00842","author":"Fragkoulis M.","year":"2020","unstructured":"M. Fragkoulis , P. Carbone , V. Kalavri , and A. Katsifodimos . A survey on the evolution of stream processing systems. CoRR, abs\/2008.00842 , 2020 . M. Fragkoulis, P. Carbone, V. Kalavri, and A. Katsifodimos. A survey on the evolution of stream processing systems. CoRR, abs\/2008.00842, 2020."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375670"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/07069328X"},{"key":"e_1_2_1_28_1","first-page":"50","article-title":"Communication-efficient and private federated learning via sketching. CoRR, abs\/2008.04975, 2020","author":"Haddadpour F.","year":"2021","unstructured":"F. Haddadpour , B. Karimi , P. Li , and X. Li. Fedsketch : Communication-efficient and private federated learning via sketching. CoRR, abs\/2008.04975, 2020 . SIGMOD Record , December 2021 (Vol. 50 , No. 4) 13 F. Haddadpour, B. Karimi, P. Li, and X. Li. Fedsketch: Communication-efficient and private federated learning via sketching. CoRR, abs\/2008.04975, 2020. SIGMOD Record, December 2021 (Vol. 50, No. 4) 13","journal-title":"SIGMOD Record"},{"key":"e_1_2_1_29_1","volume-title":"Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020","author":"Hassidim A.","year":"2020","unstructured":"A. Hassidim , H. Kaplan , Y. Mansour , Y. Matias , and U. Stemmer . Adversarially robust streaming algorithms via differential privacy . In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020 , 2020 . A. Hassidim, H. Kaplan, Y. Mansour, Y. Matias, and U. Stemmer. Adversarially robust streaming algorithms via differential privacy. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020."},{"key":"e_1_2_1_30_1","volume-title":"7th International Conference on Learning Representations, ICLR 2019","author":"Hsu C.","year":"2019","unstructured":"C. Hsu , P. Indyk , D. Katabi , and A. Vakilian . Learning-based frequency estimation algorithms . In 7th International Conference on Learning Representations, ICLR 2019 . OpenReview.net , 2019 . C. Hsu, P. Indyk, D. Katabi, and A. Vakilian. Learning-based frequency estimation algorithms. In 7th International Conference on Learning Representations, ICLR 2019. OpenReview.net, 2019."},{"key":"e_1_2_1_31_1","volume-title":"Frequency estimation under multiparty differential privacy: One-shot and streaming. CoRR, abs\/2104.01808","author":"Huang Z.","year":"2021","unstructured":"Z. Huang , Y. Qiu , K. Yi , and G. Cormode . Frequency estimation under multiparty differential privacy: One-shot and streaming. CoRR, abs\/2104.01808 , 2021 . Z. Huang, Y. Qiu, K. Yi, and G. Cormode. Frequency estimation under multiparty differential privacy: One-shot and streaming. CoRR, abs\/2104.01808, 2021."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881195.1881206"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3454952"},{"key":"e_1_2_1_34_1","first-page":"4797","volume-title":"Proceedings of the 38th International Conference on Machine Learning, ICML, volume 139 of Proceedings of Machine Learning Research","author":"Jayaram R.","year":"2021","unstructured":"R. Jayaram , A. Samadian , D. P. Woodruff , and P. Ye . In-database regression in input sparsity time . In Proceedings of the 38th International Conference on Machine Learning, ICML, volume 139 of Proceedings of Machine Learning Research , pages 4797 -- 4806 . PMLR, 2021 . R. Jayaram, A. Samadian, D. P. Woodruff, and P. Ye. In-database regression in input sparsity time. In Proceedings of the 38th International Conference on Machine Learning, ICML, volume 139 of Proceedings of Machine Learning Research, pages 4797--4806. PMLR, 2021."},{"key":"e_1_2_1_35_1","volume-title":"8th International Conference on Learning Representations, ICLR 2020","author":"Jiang T.","year":"2020","unstructured":"T. Jiang , Y. Li , H. Lin , Y. Ruan , and D. P. Woodruff . Learning-augmented data stream algorithms . In 8th International Conference on Learning Representations, ICLR 2020 . OpenReview.net , 2020 . T. Jiang, Y. Li, H. Lin, Y. Ruan, and D. P. Woodruff. Learning-augmented data stream algorithms. In 8th International Conference on Learning Representations, ICLR 2020. OpenReview.net, 2020."},{"key":"e_1_2_1_36_1","first-page":"5213","volume-title":"Proceedings of the 38th International Conference on Machine Learning, ICML, volume 139 of Proceedings of Machine Learning Research","author":"Kairouz P.","year":"2021","unstructured":"P. Kairouz , B. McMahan , S. Song , O. Thakkar , A. Thakurta , and Z. Xu . Practical and private (deep) learning without sampling or shuffling . In Proceedings of the 38th International Conference on Machine Learning, ICML, volume 139 of Proceedings of Machine Learning Research , pages 5213 -- 5225 . PMLR, 2021 . P. Kairouz, B. McMahan, S. Song, O. Thakkar, A. Thakurta, and Z. Xu. Practical and private (deep) learning without sampling or shuffling. In Proceedings of the 38th International Conference on Machine Learning, ICML, volume 139 of Proceedings of Machine Learning Research, pages 5213--5225. PMLR, 2021."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680837896"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_4"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.17"},{"key":"e_1_2_1_40_1","volume-title":"Small space and streaming pattern matching with k edits. CoRR, abs\/2106.06037","author":"Kociumaka T.","year":"2021","unstructured":"T. Kociumaka , E. Porat , and T. Starikovskaya . Small space and streaming pattern matching with k edits. CoRR, abs\/2106.06037 , 2021 . T. Kociumaka, E. Porat, and T. Starikovskaya. Small space and streaming pattern matching with k edits. CoRR, abs\/2106.06037, 2021."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_2_1_42_1","volume-title":"an even more nearly optimal cardinality estimation algorithm. CoRR, abs\/1708.06839","author":"Lang K. J.","year":"2017","unstructured":"K. J. Lang . Back to the future : an even more nearly optimal cardinality estimation algorithm. CoRR, abs\/1708.06839 , 2017 . K. J. Lang. Back to the future: an even more nearly optimal cardinality estimation algorithm. CoRR, abs\/1708.06839, 2017."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-018-0074-4"},{"key":"e_1_2_1_44_1","volume-title":"Learning-augmented sketches for hessians. CoRR, abs\/2102.12317","author":"Li Y.","year":"2021","unstructured":"Y. Li , H. Lin , and D. P. Woodruff . Learning-augmented sketches for hessians. CoRR, abs\/2102.12317 , 2021 . Y. Li, H. Lin, and D. P. Woodruff. Learning-augmented sketches for hessians. CoRR, abs\/2102.12317, 2021."},{"key":"e_1_2_1_45_1","volume-title":"The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD","author":"Liberty E.","year":"2012","unstructured":"E. Liberty and J. Nelson . Streaming data mining . In The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD , 2012 . E. Liberty and J. Nelson. Streaming data mining. In The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, 2012."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399510"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"key":"e_1_2_1_48_1","volume-title":"14 SIGMOD Record","author":"Nelson J.","year":"2021","unstructured":"J. Nelson and H. Yu . Optimal bounds for approximate counting. CoRR, abs\/2010.02116, 2020 . 14 SIGMOD Record , December 2021 (Vol. 50, No. 4) J. Nelson and H. Yu. Optimal bounds for approximate counting. CoRR, abs\/2010.02116, 2020. 14 SIGMOD Record, December 2021 (Vol. 50, No. 4)"},{"key":"e_1_2_1_49_1","first-page":"1","volume-title":"24th International Conference on Database Theory, ICDT","volume":"186","author":"Pagh R.","year":"2021","unstructured":"R. Pagh and N. M. Stausholm . Efficient differentially private F0 linear sketching . In 24th International Conference on Database Theory, ICDT , volume 186 of LIPIcs, pages 18: 1 -- 18 :19. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik , 2021 . R. Pagh and N. M. Stausholm. Efficient differentially private F0 linear sketching. In 24th International Conference on Database Theory, ICDT, volume 186 of LIPIcs, pages 18:1--18:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2021."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451032"},{"key":"e_1_2_1_51_1","first-page":"1","volume-title":"48th International Colloquium on Automata, Languages, and Programming, ICALP 2021","volume":"198","author":"Pettie S.","year":"2021","unstructured":"S. Pettie , D. Wang , and L. Yin . Non-mergeable sketching for cardinality estimation. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021 , volume 198 of LIPIcs, pages 104: 1 -- 104 :20. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik , 2021 . S. Pettie, D. Wang, and L. Yin. Non-mergeable sketching for cardinality estimation. In 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, volume 198 of LIPIcs, pages 104:1--104:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik, 2021."},{"key":"e_1_2_1_52_1","first-page":"8253","volume-title":"Proceedings of the 37th International Conference on Machine Learning, ICML, volume 119 of Proceedings of Machine Learning Research","author":"Rothchild D.","year":"2020","unstructured":"D. Rothchild , A. Panda , E. Ullah , N. Ivkin , I. Stoica , V. Braverman , J. Gonzalez , and R. Arora . Fetchsgd: Communication-efficient federated learning with sketching . In Proceedings of the 37th International Conference on Machine Learning, ICML, volume 119 of Proceedings of Machine Learning Research , pages 8253 -- 8265 . PMLR, 2020 . D. Rothchild, A. Panda, E. Ullah, N. Ivkin, I. Stoica, V. Braverman, J. Gonzalez, and R. Arora. Fetchsgd: Communication-efficient federated learning with sketching. In Proceedings of the 37th International Conference on Machine Learning, ICML, volume 119 of Proceedings of Machine Learning Research, pages 8253--8265. PMLR, 2020."},{"key":"e_1_2_1_53_1","volume-title":"Annual Conference on Neural Information Processing Systems","author":"Smith A. D.","year":"2020","unstructured":"A. D. Smith , S. Song , and A. Thakurta . The flajolet-martin sketch itself preserves differential privacy: Private counting with minimal space . In Annual Conference on Neural Information Processing Systems , 2020 . A. D. Smith, S. Song, and A. Thakurta. The flajolet-martin sketch itself preserves differential privacy: Private counting with minimal space. In Annual Conference on Neural Information Processing Systems, 2020."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196930"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219975"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3406480"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384309"},{"key":"e_1_2_1_58_1","volume-title":"DRIVE: one-bit distributed mean estimation. CoRR, abs\/2105.08339","author":"Vargaftik S.","year":"2021","unstructured":"S. Vargaftik , R. B. Basat , A. Portnoy , G. Mendelson , Y. Ben-Itzhak , and M. Mitzenmacher . DRIVE: one-bit distributed mean estimation. CoRR, abs\/2105.08339 , 2021 . S. Vargaftik, R. B. Basat, A. Portnoy, G. Mendelson, Y. Ben-Itzhak, and M. Mitzenmacher. DRIVE: one-bit distributed mean estimation. CoRR, abs\/2105.08339, 2021."},{"key":"e_1_2_1_59_1","volume-title":"Tight bounds for adversarially robust streams and sliding windows via difference estimators. CoRR, abs\/2011.07471","author":"Woodruff D. P.","year":"2020","unstructured":"D. P. Woodruff and S. Zhou . Tight bounds for adversarially robust streams and sliding windows via difference estimators. CoRR, abs\/2011.07471 , 2020 . D. P. Woodruff and S. Zhou. Tight bounds for adversarially robust streams and sliding windows via difference estimators. CoRR, abs\/2011.07471, 2020."},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017","author":"Yi K.","year":"2017","unstructured":"K. Yi . Random sampling on big data: Techniques and applications . In Proceedings of the ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017 , 2017 . K. Yi. Random sampling on big data: Techniques and applications. In Proceedings of the ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, 2017."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/3450980.3450990"},{"key":"e_1_2_1_62_1","first-page":"3837","volume-title":"The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS","volume":"108","author":"Zhu W.","year":"2020","unstructured":"W. Zhu , P. Kairouz , B. McMahan , H. Sun , and W. Li . Federated heavy hitters discovery with differential privacy . In The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS , volume 108 , pages 3837 -- 3847 . PMLR, 2020 . W. Zhu, P. Kairouz, B. McMahan, H. Sun, and W. Li. Federated heavy hitters discovery with differential privacy. In The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS, volume 108, pages 3837--3847. PMLR, 2020."}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3516431.3516433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3516431.3516433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:21Z","timestamp":1750188621000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3516431.3516433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,31]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,1,31]]}},"alternative-id":["10.1145\/3516431.3516433"],"URL":"https:\/\/doi.org\/10.1145\/3516431.3516433","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2022,1,31]]},"assertion":[{"value":"2022-01-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}