{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T23:32:20Z","timestamp":1768433540946,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"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,8,14]]},"DOI":"10.1145\/3447548.3467180","type":"proceedings-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T18:21:39Z","timestamp":1628878899000},"page":"2802-2810","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Clustering for Private Interest-based Advertising"],"prefix":"10.1145","author":[{"given":"Alessandro","family":"Epasto","sequence":"first","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"Andr\u00e9s","family":"Mu\u00f1oz Medina","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"Steven","family":"Avery","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Yijian","family":"Bai","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Robert","family":"Busa-Fekete","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"CJ","family":"Carey","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"Ya","family":"Gao","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"David","family":"Guthrie","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Subham","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"James","family":"Ioannidis","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Junyi","family":"Jiao","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Jakub","family":"Lacki","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"Jason","family":"Lee","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"Arne","family":"Mauser","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Brian","family":"Milch","sequence":"additional","affiliation":[{"name":"Google, Los Angeles, CA, USA"}]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"Deepak","family":"Ravichandran","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Wei","family":"Shi","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Max","family":"Spero","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Yunting","family":"Sun","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"Umar","family":"Syed","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Google, New York, NY, USA"}]},{"given":"Shuo","family":"Wang","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Approximation algorithms for k-anonymity. Journal of Privacy Technology (JOPT)","author":"Aggarwal Gagan","year":"2005","unstructured":"Gagan Aggarwal , Tomas Feder , Krishnaram Kenthapadi , Rajeev Motwani , Rina Panigrahy , Dilys Thomas , and An Zhu . 2005. Approximation algorithms for k-anonymity. Journal of Privacy Technology (JOPT) ( 2005 ). Gagan Aggarwal, Tomas Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, and An Zhu. 2005. Approximation algorithms for k-anonymity. Journal of Privacy Technology (JOPT) (2005)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.15"},{"key":"e_1_3_2_1_3_1","first-page":"2","article-title":"Streaming k-means approximation","volume":"4","author":"Ailon Nir","year":"2009","unstructured":"Nir Ailon , Ragesh Jaiswal , and Claire Monteleoni . 2009 . Streaming k-means approximation .. In NIPS , Vol. 4. 2 . Nir Ailon, Ragesh Jaiswal, and Claire Monteleoni. 2009. Streaming k-means approximation.. In NIPS, Vol. 4. 2.","journal-title":"NIPS"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.04.040"},{"key":"e_1_3_2_1_6_1","volume-title":"International Conference on Machine Learning. PMLR, 292--300","author":"Bachem Olivier","year":"2017","unstructured":"Olivier Bachem , Mario Lucic , and Andreas Krause . 2017 . Distributed and provably good seedings for k-means in constant rounds . In International Conference on Machine Learning. PMLR, 292--300 . Olivier Bachem, Mario Lucic, and Andreas Krause. 2017. Distributed and provably good seedings for k-means in constant rounds. In International Conference on Machine Learning. PMLR, 292--300."},{"key":"e_1_3_2_1_7_1","volume-title":"Correlation clustering. Machine learning","author":"Bansal Nikhil","year":"2004","unstructured":"Nikhil Bansal , Avrim Blum , and Shuchi Chawla . 2004. Correlation clustering. Machine learning , Vol. 56 , 1 ( 2004 ), 89--113. Nikhil Bansal, Avrim Blum, and Shuchi Chawla. 2004. Correlation clustering. Machine learning, Vol. 56, 1 (2004), 89--113."},{"key":"e_1_3_2_1_8_1","volume-title":"Mirrokni","author":"Bateni MohammadHossein","year":"2014","unstructured":"MohammadHossein Bateni , Aditya Bhaskara , Silvio Lattanzi , and Vahab S . Mirrokni . 2014 . Distributed Balanced Clustering via Mapping Coresets. In NeurIPS. 2591--2599. MohammadHossein Bateni, Aditya Bhaskara, Silvio Lattanzi, and Vahab S. Mirrokni. 2014. Distributed Balanced Clustering via Mapping Coresets. In NeurIPS. 2591--2599."},{"key":"e_1_3_2_1_9_1","volume-title":"Raimondas Kiveris, Silvio Lattanzi, and Vahab Mirrokni.","author":"Bateni Mohammad Hossein","year":"2017","unstructured":"Mohammad Hossein Bateni , Soheil Behnezhad , Mahsa Derakhshan , Mohammad Taghi Hajiaghayi , Raimondas Kiveris, Silvio Lattanzi, and Vahab Mirrokni. 2017 . Affinity clustering: Hierarchical clustering at scale. In NeurIPS. 6867--6877. Mohammad Hossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, and Vahab Mirrokni. 2017. Affinity clustering: Hierarchical clustering at scale. In NeurIPS. 6867--6877."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Mayank Bawa Tyson Condie and Prasanna Ganesan. 2005. LSH forest: self-tuning indexes for similarity search. In WWW. 651--660.  Mayank Bawa Tyson Condie and Prasanna Ganesan. 2005. LSH forest: self-tuning indexes for similarity search. In WWW. 651--660.","DOI":"10.1145\/1060745.1060840"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR","author":"Bertin-Mahieux Thierry","year":"2011","unstructured":"Thierry Bertin-Mahieux , Daniel P.W. Ellis , Brian Whitman , and Paul Lamere . 2011 . The Million Song Dataset . In Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR 2011). Thierry Bertin-Mahieux, Daniel P.W. Ellis, Brian Whitman, and Paul Lamere. 2011. The Million Song Dataset. In Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR 2011)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1783823.1783848"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897527"},{"key":"e_1_3_2_1_14_1","volume-title":"Mirrokni","author":"Datar Mayur","year":"2004","unstructured":"Mayur Datar , Nicole Immorlica , Piotr Indyk , and Vahab S . Mirrokni . 2004 . Locality-sensitive hashing scheme based on p-stable distributions. In SOCG, Jack Snoeyink and Jean-Daniel Boissonnat (Eds.). ACM , 253--262. Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In SOCG, Jack Snoeyink and Jean-Daniel Boissonnat (Eds.). ACM, 253--262."},{"key":"e_1_3_2_1_15_1","volume-title":"How does gene expression clustering work? Nature biotechnology","author":"D'haeseleer Patrik","year":"2005","unstructured":"Patrik D'haeseleer . 2005. How does gene expression clustering work? Nature biotechnology , Vol. 23 , 12 ( 2005 ), 1499--1501. Patrik D'haeseleer. 2005. How does gene expression clustering work? Nature biotechnology, Vol. 23, 12 (2005), 1499--1501."},{"key":"e_1_3_2_1_16_1","unstructured":"Laxman Dhulipala David Eisenstat Vahab Mirrokni and Jessica Shi. 2021. Hierarchical Agglomerative Graph Clustering in Nearly Linear Time. In ICML .  Laxman Dhulipala David Eisenstat Vahab Mirrokni and Jessica Shi. 2021. Hierarchical Agglomerative Graph Clustering in Nearly Linear Time. In ICML ."},{"key":"e_1_3_2_1_17_1","volume-title":"Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. arXiv preprint","author":"Epasto Alessandro","year":"2021","unstructured":"Alessandro Epasto , Mohammad Mahdian , Vahab Mirrokni , and Peilin Zhong . 2021. Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. arXiv preprint ( 2021 ). Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni, and Peilin Zhong. 2021. Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. arXiv preprint (2021)."},{"key":"e_1_3_2_1_18_1","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester Martin","year":"1996","unstructured":"Martin Ester , Hans-Peter Kriegel , J\u00f6rg Sander , Xiaowei Xu , 1996 . A density-based algorithm for discovering clusters in large spatial databases with noise .. In KDD , Vol. 96. 226 -- 231 . Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, Xiaowei Xu, et al. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise.. In KDD, Vol. 96. 226--231.","journal-title":"KDD"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2016.12.016"},{"key":"e_1_3_2_1_20_1","volume-title":"Community detection in graphs. Physics reports","author":"Fortunato Santo","year":"2010","unstructured":"Santo Fortunato . 2010. Community detection in graphs. Physics reports , Vol. 486 , 3--5 ( 2010 ), 75--174. Santo Fortunato. 2010. Community detection in graphs. Physics reports, Vol. 486, 3--5 (2010), 75--174."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346439"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 8th USENIX, David G. Andersen and Sylvia Ratnasamy (Eds.). USENIX Association.","author":"Guha Saikat","year":"2011","unstructured":"Saikat Guha , Bin Cheng , and Paul Francis . 2011 . Privad: Practical Privacy in Online Advertising . In Proceedings of the 8th USENIX, David G. Andersen and Sylvia Ratnasamy (Eds.). USENIX Association. Saikat Guha, Bin Cheng, and Paul Francis. 2011. Privad: Practical Privacy in Online Advertising. In Proceedings of the 8th USENIX, David G. Andersen and Sylvia Ratnasamy (Eds.). USENIX Association."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403302"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Sariel Har-Peled and Soham Mazumdar. 2004. On coresets for k-means and k-median clustering. In STOC. 291--300.  Sariel Har-Peled and Soham Mazumdar. 2004. On coresets for k-means and k-median clustering. In STOC. 291--300.","DOI":"10.1145\/1007352.1007400"},{"key":"e_1_3_2_1_26_1","article-title":"The MovieLens Datasets","volume":"5","author":"Maxwell Harper F.","year":"2015","unstructured":"F. Maxwell Harper and Joseph A. Konstan . 2015 . The MovieLens Datasets : History and Context. ACM Trans. Interact. Intell. Syst. , Vol. 5 , 4, Article Article 19 (Dec. 2015), 19 pages. https:\/\/doi.org\/10.1145\/2827872 10.1145\/2827872 F. Maxwell Harper and Joseph A. Konstan. 2015. The MovieLens Datasets: History and Context. ACM Trans. Interact. Intell. Syst., Vol. 5, 4, Article Article 19 (Dec. 2015), 19 pages. https:\/\/doi.org\/10.1145\/2827872","journal-title":"History and Context. ACM Trans. Interact. Intell. Syst."},{"key":"e_1_3_2_1_27_1","volume-title":"Howe and Helen Nissenbaum","author":"Daniel","year":"2017","unstructured":"Daniel C. Howe and Helen Nissenbaum . 2017 . Engineering Privacy and Protest: A Case Study of AdNauseam. In Proceedings of IWPE@SP, Jos\u00e9 M. del \u00c1lamo, Seda F. G\u00fc rses, and Anupam Datta (Eds.), Vol. 1873 . CEUR-WS. org, 57--64. Daniel C. Howe and Helen Nissenbaum. 2017. Engineering Privacy and Protest: A Case Study of AdNauseam. In Proceedings of IWPE@SP, Jos\u00e9 M. del \u00c1lamo, Seda F. G\u00fc rses, and Anupam Datta (Eds.), Vol. 1873. CEUR-WS.org, 57--64."},{"key":"e_1_3_2_1_28_1","volume-title":"Data clustering: 50 years beyond K-means. Pattern recognition letters","author":"Jain Anil K","year":"2010","unstructured":"Anil K Jain . 2010. Data clustering: 50 years beyond K-means. Pattern recognition letters , Vol. 31 , 8 ( 2010 ), 651--666. Anil K Jain. 2010. Data clustering: 50 years beyond K-means. Pattern recognition letters, Vol. 31, 8 (2010), 651--666."},{"key":"e_1_3_2_1_29_1","volume-title":"Cryptographers' Track at the RSA Conference","author":"Juels Ari","unstructured":"Ari Juels . 2001. Targeted advertising... and privacy too . In Cryptographers' Track at the RSA Conference . Springer , 408--424. Ari Juels. 2001. Targeted advertising... and privacy too. In Cryptographers' Track at the RSA Conference. Springer, 408--424."},{"key":"e_1_3_2_1_30_1","unstructured":"Josh Karlin. [n.d.]. Federated Learning of Cohorts (FLoC). https:\/\/github.com\/WICG\/floc  Josh Karlin. [n.d.]. Federated Learning of Cohorts (FLoC). https:\/\/github.com\/WICG\/floc"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.01.002"},{"key":"e_1_3_2_1_33_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Khuller Samir","unstructured":"Samir Khuller and Barna Saha . 2009. On finding dense subgraphs . In International Colloquium on Automata, Languages, and Programming . Springer , 597--608. Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In International Colloquium on Automata, Languages, and Programming. Springer, 597--608."},{"key":"e_1_3_2_1_34_1","unstructured":"Matth\"aus Kleindessner Pranjal Awasthi and Jamie Morgenstern. 2019. Fair k-Center Clustering for Data Summarization. In ICML .  Matth\"aus Kleindessner Pranjal Awasthi and Jamie Morgenstern. 2019. Fair k-Center Clustering for Data Summarization. In ICML ."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772755"},{"key":"e_1_3_2_1_36_1","series-title":"SIAM J. Comput. (2016)","volume-title":"Approximating k-Median via Pseudo-Approximation","author":"Li Shi","unstructured":"Shi Li and Ola Svensson . 2016. Approximating k-Median via Pseudo-Approximation . SIAM J. Comput. (2016) . Shi Li and Ola Svensson. 2016. Approximating k-Median via Pseudo-Approximation. SIAM J. Comput. (2016)."},{"key":"e_1_3_2_1_37_1","unstructured":"Gustavo Malkomes Matt J Kusner Wenlin Chen Kilian Q Weinberger and Benjamin Moseley. 2015. Fast distributed k-center clustering with outliers on massive data. In Advances in Neural Information Processing Systems. 1063--1071.  Gustavo Malkomes Matt J Kusner Wenlin Chen Kilian Q Weinberger and Benjamin Moseley. 2015. Fast distributed k-center clustering with outliers on massive data. In Advances in Neural Information Processing Systems. 1063--1071."},{"key":"e_1_3_2_1_38_1","volume-title":"Proc. Priv. Enhancing Technol.","author":"Christo Wilson Bashir","year":"2018","unstructured":"Bashir Muhammad A and Christo Wilson . 2018 . Diffusion of User Tracking Data in the Online Advertising Ecosystem . Proc. Priv. Enhancing Technol. (2018). Bashir Muhammad A and Christo Wilson. 2018. Diffusion of User Tracking Data in the Online Advertising Ecosystem. Proc. Priv. Enhancing Technol. (2018)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.53"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Liudmila Prokhorenkova Alexey Tikhonov and Nelly Litvak. 2019. Learning clusters through information diffusion. In WWW. 3151--3157.  Liudmila Prokhorenkova Alexey Tikhonov and Nelly Litvak. 2019. Learning clusters through information diffusion. In WWW. 3151--3157.","DOI":"10.1145\/3308558.3313560"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275508"},{"key":"e_1_3_2_1_42_1","first-page":"149","article-title":"Interpreting PET scans by structured patient data: a data mining case study in dementia research","volume":"24","author":"Schmidt Jana","year":"2010","unstructured":"Jana Schmidt , Andreas Hapfelmeier , Marianne Mueller , Robert Perneczky , Alexander Kurz , Alexander Drzezga , and Stefan Kramer . 2010 . Interpreting PET scans by structured patient data: a data mining case study in dementia research . KAIS , Vol. 24 , 1 (2010), 149 -- 170 . Jana Schmidt, Andreas Hapfelmeier, Marianne Mueller, Robert Perneczky, Alexander Kurz, Alexander Drzezga, and Stefan Kramer. 2010. Interpreting PET scans by structured patient data: a data mining case study in dementia research. KAIS, Vol. 24, 1 (2010), 149--170.","journal-title":"KAIS"},{"key":"e_1_3_2_1_43_1","volume-title":"AISTATS","volume":"33","author":"Shrivastava Anshumali","year":"2014","unstructured":"Anshumali Shrivastava and Ping Li . 2014 . In Defense of Minhash over Simhash . In AISTATS , Vol. 33 . JMLR.org, 886--894. Anshumali Shrivastava and Ping Li. 2014. In Defense of Minhash over Simhash. In AISTATS, Vol. 33. JMLR.org, 886--894."},{"key":"e_1_3_2_1_44_1","unstructured":"Statista. [n.d.]. Internet Usage Worldwide. https:\/\/www.statista.com\/statistics\/617136\/digital-population-worldwide\/  Statista. [n.d.]. Internet Usage Worldwide. https:\/\/www.statista.com\/statistics\/617136\/digital-population-worldwide\/"},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings Network and Distributed System Symposium. The Internet Society.","author":"Toubiana Vincent","year":"2010","unstructured":"Vincent Toubiana , Arvind Narayanan , Dan Boneh , Helen Nissenbaum , and Solon Barocas . 2010 . Adnostic: Privacy preserving targeted advertising . In Proceedings Network and Distributed System Symposium. The Internet Society. Vincent Toubiana, Arvind Narayanan, Dan Boneh, Helen Nissenbaum, and Solon Barocas. 2010. Adnostic: Privacy preserving targeted advertising. In Proceedings Network and Distributed System Symposium. The Internet Society."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040-1"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Jaewon Yang and Jure Leskovec. 2013. Overlapping community detection at scale: a nonnegative matrix factorization approach. In WSDM. 587--596.  Jaewon Yang and Jure Leskovec. 2013. Overlapping community detection at scale: a nonnegative matrix factorization approach. In WSDM. 587--596.","DOI":"10.1145\/2433396.2433471"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Kang Zhao Hongtao Lu and Jincheng Mei. 2014. Locality Preserving Hashing. In AAAI .  Kang Zhao Hongtao Lu and Jincheng Mei. 2014. Locality Preserving Hashing. In AAAI .","DOI":"10.1609\/aaai.v28i1.9133"}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467180","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:27Z","timestamp":1750191507000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":48,"alternative-id":["10.1145\/3447548.3467180","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467180","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}