{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:37:11Z","timestamp":1774553831359,"version":"3.50.1"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:00:00Z","timestamp":1744156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62002350, 62325205, 62172204"],"award-info":[{"award-number":["62002350, 62325205, 62172204"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004739","name":"Youth Innovation Promotion Association CAS","doi-asserted-by":"crossref","award":["2023120"],"award-info":[{"award-number":["2023120"]}],"id":[{"id":"10.13039\/501100004739","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Program of Natural Science Foundation of Jiangsu","award":["BK20243053"],"award-info":[{"award-number":["BK20243053"]}]},{"name":"National Key Research and Development Plan of China","award":["2023YFB4502305"],"award-info":[{"award-number":["2023YFB4502305"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2025,4,30]]},"abstract":"<jats:p>\n            The\n            <jats:italic>k<\/jats:italic>\n            -core model has garnered widespread adoption for preserving essential cohesive subgraphs owing to its linear-time computability, making it particularly suitable for hypergraph analysis. However, considering the continuously evolving characteristics of real-world hypergraphs, recent research efforts have focused on developing efficient algorithms that can maintain the core value of each vertex amid structural alterations. Despite these efforts, frequent insertions and deletions in dynamic hypergraphs continue to pose significant inefficiencies, primarily due to the increased traversal overhead incurred by hyperedge insertion algorithms. This exacerbates performance disparities between handling hyperedge insertions and deletions, underscoring the persistent challenge of effective\n            <jats:italic>k<\/jats:italic>\n            -core analysis in hypergraphs.\n          <\/jats:p>\n          <jats:p>\n            To effectively address these challenges, we have gained key insights that enable us to define a specific order, termed the hypergraph\n            <jats:italic>k<\/jats:italic>\n            -order, which significantly reduces redundant vertex traversal and narrows down the search space during hyperedge insertions. Based on the proposed hypergraph\n            <jats:italic>k<\/jats:italic>\n            -order, we define two indices, the order index and the pivotal index, aimed at minimizing traversal costs and expediting the hyperedge insertion algorithm. Moreover, it is essential to recognize that the recomputation of the support degree (\n            <jats:italic>sd<\/jats:italic>\n            ) for all vertices following each hyperedge deletion can significantly diminish the performance efficiency of deletion algorithms. To address this, we introduce an optimized approach that leverages the incremental maintenance of the support degree (\n            <jats:italic>sd<\/jats:italic>\n            ) value to expedite the hyperedge deletion process. By leveraging these optimizations, we introduce a novel Order-based Traversal core Maintenance methodology, designated as\n            <jats:italic>OTM<\/jats:italic>\n            , which markedly enhances the efficiency of core maintenance in dynamic hypergraphs. Our comprehensive evaluation, which covers 12 real-world hypergraph datasets and a synthetic dataset, reveals that\n            <jats:italic>OTM<\/jats:italic>\n            achieves staggering speedup, outperforming the state-of-the-art approach with a\n            <jats:italic>41,420<\/jats:italic>\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(\\times\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            speedup in the insertion algorithm and\n            <jats:italic>8,284<\/jats:italic>\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(\\times\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            speedup in the deletion algorithm, underscoring its remarkable efficiency and effectiveness.\n          <\/jats:p>","DOI":"10.1145\/3719205","type":"journal-article","created":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T16:03:51Z","timestamp":1740413031000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["<i>OTM<\/i>\n            : Efficient\n            <i>k<\/i>\n            -Order-Based Core Maintenance in Large-Scale Dynamic Hypergraphs"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8742-0996","authenticated-orcid":false,"given":"Xiangfei","family":"Fang","sequence":"first","affiliation":[{"name":"Institute of Software Chinese Academy of Sciences, Beijing, China and University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3154-3580","authenticated-orcid":false,"given":"Chengying","family":"Huan","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6597-6520","authenticated-orcid":false,"given":"Heng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Software Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3440-9675","authenticated-orcid":false,"given":"Yongchao","family":"Liu","sequence":"additional","affiliation":[{"name":"Ant Group CO Ltd, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5718-5657","authenticated-orcid":false,"given":"Shaonan","family":"Ma","sequence":"additional","affiliation":[{"name":"9#AISoft, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1823-0459","authenticated-orcid":false,"given":"Yanjun","family":"Wu","sequence":"additional","affiliation":[{"name":"Institute of Software Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3386-0335","authenticated-orcid":false,"given":"Chen","family":"Zhao","sequence":"additional","affiliation":[{"name":"Institute of Software Chinese Academy of Sciences, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,4,9]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297918"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0422-1"},{"key":"e_1_3_3_4_2","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) algorithm for cores decomposition of networks. arXiv:cs\/0310049. Retrieved from https:\/\/arxiv.org\/abs\/cs\/0310049"},{"key":"e_1_3_3_5_2","first-page":"152","volume-title":"European Symposium on Algorithms","author":"Bender Michael A.","year":"2002","unstructured":"Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, and Jack Zito. 2002. Two simplified algorithms for maintaining order in a list. In European Symposium on Algorithms. Springer, 152\u2013164."},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0"},{"issue":"1","key":"e_1_3_3_7_2","first-page":"61","article-title":"Social network analysis with content and graphs","volume":"20","author":"Campbell William M.","year":"2013","unstructured":"William M. Campbell, Charlie K. Dagli, and Clifford J. Weinstein. 2013. Social network analysis with content and graphs. Lincoln Laboratory Journal 20, 1 (2013), 61\u201381.","journal-title":"Lincoln Laboratory Journal"},{"key":"e_1_3_3_8_2","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/BigData.2014.7004264","volume-title":"2014 IEEE International Conference on Big Data (Big Data)","author":"Chen Pei-Ling","year":"2014","unstructured":"Pei-Ling Chen, Chung-Kuang Chou, and Ming-Syan Chen. 2014. Distributed algorithms for k-truss decomposition. In 2014 IEEE International Conference on Big Data (Big Data). IEEE, 471\u2013480."},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004366"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2023.101921"},{"key":"e_1_3_3_12_2","first-page":"293","volume-title":"29th ACM Symposium on Parallelism in Algorithms and Architectures","author":"Dhulipala Laxman","year":"2017","unstructured":"Laxman Dhulipala, Guy Blelloch, and Julian Shun. 2017. Julienne: A framework for parallel graph algorithms using work-efficient bucketing. In 29th ACM Symposium on Parallelism in Algorithms and Architectures, 293\u2013304."},{"key":"e_1_3_3_13_2","first-page":"365","volume-title":"19th Annual ACM Symposium on Theory of Computing","author":"Dietz Paul","year":"1987","unstructured":"Paul Dietz and Daniel Sleator. 1987. Two algorithms for maintaining order in a list. In 19th Annual ACM Symposium on Theory of Computing, 365\u2013372."},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1109\/IPDPSW52791.2021.00158","volume-title":"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","author":"Gabert Kasimir","year":"2021","unstructured":"Kasimir Gabert, Ali Pinar, and \u00dcmit V. \u00c7ataly\u00fcrek. 2021. Shared-memory scalable k-core maintenance on dynamic graphs and hypergraphs. In 2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 998\u20131007."},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441790"},{"key":"e_1_3_3_16_2","first-page":"413","volume-title":"37th ACM\/SIGAPP Symposium on Applied Computing","author":"Gao Shicheng","unstructured":"Shicheng Gao, Jie Xu, Xiaosen Li, Fangcheng Fu, Wentao Zhang, Wen Ouyang, Yangyu Tao, and Bin Cui. 2022. K-core decomposition on super large graphs with limited resources. In 37th ACM\/SIGAPP Symposium on Applied Computing, 413\u2013422."},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3605573.3605597"},{"key":"e_1_3_3_18_2","first-page":"1","volume-title":"2024 International Symposium on Parallel Computing and Distributed Systems (PCDS)","author":"Guo Bin","year":"2024","unstructured":"Bin Guo and Emil Sekerinski. 2024. New parallel order maintenance data structure. In 2024 International Symposium on Parallel Computing and Distributed Systems (PCDS). IEEE, 1\u20135."},{"issue":"13","key":"e_1_3_3_19_2","first-page":"1","article-title":"Simplified algorithms for order-based core maintenance","volume":"80","author":"Guo Bin","year":"2024","unstructured":"Bin Guo and Emil Sekerinski. 2024. Simplified algorithms for order-based core maintenance. The Journal of Supercomputing 80, 13 (2024), 1\u201332.","journal-title":"The Journal of Supercomputing"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2960226"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2023.3236669"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2835441"},{"key":"e_1_3_3_24_2","first-page":"3259","article-title":"Heterogeneous graph convolutional network for E-commerce product recommendation with adaptive denoising training","author":"Jin Sichen","year":"2023","unstructured":"Sichen Jin, Yijia Zhang, Xingwang Li, and Mingyu Lu. 2023. Heterogeneous graph convolutional network for E-commerce product recommendation with adaptive denoising training. IEEE Transactions on Consumer Electronics 70, 1 (2023), 3259\u20133268.","journal-title":"IEEE Transactions on Consumer Electronics"},{"key":"e_1_3_3_25_2","doi-asserted-by":"crossref","first-page":"1482","DOI":"10.1109\/IPDPSW.2017.151","volume-title":"2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","author":"Kabir Humayun","year":"2017","unstructured":"Humayun Kabir and Kamesh Madduri. 2017. Parallel k-core decomposition on multicore platforms. In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 1482\u20131491."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2019.10.004"},{"issue":"11","key":"e_1_3_3_27_2","first-page":"2568","article-title":"An O(m) algorithm for cores decomposition of undirected hypergraph","volume":"34","author":"Leng Ming","year":"2013","unstructured":"Ming Leng, Lingyu Sun, Ji-Nian Bian, and Yuchun Ma. 2013. An O(m) algorithm for cores decomposition of undirected hypergraph. Journal of Chinese Computer Systems 34, 11 (2013), 2568\u20132573.","journal-title":"Journal of Chinese Computer Systems"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.14778\/3446095.3446099"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00723-z"},{"key":"e_1_3_3_31_2","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1109\/ICDE51399.2021.00199","volume-title":"2021 IEEE 37th International Conference on Data Engineering (ICDE)","author":"Luo Qi","year":"2021","unstructured":"Qi Luo, Dongxiao Yu, Zhipeng Cai, Xuemin Lin, and Xiuzhen Cheng. 2021. Hypercore maintenance in dynamic hypergraphs. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 2051\u20132056."},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00763-z"},{"key":"e_1_3_3_33_2","doi-asserted-by":"crossref","unstructured":"Qi Luo Dongxiao Yu Zhipeng Cai Yanwei Zheng Xiuzhen Cheng and Xuemin Lin. 2023. Core maintenance for hypergraph streams. World Wide Web 36 5 (2023) 1\u201325.","DOI":"10.1007\/s11280-023-01196-6"},{"issue":"5","key":"e_1_3_3_34_2","doi-asserted-by":"crossref","first-page":"2140008","DOI":"10.1142\/S021759592140008X","article-title":"Distributed core decomposition in probabilistic graphs","volume":"38","author":"Luo Qi","year":"2021","unstructured":"Qi Luo, Dongxiao Yu, Feng Li, Xiuzheng Cheng, Zhipeng Cai, and Jiguo Yu. 2021. Distributed core decomposition in probabilistic graphs. Asia-Pacific Journal of Operational Research 38, 5 (2021), 2140008.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2022.9010050"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00139635"},{"issue":"2","key":"e_1_3_3_37_2","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/TNNLS.2021.3104901","article-title":"Learning graph representations with maximal cliques","volume":"34","author":"Molaei Soheila","year":"2021","unstructured":"Soheila Molaei, Nima Ghanbari Bousejin, Hadi Zare, Mahdi Jalili, and Shirui Pan. 2021. Learning graph representations with maximal cliques. IEEE Transactions on Neural Networks and Learning Systems 34, 2 (2021), 1089\u20131096.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-54464-4_15"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0423-8"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/IACC.2017.0189"},{"key":"e_1_3_3_43_2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/ICDM.2016.0058","volume-title":"2016 IEEE 16th International Conference on Data Mining (ICDM)","author":"Shin Kijung","year":"2016","unstructured":"Kijung Shin, Tina Eliassi-Rad, and Christos Faloutsos. 2016. Corescope: Graph mining using k-core analysis\u2014Patterns, anomalies and algorithms. In 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE, 469\u2013478."},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374527"},{"issue":"1","key":"e_1_3_3_45_2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1108\/JGOSS-04-2019-0027","article-title":"Measuring the flexibility index for a supply chain using graph theory matrix approach","volume":"13","author":"Singh Rajesh Kumar","year":"2020","unstructured":"Rajesh Kumar Singh and Pravin Kumar. 2020. Measuring the flexibility index for a supply chain using graph theory matrix approach. Journal of Global Operations and Strategic Sourcing 13, 1 (2020), 56\u201369.","journal-title":"Journal of Global Operations and Strategic Sourcing"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385416"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_16"},{"key":"e_1_3_3_48_2","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1109\/BigData.2018.8622056","volume-title":"2018 IEEE International Conference on Big Data (Big Data)","author":"Tripathy Alok","year":"2018","unstructured":"Alok Tripathy, Fred Hohman, Duen Horng Chau, and Oded Green. 2018. Scalable k-core decomposition for static graphs using a dynamic graph data structure. In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 1134\u20131141."},{"key":"e_1_3_3_49_2","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/978-3-319-46909-6_25","volume-title":"2nd International Conference on Nature of Computation and Communication (ICTCC \u201916)","author":"Truong Quoc Dinh","year":"2016","unstructured":"Quoc Dinh Truong, Quoc Bao Truong, and Taoufiq Dkaki. 2016. Graph methods for social network analysis. In 2nd International Conference on Nature of Computation and Communication (ICTCC \u201916). Springer, 276\u2013286."},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2009.10.007"},{"key":"e_1_3_3_51_2","doi-asserted-by":"crossref","first-page":"2366","DOI":"10.1109\/ICDCS.2017.288","volume-title":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","author":"Wang Na","year":"2017","unstructured":"Na Wang, Dongxiao Yu, Hai Jin, Chen Qian, Xia Xie, and Qiang-Sheng Hua. 2017. Parallel algorithm for core maintenance in dynamic graphs. In 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS). IEEE, 2366\u20132371."},{"key":"e_1_3_3_52_2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/ICDCSW.2011.34","volume-title":"2011 31st International Conference on Distributed Computing Systems Workshops","author":"Wang Tianyi","year":"2011","unstructured":"Tianyi Wang, Yang Chen, Zengbin Zhang, Tianyin Xu, Long Jin, Pan Hui, Beixing Deng, and Xing Li. 2011. Understanding graph sampling algorithms for social network analysis. In 2011 31st International Conference on Distributed Computing Systems Workshops. IEEE, 123\u2013128."},{"key":"e_1_3_3_53_2","first-page":"133","volume-title":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","author":"Wen Dong","year":"2016","unstructured":"Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, and Jeffrey Xu Yu. 2016. I\/O efficient core graph decomposition at web scale. In 2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 133\u2013144."},{"issue":"1","key":"e_1_3_3_54_2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TPDS.2021.3090759","article-title":"Efficient distributed approaches to core maintenance on large dynamic graphs","volume":"33","author":"Weng Tongfeng","year":"2021","unstructured":"Tongfeng Weng, Xu Zhou, Kenli Li, Peng Peng, and Keqin Li. 2021. Efficient distributed approaches to core maintenance on large dynamic graphs. IEEE Transactions on Parallel and Distributed Systems 33, 1 (2021), 129\u2013143.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109849"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357924"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.93"},{"key":"e_1_3_3_58_2","first-page":"1461","volume-title":"15th ACM International Conference on Web Search and Data Mining","author":"Zhao Kai","year":"2022","unstructured":"Kai Zhao, Yukun Zheng, Tao Zhuang, Xiang Li, and Xiaoyi Zeng. 2022. Joint learning of e-commerce search and recommendation with a unified graph neural network. In 15th ACM International Conference on Web Search and Data Mining, 1461\u20131469."},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.07.012"},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.784130"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:43:21Z","timestamp":1750272201000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,9]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4,30]]}},"alternative-id":["10.1145\/3719205"],"URL":"https:\/\/doi.org\/10.1145\/3719205","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,9]]},"assertion":[{"value":"2024-07-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}