{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:56:07Z","timestamp":1778154967185,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"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":[[2020,4,20]]},"DOI":"10.1145\/3366423.3380184","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:11:44Z","timestamp":1588579904000},"page":"1060-1070","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Smaller, Faster & Lighter KNN Graph Constructions"],"prefix":"10.1145","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[{"name":"EPFL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[{"name":"Mediego \/ EPFL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Ruas","sequence":"additional","affiliation":[{"name":"Peking University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Ta\u00efani","sequence":"additional","affiliation":[{"name":"Univ Rennes Inria CNRS IRISA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Snips: The AI platform for voice-enabled devices. https:\/\/snips.ai\/. last accessed","year":"2017","unstructured":"[n.d.]. Snips: The AI platform for voice-enabled devices. https:\/\/snips.ai\/. last accessed April 19, 2017 . [n.d.]. Snips: The AI platform for voice-enabled devices. https:\/\/snips.ai\/. last accessed April 19, 2017."},{"key":"e_1_3_2_1_2_1","volume-title":"BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters.. In SSS.","author":"Alaggan Mohammad","year":"2012","unstructured":"Mohammad Alaggan , S\u00e9bastien Gambs , and Anne-Marie Kermarrec . 2012 . BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters.. In SSS. Mohammad Alaggan, S\u00e9bastien Gambs, and Anne-Marie Kermarrec. 2012. BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters.. In SSS."},{"key":"#cr-split#-e_1_3_2_1_3_1.1","doi-asserted-by":"crossref","unstructured":"Emmanuelle Anceaume Yann Busnel Nicolo Rivetti and Bruno Sericola. 2015. Identifying Global Icebergs in Distributed Streams. In SRDS. https:\/\/doi.org\/10.1109\/SRDS.2015.19 10.1109\/SRDS.2015.19","DOI":"10.1109\/SRDS.2015.19"},{"key":"#cr-split#-e_1_3_2_1_3_1.2","doi-asserted-by":"crossref","unstructured":"Emmanuelle Anceaume Yann Busnel Nicolo Rivetti and Bruno Sericola. 2015. Identifying Global Icebergs in Distributed Streams. In SRDS. https:\/\/doi.org\/10.1109\/SRDS.2015.19","DOI":"10.1109\/SRDS.2015.19"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Yoram Bachrach and Ely Porat. 2013. Sketching for big data recommender systems using fast pseudo-random fingerprints. In ICALP.  Yoram Bachrach and Ely Porat. 2013. Sketching for big data recommender systems using fast pseudo-random fingerprints. In ICALP.","DOI":"10.1007\/978-3-642-39212-2_41"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Xiao Bai Marin Bertier Rachid Guerraoui Anne-Marie Kermarrec and Vincent Leroy. 2010. Gossiping personalized queries. In EDBT.  Xiao Bai Marin Bertier Rachid Guerraoui Anne-Marie Kermarrec and Vincent Leroy. 2010. Gossiping personalized queries. In EDBT.","DOI":"10.1145\/1739041.1739055"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Marin Bertier Davide Frey Rachid Guerraoui Anne-Marie Kermarrec and Vincent Leroy. 2010. The gossple anonymous social network. In Middleware.  Marin Bertier Davide Frey Rachid Guerraoui Anne-Marie Kermarrec and Vincent Leroy. 2010. The gossple anonymous social network. In Middleware.","DOI":"10.1007\/978-3-642-16955-7_10"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Alina Beygelzimer Sham Kakade and John Langford. 2006. Cover trees for nearest neighbor. In ICML.  Alina Beygelzimer Sham Kakade and John Langford. 2006. Cover trees for nearest neighbor. In ICML.","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Antoine Boutet Davide Frey Rachid Guerraoui Anne-Marie Kermarrec and Rhicheek Patra. 2014. HyRec: leveraging browsers for scalable recommenders. In Middleware.  Antoine Boutet Davide Frey Rachid Guerraoui Anne-Marie Kermarrec and Rhicheek Patra. 2014. HyRec: leveraging browsers for scalable recommenders. In Middleware.","DOI":"10.1145\/2663165.2663315"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Antoine Boutet Anne-Marie Kermarrec Nupur Mittal and Fran\u00e7ois Ta\u00efani. 2016. Being prepared in a sparse world: the case of KNN graph construction. In ICDE.  Antoine Boutet Anne-Marie Kermarrec Nupur Mittal and Fran\u00e7ois Ta\u00efani. 2016. Being prepared in a sparse world: the case of KNN graph construction. In ICDE.","DOI":"10.1109\/ICDE.2016.7498244"},{"key":"e_1_3_2_1_10_1","unstructured":"Andrei\u00a0Z Broder. 1997. On the resemblance and containment of documents. In Compression and Complexity of Sequences.  Andrei\u00a0Z Broder. 1997. On the resemblance and containment of documents. In Compression and Complexity of Sequences."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Andrei\u00a0Z Broder Steven\u00a0C Glassman Mark\u00a0S Manasse and Geoffrey Zweig. 1997. Syntactic clustering of the web. Comp. Networks and ISDN Sys.(1997).  Andrei\u00a0Z Broder Steven\u00a0C Glassman Mark\u00a0S Manasse and Geoffrey Zweig. 1997. Syntactic clustering of the web. Comp. Networks and ISDN Sys.(1997).","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Rodrigo Bruno Duarte Patr\u00edcio Jos\u00e9 Sim\u00e3o Lu\u00eds Veiga and Paulo Ferreira. 2019. Runtime Object Lifetime Profiler for Latency Sensitive Big Data Applications. In EuroSys.  Rodrigo Bruno Duarte Patr\u00edcio Jos\u00e9 Sim\u00e3o Lu\u00eds Veiga and Paulo Ferreira. 2019. Runtime Object Lifetime Profiler for Latency Sensitive Big Data Applications. In EuroSys.","DOI":"10.1145\/3302424.3303988"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Moses Charikar Kevin Chen and Martin Farach-Colton. 2002. Finding frequent items in data streams. Automata languages and programming(2002).  Moses Charikar Kevin Chen and Martin Farach-Colton. 2002. Finding frequent items in data streams. Automata languages and programming(2002).","DOI":"10.1007\/3-540-45465-9_59"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Moses\u00a0S. Charikar. 2002. Similarity Estimation Techniques from Rounding Algorithms. In STOC.  Moses\u00a0S. Charikar. 2002. Similarity Estimation Techniques from Rounding Algorithms. In STOC.","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_15_1","volume-title":"Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection. J. of ML Research","author":"Chen Jie","year":"2009","unstructured":"Jie Chen , Haw-ren Fang, and Yousef Saad . 2009. Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection. J. of ML Research ( 2009 ). Jie Chen, Haw-ren Fang, and Yousef Saad. 2009. Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection. J. of ML Research (2009)."},{"key":"e_1_3_2_1_16_1","unstructured":"Eunjoon Cho Seth\u00a0A. Myers and Jure Leskovec. 2011. Friendship and Mobility: User Movement in Location-based Social Networks. In KDD.  Eunjoon Cho Seth\u00a0A. Myers and Jure Leskovec. 2011. Friendship and Mobility: User Movement in Location-based Social Networks. In KDD."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_18_1","unstructured":"Bin Cui Heng\u00a0Tao Shen Jialie Shen and Kian-Lee Tan. 2005. Exploring bit-difference for approximate knn search in high-dimensional databases. In AusDM.  Bin Cui Heng\u00a0Tao Shen Jialie Shen and Kian-Lee Tan. 2005. Exploring bit-difference for approximate knn search in high-dimensional databases. In AusDM."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Wei Dong Charikar Moses and Kai Li. 2011. Efficient k-nearest neighbor graph construction for generic similarity measures. In WWW.  Wei Dong Charikar Moses and Kai Li. 2011. Efficient k-nearest neighbor graph construction for generic similarity measures. In WWW.","DOI":"10.1145\/1963405.1963487"},{"key":"e_1_3_2_1_20_1","unstructured":"Cynthia Dwork. 2008. Differential privacy: A survey of results. In TAMC.  Cynthia Dwork. 2008. Differential privacy: A survey of results. In TAMC."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"MR Gorai KS Sridharan T Aditya R Mukkamala and S Nukavarapu. 2011. Employing bloom filters for privacy preserving distributed collaborative kNN classification. In WICT.  MR Gorai KS Sridharan T Aditya R Mukkamala and S Nukavarapu. 2011. Employing bloom filters for privacy preserving distributed collaborative kNN classification. In WICT.","DOI":"10.1109\/WICT.2011.6141295"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"F.\u00a0Maxwell Harper and Joseph\u00a0A. Konstan. 2015. The MovieLens Datasets: History and Context. ACM Trans. Interact. Intell. Syst.(2015).  F.\u00a0Maxwell Harper and Joseph\u00a0A. Konstan. 2015. The MovieLens Datasets: History and Context. ACM Trans. Interact. Intell. Syst.(2015).","DOI":"10.1145\/2827872"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC.  Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_24_1","volume-title":"Hash functions. Dr Dobbs Journal","author":"Jenkins Bob","year":"1997","unstructured":"Bob Jenkins . 1997. Hash functions. Dr Dobbs Journal ( 1997 ). Bob Jenkins. 1997. Hash functions. Dr Dobbs Journal (1997)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Kimberly Keeton Charles\u00a0B Morrey\u00a0III Craig\u00a0AN Soules and Alistair Veitch. 2010. Lazybase: freshness vs. performance in information management. SIGOPS Op. Sys. Review(2010).  Kimberly Keeton Charles\u00a0B Morrey\u00a0III Craig\u00a0AN Soules and Alistair Veitch. 2010. Lazybase: freshness vs. performance in information management. SIGOPS Op. Sys. Review(2010).","DOI":"10.1145\/1740390.1740395"},{"key":"#cr-split#-e_1_3_2_1_26_1.1","doi-asserted-by":"crossref","unstructured":"Anne-Marie Kermarrec Olivier Ruas and Fran\u00e7ois Ta\u00efani. 2018. Nobody Cares if You Liked Star Wars: KNN Graph Construction on the Cheap. In Euro-Par. https:\/\/doi.org\/10.1007\/978-3-319-96983-1_30 10.1007\/978-3-319-96983-1_30","DOI":"10.1007\/978-3-319-96983-1_30"},{"key":"#cr-split#-e_1_3_2_1_26_1.2","doi-asserted-by":"crossref","unstructured":"Anne-Marie Kermarrec Olivier Ruas and Fran\u00e7ois Ta\u00efani. 2018. Nobody Cares if You Liked Star Wars: KNN Graph Construction on the Cheap. In Euro-Par. https:\/\/doi.org\/10.1007\/978-3-319-96983-1_30","DOI":"10.1007\/978-3-319-96983-1_30"},{"key":"e_1_3_2_1_27_1","volume-title":"Exploring the tradeoff between performance and data freshness in database-driven web servers. The VLDB Journal","author":"Labrinidis Alexandros","year":"2004","unstructured":"Alexandros Labrinidis and Nick Roussopoulos . 2004. Exploring the tradeoff between performance and data freshness in database-driven web servers. The VLDB Journal ( 2004 ). Alexandros Labrinidis and Nick Roussopoulos. 2004. Exploring the tradeoff between performance and data freshness in database-driven web servers. The VLDB Journal (2004)."},{"key":"e_1_3_2_1_28_1","unstructured":"Xuan\u00a0Nhat Lam Thuc Vu Trong\u00a0Duc Le and Anh\u00a0Duc Duong. 2008. Addressing cold-start problem in recommendation systems. In IMCOM.  Xuan\u00a0Nhat Lam Thuc Vu Trong\u00a0Duc Le and Anh\u00a0Duc Duong. 2008. Addressing cold-start problem in recommendation systems. In IMCOM."},{"key":"e_1_3_2_1_29_1","volume-title":"LARS: A Location-Aware Recommender System. In ICDE.","author":"Levandoski J.","year":"2012","unstructured":"J.\u00a0 J. Levandoski , M. Sarwat , A. Eldawy , and M.\u00a0 F. Mokbel . 2012 . LARS: A Location-Aware Recommender System. In ICDE. J.\u00a0J. Levandoski, M. Sarwat, A. Eldawy, and M.\u00a0F. Mokbel. 2012. LARS: A Location-Aware Recommender System. In ICDE."},{"key":"e_1_3_2_1_30_1","unstructured":"Ninghui Li Tiancheng Li and Suresh Venkatasubramanian. 2007. t-closeness: Privacy beyond k-anonymity and l-diversity. In ICDE.  Ninghui Li Tiancheng Li and Suresh Venkatasubramanian. 2007. t-closeness: Privacy beyond k-anonymity and l-diversity. In ICDE."},{"key":"e_1_3_2_1_31_1","volume-title":"Theory and applications of b-bit minwise hashing. CACM","author":"Li Ping","year":"2011","unstructured":"Ping Li and Arnd\u00a0Christian K\u00f6nig . 2011. Theory and applications of b-bit minwise hashing. CACM ( 2011 ). Ping Li and Arnd\u00a0Christian K\u00f6nig. 2011. Theory and applications of b-bit minwise hashing. CACM (2011)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Greg Linden Brent Smith and Jeremy York. 2003. Amazon. com recommendations: Item-to-item collaborative filtering. Internet Comp. (2003).  Greg Linden Brent Smith and Jeremy York. 2003. Amazon. com recommendations: Item-to-item collaborative filtering. Internet Comp. (2003).","DOI":"10.1109\/MIC.2003.1167344"},{"key":"e_1_3_2_1_33_1","unstructured":"Ting Liu Andrew\u00a0W Moore Ke Yang and Alexander\u00a0G Gray. 2004. An investigation of practical approximate nearest neighbor algorithms. In Advances in neural information processing systems.  Ting Liu Andrew\u00a0W Moore Ke Yang and Alexander\u00a0G Gray. 2004. An investigation of practical approximate nearest neighbor algorithms. In Advances in neural information processing systems."},{"key":"#cr-split#-e_1_3_2_1_34_1.1","doi-asserted-by":"crossref","unstructured":"A. Machanavajjhala J. Gehrke D. Kifer and M. Venkitasubramaniam. 2006. L-diversity: privacy beyond k-anonymity. In ICDE. https:\/\/doi.org\/10.1109\/ICDE.2006.1 10.1109\/ICDE.2006.1","DOI":"10.1109\/ICDE.2006.1"},{"key":"#cr-split#-e_1_3_2_1_34_1.2","doi-asserted-by":"crossref","unstructured":"A. Machanavajjhala J. Gehrke D. Kifer and M. Venkitasubramaniam. 2006. L-diversity: privacy beyond k-anonymity. In ICDE. https:\/\/doi.org\/10.1109\/ICDE.2006.1","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Ashwin Machanavajjhala Johannes Gehrke Daniel Kifer and Muthuramakrishnan Venkitasubramaniam. 2006. l-diversity: Privacy beyond k-anonymity. In ICDE.  Ashwin Machanavajjhala Johannes Gehrke Daniel Kifer and Muthuramakrishnan Venkitasubramaniam. 2006. l-diversity: Privacy beyond k-anonymity. In ICDE.","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Julian\u00a0John McAuley and Jure Leskovec. 2013. From amateurs to connoisseurs: modeling the evolution of user expertise through online reviews. In WWW.  Julian\u00a0John McAuley and Jure Leskovec. 2013. From amateurs to connoisseurs: modeling the evolution of user expertise through online reviews. In WWW.","DOI":"10.1145\/2488388.2488466"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Frank McSherry and Ilya Mironov. 2009. Differentially private recommender systems: building privacy into the net. In KDD.  Frank McSherry and Ilya Mironov. 2009. Differentially private recommender systems: building privacy into the net. In KDD.","DOI":"10.1145\/1557019.1557090"},{"key":"e_1_3_2_1_38_1","unstructured":"Andrew\u00a0W Moore. 2000. The anchors hierarchy: Using the triangle inequality to survive high dimensional data. In UAI.  Andrew\u00a0W Moore. 2000. The anchors hierarchy: Using the triangle inequality to survive high dimensional data. In UAI."},{"key":"e_1_3_2_1_39_1","unstructured":"N. Nodarakis S. Sioutas D. Tsoumakos G. Tzimas and E. Pitoura. 2014. Rapid AkNN Query Processing for Fast Classification of Multidimensional Data in the Cloud. CoRR abs\/1402.7063(2014).  N. Nodarakis S. Sioutas D. Tsoumakos G. Tzimas and E. Pitoura. 2014. Rapid AkNN Query Processing for Fast Classification of Multidimensional Data in the Cloud. CoRR abs\/1402.7063(2014)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Paul Resnick Neophytos Iacovou Mitesh Suchak Peter Bergstrom and John Riedl. 1994. GroupLens: an open architecture for collaborative filtering of netnews. In CSCW.  Paul Resnick Neophytos Iacovou Mitesh Suchak Peter Bergstrom and John Riedl. 1994. GroupLens: an open architecture for collaborative filtering of netnews. In CSCW.","DOI":"10.1145\/192844.192905"},{"key":"e_1_3_2_1_41_1","unstructured":"Pratanu Roy Arijit Khan and Gustavo Alonso. 2016. Augmented sketch: Faster and more accurate stream processing. In SIGMOD.  Pratanu Roy Arijit Khan and Gustavo Alonso. 2016. Augmented sketch: Faster and more accurate stream processing. In SIGMOD."},{"key":"e_1_3_2_1_42_1","volume-title":"Protecting respondents identities in microdata release","author":"Samarati Pierangela","year":"2001","unstructured":"Pierangela Samarati . 2001. Protecting respondents identities in microdata release . IEEE Trans. on Knowledge and Data Eng .( 2001 ). Pierangela Samarati. 2001. Protecting respondents identities in microdata release. IEEE Trans. on Knowledge and Data Eng.(2001)."},{"key":"e_1_3_2_1_43_1","volume-title":"International J. of Uncertainty, Fuzziness and Knowledge-Based Sys.","author":"Sweeney Latanya","year":"2002","unstructured":"Latanya Sweeney . 2002. k-anonymity: A model for protecting privacy . International J. of Uncertainty, Fuzziness and Knowledge-Based Sys. ( 2002 ). Latanya Sweeney. 2002. k-anonymity: A model for protecting privacy. International J. of Uncertainty, Fuzziness and Knowledge-Based Sys. (2002)."},{"key":"e_1_3_2_1_44_1","unstructured":"C.\u00a0J. van Rijsbergen. 1979. Information retrieval. Butterworth.  C.\u00a0J. van Rijsbergen. 1979. Information retrieval. Butterworth."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Khuong Vu Rong Zheng and Jie Gao. 2012. Efficient algorithms for k-anonymous location privacy in participatory sensing. In INFOCOM.  Khuong Vu Rong Zheng and Jie Gao. 2012. Efficient algorithms for k-anonymous location privacy in participatory sensing. In INFOCOM.","DOI":"10.1109\/INFCOM.2012.6195629"},{"key":"e_1_3_2_1_46_1","unstructured":"Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities based on Ground-truth. CoRR abs\/1205.6233(2012). http:\/\/arxiv.org\/abs\/1205.6233  Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities based on Ground-truth. CoRR abs\/1205.6233(2012). http:\/\/arxiv.org\/abs\/1205.6233"}],"event":{"name":"WWW '20: The Web Conference 2020","location":"Taipei Taiwan","acronym":"WWW '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of The Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380184","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:00Z","timestamp":1750199580000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":49,"alternative-id":["10.1145\/3366423.3380184","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380184","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}