{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T19:56:32Z","timestamp":1773258992609,"version":"3.50.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T00:00:00Z","timestamp":1677542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF China","award":["42050105, 62020106005, 62061146002, and 61960206002"],"award-info":[{"award-number":["42050105, 62020106005, 62061146002, and 61960206002"]}]},{"name":"100-Talents Program of Xinhua News Agency, and the Program of Shanghai Academic\/Technology Research Leader","award":["18XD1401800"],"award-info":[{"award-number":["18XD1401800"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2023,2,28]]},"abstract":"<jats:p>\n            The popularity of intelligent devices provides straightforward access to the Internet and online social networks. However, the quick and easy data updates from networks also benefit the risk spreading, such as rumor, malware, or computer viruses. To this end, this article studies the problem of source detection, which is to infer the source node out of an aftermath of a cascade, that is, the observed infected graph\n            <jats:italic>\n              G\n              <jats:sub>N<\/jats:sub>\n            <\/jats:italic>\n            of the network at some time. Prior arts have adopted various statistical quantities such as degree, distance, or infection size to reflect the structural centrality of the source. In this article, we propose a new metric that we call the infected tree entropy (ITE), to utilize richer underlying structural features for source detection. Our idea of ITE is inspired by the conception of structural entropy\u00a0[\n            <jats:xref ref-type=\"bibr\">21<\/jats:xref>\n            ], which demonstrated that the minimization of average bits to encode the network structures with different partitions is the principle for detecting the natural or true structures in real-world networks. Accordingly, our proposed ITE based estimator for the source tries to minimize the coding of network partitions brought by the infected tree rooted at all the potential sources, thus minimizing the structural deviation between the cascades from the potential sources and the actual infection process included in\n            <jats:italic>\n              G\n              <jats:sub>N<\/jats:sub>\n            <\/jats:italic>\n            . On polynomially growing geometric trees, with increasing tree heterogeneity, the ITE estimator remarkably yields more reliable detection under only moderate infection sizes, and returns an asymptotically complete detection. In contrast, for regular expanding trees, we still observe guaranteed detection probability of ITE estimator even with an infinite infection size, thanks to the degree regularity property. We also algorithmically realize the ITE based detection that enjoys linear time complexity via a message-passing scheme, and further extend it to general graphs. Extensive experiments on synthetic and real datasets confirm the superiority of ITE to the baselines. For example, ITE returns an accuracy of 85%, ranking the source among the top 10%, far exceeding 55% of the classic algorithm on scale-free networks.\n          <\/jats:p>","DOI":"10.1145\/3568309","type":"journal-article","created":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T09:50:13Z","timestamp":1675677013000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Finding the Source in Networks: An Approach Based on Structural Entropy"],"prefix":"10.1145","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9763-3351","authenticated-orcid":false,"given":"Chong","family":"Zhang","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6548-3152","authenticated-orcid":false,"given":"Qiang","family":"Guo","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7796-9168","authenticated-orcid":false,"given":"Luoyi","family":"Fu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0009-9237","authenticated-orcid":false,"given":"Jiaxin","family":"Ding","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2315-4219","authenticated-orcid":false,"given":"Xinde","family":"Cao","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4121-4163","authenticated-orcid":false,"given":"Fei","family":"Long","sequence":"additional","affiliation":[{"name":"Xinhua News Agency, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0357-8356","authenticated-orcid":false,"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3331-2302","authenticated-orcid":false,"given":"Chenghu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2023,3,27]]},"reference":[{"key":"e_1_3_1_2_2","first-page":"429","volume-title":"Proceeding of the Wavelets and Sparsity XV","volume":"8858","author":"Agaskar Ameya","year":"2013","unstructured":"Ameya Agaskar and Yue M. Lu. 2013. A fast Monte Carlo algorithm for source localization on graphs. In Proceeding of the Wavelets and Sparsity XV, Vol. 8858, 429\u2013434."},{"issue":"4","key":"e_1_3_1_3_2","doi-asserted-by":"crossref","first-page":"045102","DOI":"10.1103\/PhysRevE.80.045102","article-title":"Entropy measures for networks: Toward an information theory of complex topologies","volume":"80","author":"Anand Kartik","year":"2009","unstructured":"Kartik Anand and Ginestra Bianconi. 2009. Entropy measures for networks: Toward an information theory of complex topologies. Physical Review E 80, 4 (2009), 045102.","journal-title":"Physical Review E"},{"issue":"5439","key":"e_1_3_1_4_2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509\u2013512.","journal-title":"Science"},{"issue":"3","key":"e_1_3_1_5_2","doi-asserted-by":"crossref","first-page":"036114","DOI":"10.1103\/PhysRevE.79.036114","article-title":"Entropy of network ensembles","volume":"79","author":"Bianconi Ginestra","year":"2009","unstructured":"Ginestra Bianconi. 2009. Entropy of network ensembles. Physical Review E 79, 3 (2009), 036114.","journal-title":"Physical Review E"},{"issue":"10","key":"e_1_3_1_6_2","doi-asserted-by":"crossref","first-page":"4517","DOI":"10.1063\/1.434593","article-title":"Information theory, distance matrix, and molecular branching","volume":"67","author":"Bonchev D.","year":"1977","unstructured":"D. Bonchev and N. Trinajsti\u0107. 1977. Information theory, distance matrix, and molecular branching. The Journal of Chemical Physics 67, 10 (1977), 4517\u20134533.","journal-title":"The Journal of Chemical Physics"},{"issue":"3","key":"e_1_3_1_7_2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00026-006-0289-3","article-title":"The Laplacian of a graph as a density matrix: A basic combinatorial approach to separability of mixed states","volume":"10","author":"Braunstein Samuel L.","year":"2006","unstructured":"Samuel L. Braunstein, Sibasish Ghosh, and Simone Severini. 2006. The Laplacian of a graph as a density matrix: A basic combinatorial approach to separability of mixed states. Annals of Combinatorics 10, 3 (2006), 291\u2013317.","journal-title":"Annals of Combinatorics"},{"key":"e_1_3_1_8_2","doi-asserted-by":"crossref","first-page":"2621","DOI":"10.1109\/TIFS.2021.3050604","article-title":"Information sources estimation in time-varying networks","volume":"16","author":"Chai Yun","year":"2021","unstructured":"Yun Chai, Youguo Wang, and Liang Zhu. 2021. Information sources estimation in time-varying networks. IEEE Transactions on Information Forensics and Security 16 (2021), 2621\u20132636.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"e_1_3_1_9_2","first-page":"1","volume-title":"Proceedings of the IEEE INFOCOM","author":"Choi Jaeyoung","year":"2017","unstructured":"Jaeyoung Choi, Sangwoo Moon, Jiin Woo, Kyunghwan Son, Jinwoo Shin, and Yung Yi. 2017. Rumor source detection under querying with untruthful answers. In Proceedings of the IEEE INFOCOM. 1\u20139."},{"key":"e_1_3_1_10_2","first-page":"2261","volume-title":"Proceedings of the IEEE ISIT","author":"Choi Jaeyoung","year":"2018","unstructured":"Jaeyoung Choi and Yung Yi. 2018. Necessary and sufficient budgets in information source finding with querying: Adaptivity gap. In Proceedings of the IEEE ISIT. 2261\u20132265."},{"key":"e_1_3_1_11_2","first-page":"364","volume-title":"Proceedings of the IEEE ISIT","author":"Choi Yongwook","year":"2009","unstructured":"Yongwook Choi and Wojciech Szpankowski. 2009. Compression of graphical structures. In Proceedings of the IEEE ISIT. 364\u2013368."},{"issue":"5","key":"e_1_3_1_12_2","doi-asserted-by":"crossref","first-page":"056105","DOI":"10.1103\/PhysRevE.84.056105","article-title":"Identifying the starting point of a spreading process in complex networks","volume":"84","author":"Comin Cesar Henrique","year":"2011","unstructured":"Cesar Henrique Comin and Luciano da Fontoura Costa. 2011. Identifying the starting point of a spreading process in complex networks. Physical Review E 84, 5 (2011), 056105.","journal-title":"Physical Review E"},{"issue":"1","key":"e_1_3_1_13_2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.amc.2007.12.010","article-title":"Information processing in complex networks: Graph entropy and information functionals","volume":"201","author":"Dehmer Matthias","year":"2008","unstructured":"Matthias Dehmer. 2008. Information processing in complex networks: Graph entropy and information functionals. Applied Mathematics and Computation 201, 1-2 (2008), 82\u201394.","journal-title":"Applied Mathematics and Computation"},{"key":"e_1_3_1_14_2","first-page":"2671","volume-title":"Proceedings of the IEEE ISIT","author":"Dong Wenxiang","year":"2013","unstructured":"Wenxiang Dong, Wenyi Zhang, and Chee Wei Tan. 2013. Rooting out the rumor culprit from suspects. In Proceedings of the IEEE ISIT. 2671\u20132675."},{"key":"e_1_3_1_15_2","article-title":"Predicting the sources of an outbreak with a spectral technique","author":"Fioriti Vincenzo","year":"2012","unstructured":"Vincenzo Fioriti and Marta Chinnici. 2012. Predicting the sources of an outbreak with a spectral technique. arXiv:1211.2333.","journal-title":"arXiv:1211.2333"},{"issue":"3","key":"e_1_3_1_16_2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1011122126881","article-title":"Talk of the network: A complex systems look at the underlying process of word-of-mouth","volume":"12","author":"Goldenberg Jacob","year":"2001","unstructured":"Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12, 3 (2001), 211\u2013223.","journal-title":"Marketing Letters"},{"issue":"12","key":"e_1_3_1_17_2","doi-asserted-by":"crossref","first-page":"2616","DOI":"10.1109\/TIFS.2015.2469256","article-title":"K-center: An approach on the multi-source identification of information diffusion","volume":"10","author":"Jiang Jiaojiao","year":"2015","unstructured":"Jiaojiao Jiang, Sheng Wen, Shui Yu, Yang Xiang, and Wanlei Zhou. 2015. K-center: An approach on the multi-source identification of information diffusion. IEEE Transactions on Information Forensics and Security 10, 12 (2015), 2616\u20132626.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"e_1_3_1_18_2","first-page":"2184","volume-title":"Proceedings of the IEEE ISIT","author":"Karamchandani Nikhil","year":"2013","unstructured":"Nikhil Karamchandani and Massimo Franceschetti. 2013. Rumor source detection under probabilistic sampling. In Proceedings of the IEEE ISIT. 2184\u20132188."},{"key":"e_1_3_1_19_2","first-page":"1343","volume-title":"Proceedings of the WWW","author":"Kunegis J\u00e9r\u00f4me","year":"2013","unstructured":"J\u00e9r\u00f4me Kunegis. 2013. Konect: The koblenz network collection. In Proceedings of the WWW. 1343\u20131350."},{"key":"e_1_3_1_20_2","first-page":"1059","volume-title":"Proceedings of the ACM SIGKDD","author":"Lappas Theodoros","year":"2010","unstructured":"Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopulos, and Heikki Mannila. 2010. Finding effectors in social networks. In Proceedings of the ACM SIGKDD. 1059\u20131068."},{"key":"e_1_3_1_21_2","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection . (June 2014). Retrieved May 10 2021 from http:\/\/snap.stanford.edu\/data."},{"issue":"6","key":"e_1_3_1_22_2","doi-asserted-by":"crossref","first-page":"3290","DOI":"10.1109\/TIT.2016.2555904","article-title":"Structural information and dynamical complexity of networks","volume":"62","author":"Li Angsheng","year":"2016","unstructured":"Angsheng Li and Yicheng Pan. 2016. Structural information and dynamical complexity of networks. IEEE Transactions on Information Theory 62, 6 (2016), 3290\u20133339.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_3_1_23_2","first-page":"12938","volume-title":"Advances in Neural Information Processing Systems","author":"Liu Yiwei","year":"2019","unstructured":"Yiwei Liu, Jiamou Liu, Zijian Zhang, Liehuang Zhu, and Angsheng Li. 2019. REM: From structural entropy to community structure deception. In Advances in Neural Information Processing Systems. 12938\u201312948."},{"issue":"1","key":"e_1_3_1_24_2","doi-asserted-by":"crossref","first-page":"012801","DOI":"10.1103\/PhysRevE.90.012801","article-title":"Inferring the origin of an epidemic with a dynamic message-passing algorithm","volume":"90","author":"Lokhov Andrey Y.","year":"2014","unstructured":"Andrey Y. Lokhov, Marc M\u00e9zard, Hiroki Ohta, and Lenka Zdeborov\u00e1. 2014. Inferring the origin of an epidemic with a dynamic message-passing algorithm. Physical Review E 90, 1 (2014), 012801.","journal-title":"Physical Review E"},{"key":"e_1_3_1_25_2","first-page":"301","volume-title":"Proceedings of the IEEE GlobalSIP","author":"Luo Wuqiong","year":"2013","unstructured":"Wuqiong Luo and Wee Peng Tay. 2013. Estimating infection sources in a network with incomplete observations. In Proceedings of the IEEE GlobalSIP. 301\u2013304."},{"key":"e_1_3_1_26_2","first-page":"2930","volume-title":"Proceedings of the IEEE ICASSP","author":"Luo Wuqiong","year":"2013","unstructured":"Wuqiong Luo and Wee Peng Tay. 2013. Finding an infection source under the SIS model. In Proceedings of the IEEE ICASSP. 2930\u20132934."},{"issue":"11","key":"e_1_3_1_27_2","doi-asserted-by":"crossref","first-page":"2850","DOI":"10.1109\/TSP.2013.2256902","article-title":"Identifying infection sources and regions in large networks","volume":"61","author":"Luo Wuqiong","year":"2013","unstructured":"Wuqiong Luo, Wee Peng Tay, and Mei Leng. 2013. Identifying infection sources and regions in large networks. IEEE Transactions on Signal Processing 61, 11 (2013), 2850\u20132865.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"6","key":"e_1_3_1_28_2","doi-asserted-by":"crossref","first-page":"068702","DOI":"10.1103\/PhysRevLett.109.068702","article-title":"Locating the source of diffusion in large-scale networks","volume":"109","author":"Pinto Pedro C.","year":"2012","unstructured":"Pedro C. Pinto, Patrick Thiran, and Martin Vetterli. 2012. Locating the source of diffusion in large-scale networks. Physical Review Letters 109, 6 (2012), 068702.","journal-title":"Physical Review Letters"},{"key":"e_1_3_1_29_2","first-page":"11","volume-title":"Proceedings of the ICDM","author":"Prakash B. Aditya","year":"2012","unstructured":"B. Aditya Prakash, Jilles Vreeken, and Christos Faloutsos. 2012. Spotting culprits in epidemics: How many and which ones?. In Proceedings of the ICDM. 11\u201320."},{"issue":"3","key":"e_1_3_1_30_2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02477860","article-title":"Life, information theory, and topology","volume":"17","author":"Rashevsky Nicolas","year":"1955","unstructured":"Nicolas Rashevsky. 1955. Life, information theory, and topology. Bulletin of Mathematical Biophysics 17, 3 (1955), 229\u2013235.","journal-title":"Bulletin of Mathematical Biophysics"},{"issue":"6","key":"e_1_3_1_31_2","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1002\/jcc.540050612","article-title":"Discrimination of isomeric structures using information theoretic topological indices","volume":"5","author":"Raychaudhury C.","year":"1984","unstructured":"C. Raychaudhury, S. K. Ray, J. J. Ghosh, A. B. Roy, and S. C. Basak. 1984. Discrimination of isomeric structures using information theoretic topological indices. Journal of Computational Chemistry 5, 6 (1984), 581\u2013588.","journal-title":"Journal of Computational Chemistry"},{"issue":"4","key":"e_1_3_1_32_2","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","author":"Rosvall Martin","year":"2008","unstructured":"Martin Rosvall and Carl T. Bergstrom. 2008. Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences of the United States of America 105, 4 (2008), 1118\u20131123.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"8","key":"e_1_3_1_33_2","doi-asserted-by":"crossref","first-page":"5163","DOI":"10.1109\/TIT.2011.2158885","article-title":"Rumors in a network: Who\u2019s the culprit?","volume":"57","author":"Shah Devavrat","year":"2011","unstructured":"Devavrat Shah and Tauhid Zaman. 2011. Rumors in a network: Who\u2019s the culprit? IEEE Transactions on Information Theory 57, 8 (2011), 5163\u20135181.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"e_1_3_1_34_2","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/opre.2015.1455","article-title":"Finding rumor sources on random trees","volume":"64","author":"Shah Devavrat","year":"2016","unstructured":"Devavrat Shah and Tauhid Zaman. 2016. Finding rumor sources on random trees. Operations Research 64, 3 (2016), 736\u2013755.","journal-title":"Operations Research"},{"issue":"3","key":"e_1_3_1_35_2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon Claude E.","year":"1948","unstructured":"Claude E. Shannon. 1948. A mathematical theory of communication. The Bell System Technical Journal 27, 3 (1948), 379\u2013423.","journal-title":"The Bell System Technical Journal"},{"issue":"12","key":"e_1_3_1_36_2","doi-asserted-by":"crossref","first-page":"3035","DOI":"10.1109\/TIFS.2018.2837655","article-title":"Estimating infection sources in networks using partial timestamps","volume":"13","author":"Tang Wenchang","year":"2018","unstructured":"Wenchang Tang, Feng Ji, and Wee Peng Tay. 2018. Estimating infection sources in networks using partial timestamps. IEEE Transactions on Information Forensics and Security 13, 12 (2018), 3035\u20133049.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"e_1_3_1_37_2","volume-title":"Proceedings of the ACM SIGMETRICS","author":"Wang Zhaoxu","year":"2014","unstructured":"Zhaoxu Wang, Wenxiang Dong, Wenyi Zhang, and Chee Wei Tan. 2014. Rumor source detection with multiple observations: Fundamental limits and algorithms. In Proceedings of the ACM SIGMETRICS."},{"issue":"6684","key":"e_1_3_1_38_2","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u201csmall-world\u201d networks","volume":"393","author":"Watts Duncan J.","year":"1998","unstructured":"Duncan J. Watts and Steven H. Strogatz. 1998. Collective dynamics of \u201csmall-world\u201d networks. Nature 393, 6684 (1998), 440\u2013442.","journal-title":"Nature"},{"key":"e_1_3_1_39_2","first-page":"175","volume-title":"Proceedings of the IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","author":"Yu Pei-Duo","year":"2018","unstructured":"Pei-Duo Yu, Chee Wei Tan, and Hung-Lin Fu. 2018. Rumor source detection in finite graphs with boundary effects by message-passing algorithms. In Proceedings of the IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining. 175\u2013192."},{"issue":"5","key":"e_1_3_1_40_2","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1007\/s10618-015-0435-9","article-title":"Locating the contagion source in networks with partial timestamps","volume":"30","author":"Zhu Kai","year":"2016","unstructured":"Kai Zhu, Zhen Chen, and Lei Ying. 2016. Locating the contagion source in networks with partial timestamps. Data Mining and Knowledge Discovery 30, 5 (2016), 1217\u20131248.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"e_1_3_1_41_2","first-page":"408","article-title":"Information source detection in the SIR model: A sample-path-based approach","volume":"24","author":"Zhu Kai","year":"2014","unstructured":"Kai Zhu and Lei Ying. 2014. Information source detection in the SIR model: A sample-path-based approach. IEEE\/ACM Transactions on Networking 24, 1 (2014), 408\u2013421.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"e_1_3_1_42_2","article-title":"Source localization in networks: Trees and beyond","author":"Zhu Kai","year":"2015","unstructured":"Kai Zhu and Lei Ying. 2015. Source localization in networks: Trees and beyond. arXiv:1510.01814.","journal-title":"arXiv:1510.01814"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3568309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3568309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:33Z","timestamp":1750182693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3568309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,28]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2,28]]}},"alternative-id":["10.1145\/3568309"],"URL":"https:\/\/doi.org\/10.1145\/3568309","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,28]]},"assertion":[{"value":"2021-09-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-09","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}