{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T03:55:59Z","timestamp":1782878159985,"version":"3.54.5"},"reference-count":71,"publisher":"Association for Computing Machinery (ACM)","issue":"8","funder":[{"name":"Alliance of International Science Organizations Collaborative Research Program","award":["ANSO-CR-KP-2022-03"],"award-info":[{"award-number":["ANSO-CR-KP-2022-03"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>\n            Graph Anomaly Detection (GAD) has gained significant attention in areas such as financial risk control and social network security, becoming a critical research problem. Vanilla Graph Neural Networks (GNNs), a popular method for graph modeling, are known to perform poorly in GAD due to the assumption of homophily preferences. This article argues that the issue lies in the insufficient feature extraction ability caused by their single filtering property (low-pass filtering) and revealing the effectiveness of multi-band filtering to deal with GAD. From this, we note two other overlooked issues: (1) How can multi-band band-pass filtering further fuse multi-scale neighborhood information? (2) Adaptation between raw attributes of nodes and graph filters (graph topology). The former bridges the respective advantages of spectral domain and spatial domain, and the latter is an important bottleneck for the encoding capacity of the filters. To address these, we propose a new GAD method, Graph Perturbed Networks (GraphPN). Each hidden layer of GraphPN is a band-pass filter, enabling multi-band and multi-scale filtering through simple stacking and skip connections. We analyze its spectral locality and spatial locality to provide theoretical support. Additionally, GraphPN is supplemented with a tailored feature activation module to complete the adaptation of the above two. This module readjusts node indices and decouples graph convolution, introducing rich topological information to node attributes. In addition to further enhancing detection performance, another possibly counter-intuitive effect is that the distinguishability of the two classes of nodes is improved even before filtering. The proposed method performs well in real-world datasets compared with the current state-of-the-art baselines, which fully demonstrates its superiority. Codes are available at\n            <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/Thankstaro\/GraphPN\">https:\/\/github.com\/Thankstaro\/GraphPN<\/jats:ext-link>\n            .\n          <\/jats:p>","DOI":"10.1145\/3748727","type":"journal-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:26:05Z","timestamp":1752672365000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Topology Augmented Multi-Band and Multi-Scale Filtering for Graph Anomaly Detection"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5475-3815","authenticated-orcid":false,"given":"Jingyuan","family":"Zhang","sequence":"first","affiliation":[{"name":"Institute of Software Chinese Academy of Sciences, Beijing, China and University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3134-3746","authenticated-orcid":false,"given":"Lei","family":"Yu","sequence":"additional","affiliation":[{"name":"Institute of Software Chinese Academy of Sciences, Beijing, China and University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9652-9097","authenticated-orcid":false,"given":"Zhirong","family":"Huang","sequence":"additional","affiliation":[{"name":"Institute of Software Chinese Academy of Sciences, Beijing, China and University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8364-6525","authenticated-orcid":false,"given":"Li","family":"Yang","sequence":"additional","affiliation":[{"name":"Institute of Software Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3830-8786","authenticated-orcid":false,"given":"Fengjun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Software Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,9,8]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/270"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525099"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3025588"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3272396"},{"key":"e_1_3_2_7_2","unstructured":"Eli Chien Jianhao Peng Pan Li and Olgica Milenkovic. 2020. Adaptive universal generalized pagerank graph neural network. arXiv:2006.07988. Retrieved from https:\/\/arxiv.org\/abs\/2006.07988"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"e_1_3_2_9_2","first-page":"1197","volume-title":"Proceedings of the 7th IEEE International Conference on Computer Vision","author":"Comaniciu Dorin","year":"1999","unstructured":"Dorin Comaniciu and Peter Meer. 1999. Mean shift analysis and applications. In Proceedings of the 7th IEEE International Conference on Computer Vision. IEEE, 1197\u20131203."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403140"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143874"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449922"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411903"},{"key":"e_1_3_2_14_2","unstructured":"Matthias Fey and Jan Eric Lenssen. 2019. Fast graph representation learning with PyTorch geometric. arXiv:1903.02428. Retrieved from https:\/\/arxiv.org\/abs\/1903.02428"},{"key":"e_1_3_2_15_2","unstructured":"Fabrizio Frasca Emanuele Rossi Davide Eynard Benjamin Chamberlain Michael Bronstein and Federico Monti. 2020. SIGN: Scalable inception graph neural networks. arXiv:2004.11198. Retrieved from https:\/\/arxiv.org\/abs\/2004.11198"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583268"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570377"},{"key":"e_1_3_2_18_2","unstructured":"Johannes Gasteiger Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized PageRank. arXiv:1810.05997. Retrieved from http:\/\/arxiv.org\/abs\/1810.05997"},{"key":"e_1_3_2_19_2","first-page":"2104","volume-title":"Proceedings of the 32nd International Joint Conference on Artificial Intelligence","author":"Gong Zheng","year":"2023","unstructured":"Zheng Gong, Guifeng Wang, Ying Sun, Qi Liu, Yuting Ning, Hui Xiong, and Jingyu Peng. 2023. Beyond homophily: Robust graph anomaly detection via neural sparsification. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, 2104\u20132113."},{"key":"e_1_3_2_20_2","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in Neural Information Processing Systems 30 (2017), 1025\u20131035.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.04.005"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3056563"},{"key":"e_1_3_2_23_2","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume":"33","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. Advances in Neural Information Processing Systems 33 (2020), 22118\u201322133.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_24_2","unstructured":"Mengying Jiang Guizhong Liu Yuanchao Su and Xinliang Wu. 2021. GCN-SL: Graph convolutional networks with structure learning for graphs under heterophily. arXiv:2105.13795. Retrieved from https:\/\/arxiv.org\/abs\/2105.13795"},{"key":"e_1_3_2_25_2","unstructured":"Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907. Retrieved from https:\/\/arxiv.org\/abs\/1609.02907"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"e_1_3_2_27_2","first-page":"13242","volume-title":"International Conference on Machine Learning","author":"Li Xiang","year":"2022","unstructured":"Xiang Li, Renyu Zhu, Yao Cheng, Caihua Shan, Siqiang Luo, Dongsheng Li, and Weining Qian. 2022. Finding global homophily in graph neural networks when meeting heterophily. In International Conference on Machine Learning. PMLR, 13242\u201313256."},{"key":"e_1_3_2_28_2","first-page":"10909","article-title":"Predicting global label relationship matrix for graph neural networks under heterophily","volume":"36","author":"Liang Langzhang","year":"2024","unstructured":"Langzhang Liang, Xiangjing Hu, Zenglin Xu, Zixing Song, and Irwin King. 2024. Predicting global label relationship matrix for graph neural networks under heterophily. Advances in Neural Information Processing Systems 36 (2024), 10909\u201310921.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_29_2","first-page":"10197","article-title":"LD2: Scalable heterophilous graph neural network with decoupled embeddings","volume":"36","author":"Liao Ningyi","year":"2024","unstructured":"Ningyi Liao, Siqiang Luo, Xiang Li, and Jieming Shi. 2024. LD2: Scalable heterophilous graph neural network with decoupled embeddings. Advances in Neural Information Processing Systems 36 (2024), 10197\u201310209.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"141","key":"e_1_3_2_30_2","first-page":"1","article-title":"Pygod: A python library for graph outlier detection","volume":"25","author":"Liu Kay","year":"2024","unstructured":"Kay Liu, Yingtong Dou, Xueying Ding, Xiyang Hu, Ruitong Zhang, Hao Peng, Lichao Sun, and Philip S. Yu. 2024. Pygod: A python library for graph outlier detection. Journal of Machine Learning Research 25, 141 (2024), 1\u20139.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_31_2","first-page":"27021","article-title":"Bond: Benchmarking unsupervised outlier node detection on static attributed graphs","volume":"35","author":"Liu Kay","year":"2022","unstructured":"Kay Liu, Yingtong Dou, Yue Zhao, Xueying Ding, Xiyang Hu, Ruitong Zhang, Kaize Ding, Canyu Chen, Hao Peng, Kai Shu, et al. 2022. Bond: Benchmarking unsupervised outlier node detection on static attributed graphs. Advances in Neural Information Processing Systems 35 (2022), 27021\u201327035.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449989"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401253"},{"key":"e_1_3_2_34_2","first-page":"28748","article-title":"When do graph neural networks help with node classification? Investigating the homophily principle on node distinguishability","volume":"36","author":"Luan Sitao","year":"2024","unstructured":"Sitao Luan, Chenqing Hua, Minkai Xu, Qincheng Lu, Jiaqi Zhu, Xiao-Wen Chang, Jie Fu, Jure Leskovec, and Doina Precup. 2024. When do graph neural networks help with node classification? Investigating the homophily principle on node distinguishability. Advances in Neural Information Processing Systems 36 (2024), 28748\u201328760.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3118815"},{"key":"e_1_3_2_36_2","unstructured":"Yao Ma Xiaorui Liu Neil Shah and Jiliang Tang. 2022. Is homophily a necessity for graph neural networks? arXiv:2106.06134. Retrieved from https:\/\/arxiv.org\/abs\/2106.06134"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767755"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488466"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026126"},{"key":"e_1_3_2_40_2","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. 1999. The PageRank citation ranking: Bringing Order to the Web. Technical Report. Stanford infolab."},{"key":"e_1_3_2_41_2","first-page":"8026","article-title":"Pytorch: An imperative style, high-performance deep learning library","volume":"32","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, et al. 2019. Pytorch: An imperative style, high-performance deep learning library. Advances in Neural Information Processing Systems 32 (2019), 8026\u20138037.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_42_2","unstructured":"Hongbin Pei Bingzhe Wei Kevin Chen-Chuan Chang Yu Lei and Bo Yang. 2020. Geom-gcn: Geometric graph convolutional networks. arXiv:2002.05287. Retrieved from https:\/\/arxiv.org\/abs\/2002.05287"},{"key":"e_1_3_2_43_2","first-page":"523","article-title":"Characterizing graph datasets for node classification: Homophily-heterophily dichotomy and beyond","volume":"36","author":"Platonov Oleg","year":"2024","unstructured":"Oleg Platonov, Denis Kuznedelev, Artem Babenko, and Liudmila Prokhorenkova. 2024. Characterizing graph datasets for node classification: Homophily-heterophily dichotomy and beyond. Advances in Neural Information Processing Systems 36 (2024), 523\u2013548.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_44_2","first-page":"49490","article-title":"Truncated affinity maximization: One-class homophily modeling for graph anomaly detection","volume":"36","author":"Qiao Hezhe","year":"2023","unstructured":"Hezhe Qiao and Guansong Pang. 2023. Truncated affinity maximization: One-class homophily modeling for graph anomaly detection. Advances in Neural Information Processing Systems 36 (2023), 49490\u201349512.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783370"},{"key":"e_1_3_2_46_2","unstructured":"Yu Rong Wenbing Huang Tingyang Xu and Junzhou Huang. 2020. DropEdge: Towards deep graph convolutional networks on node classification. arXiv:1907.10903. Retrieved from http:\/\/arxiv.org\/abs\/1907.10903"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638850"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"e_1_3_2_50_2","unstructured":"Oleksandr Shchur Maximilian Mumme Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Pitfalls of graph neural network evaluation. arXiv:1811.05868. Retrieved from https:\/\/arxiv.org\/abs\/1811.05868"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512195"},{"key":"e_1_3_2_52_2","first-page":"21076","volume-title":"International Conference on Machine Learning","author":"Tang Jianheng","year":"2022","unstructured":"Jianheng Tang, Jiajin Li, Ziqi Gao, and Jia Li. 2022. Rethinking graph neural networks for anomaly detection. In International Conference on Machine Learning. PMLR, 21076\u201321089."},{"key":"e_1_3_2_53_2","article-title":"Visualizing data using t-SNE","author":"der Maaten Laurens Van","year":"2008","unstructured":"Laurens Van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of Machine Learning Research 9, 86 (2008), 2579\u22122605.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_54_2","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph attention networks. arXiv:1710.10903. Retrieved from https:\/\/arxiv.org\/abs\/1710.10903"},{"key":"e_1_3_2_55_2","unstructured":"Minjie Yu Wang. 2019. Deep graph library: Towards efficient and scalable deep learning on graphs. arXiv:1909.01315. Retrieved from http:\/\/arxiv.org\/abs\/1909.01315"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449952"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-05924-9"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403177"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615067"},{"key":"e_1_3_2_60_2","first-page":"6861","volume-title":"International Conference on Machine Learning","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Amauri Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In International Conference on Machine Learning. PMLR, 6861\u20136871."},{"key":"e_1_3_2_61_2","first-page":"14557","volume-title":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","author":"Xiang Sheng","year":"2023","unstructured":"Sheng Xiang, Mingzhi Zhu, Dawei Cheng, Enxia Li, Ruihui Zhao, Yi Ouyang, Ling Chen, and Yefeng Zheng. 2023. Semi-supervised credit card fraud detection via attribute-driven graph representation. In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 14557\u201314565."},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3250523"},{"key":"e_1_3_2_63_2","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv:1810.00826. Retrieved from https:\/\/arxiv.org\/abs\/1810.00826"},{"key":"e_1_3_2_64_2","first-page":"5453","volume-title":"International Conference on Machine Learning","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-Ichi Kawarabayashi, and Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In International Conference on Machine Learning. PMLR, 5453\u20135462."},{"key":"e_1_3_2_65_2","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph contrastive learning with augmentations. Advances in Neural Information Processing Systems 33 (2020), 5812\u20135823.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_66_2","unstructured":"Hanqing Zeng Hongkuan Zhou Ajitesh Srivastava Rajgopal Kannan and Viktor Prasanna. 2020. GraphSAINT: Graph sampling based inductive learning method. arXiv:1907.04931. Retrieved from http:\/\/arxiv.org\/abs\/1907.04931"},{"key":"e_1_3_2_67_2","doi-asserted-by":"crossref","unstructured":"Xin Zheng Miao Zhang Chunyang Chen Qin Zhang Chuan Zhou and Shirui Pan. 2023. Auto-heg: Automated graph neural network on heterophilic graphs. arXiv:2302.12357. Retrieved from https:\/\/arxiv.org\/abs\/2302.12357","DOI":"10.1145\/3543507.3583498"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3732282"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482195"},{"key":"e_1_3_2_70_2","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume":"33","author":"Zhu Jiong","year":"2020","unstructured":"Jiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann, Leman Akoglu, and Danai Koutra. 2020. Beyond homophily in graph neural networks: Current limitations and effective designs. Advances in Neural Information Processing Systems 33 (2020), 7793\u20137804.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/3653023"},{"key":"e_1_3_2_72_2","unstructured":"Wei Zhuo Zemin Liu Bryan Hooi Bingsheng He Guang Tan Rizal Fathony and Jia Chen. 2024. Partitioning message passing for graph fraud detection. arXiv:2412.00020. Retrieved from https:\/\/arxiv.org\/abs\/2412.00020"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T15:48:02Z","timestamp":1757346482000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":71,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3748727"],"URL":"https:\/\/doi.org\/10.1145\/3748727","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"2024-12-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}