{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:38:07Z","timestamp":1778279887484,"version":"3.51.4"},"reference-count":70,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T00:00:00Z","timestamp":1739232000000},"content-version":"vor","delay-in-days":1,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DOE","award":["ECRP Award 0000274975"],"award-info":[{"award-number":["ECRP Award 0000274975"]}]},{"DOI":"10.13039\/501100006374","name":"NSF","doi-asserted-by":"publisher","award":["OIA-2229394,OAC-2414474,OAC-2414185"],"award-info":[{"award-number":["OIA-2229394,OAC-2414474,OAC-2414185"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["12025104"],"award-info":[{"award-number":["12025104"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,2,10]]},"abstract":"<jats:p>\n                    Given a graph pair (G\n                    <jats:sup>1<\/jats:sup>\n                    , G\n                    <jats:sup>2<\/jats:sup>\n                    ), graph edit distance (GED) is defined as the minimum number of edit operations converting G\n                    <jats:sup>1<\/jats:sup>\n                    to G\n                    <jats:sup>2<\/jats:sup>\n                    . GED is a fundamental operation widely used in many applications, but its exact computation is NP-hard, so the approximation of GED has gained a lot of attention. Data-driven learning-based methods have been found to provide superior results compared to classical approximate algorithms, but they directly fit the coupling relationship between a pair of vertices from their vertex features. We argue that while pairwise vertex features can capture the coupling cost (discrepancy) of a pair of vertices, the vertex coupling matrix should be derived from the vertex-pair cost matrix through a more well-established method that is aware of the global context of the graph pair, such as optimal transport. In this paper, we propose an ensemble approach that integrates a supervised learning-based method and an unsupervised method, both based on optimal transport. Our learning method, GEDIOT, is based on inverse optimal transport that leverages a learnable Sinkhorn algorithm to generate the coupling matrix. Our unsupervised method, GEDGW, models GED computation as a linear combination of optimal transport and its variant, Gromov-Wasserstein discrepancy, for node and edge operations, respectively, which can be solved efficiently without needing the ground truth. Our ensemble method, GEDHOT, combines GEDIOT and GEDGW to further boost the performance. Extensive experiments demonstrate that our methods significantly outperform the existing methods in terms of the performance of GED computation, edit path generation, and model generalizability.\n                  <\/jats:p>","DOI":"10.1145\/3709673","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T15:45:06Z","timestamp":1739288706000},"page":"1-26","source":"Crossref","is-referenced-by-count":6,"title":["Computing Approximate Graph Edit Distance via Optimal Transport"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5228-3835","authenticated-orcid":false,"given":"Qihao","family":"Cheng","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4653-0408","authenticated-orcid":false,"given":"Da","family":"Yan","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6141-5512","authenticated-orcid":false,"given":"Tianhao","family":"Wu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5623-4864","authenticated-orcid":false,"given":"Zhongyi","family":"Huang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6851-3115","authenticated-orcid":false,"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2024. Full Technical Report. https:\/\/arxiv.org\/abs\/2412.18857."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489513"},{"key":"e_1_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Yunsheng Bai Hao Ding Song Bian Ting Chen Yizhou Sun and Wei Wang. 2019. SimGNN: A Neural Network Approach to Fast Graph Similarity Computation. In WSDM. 384--392.","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.05.002"},{"key":"e_1_2_2_5_1","volume-title":"Convex Optimization","author":"Boyd Stephen","unstructured":"Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. Cambridge University Press."},{"key":"e_1_2_2_6_1","volume-title":"Conditional Gradient Methods. arXiv preprint arXiv:2211.14103","author":"Braun G\u00e1bor","year":"2022","unstructured":"G\u00e1bor Braun, Alejandro Carderera, Cyrille W Combettes, Hamed Hassani, Amin Karbasi, Aryan Mokhtari, and Sebastian Pokutta. 2022. Conditional Gradient Methods. arXiv preprint arXiv:2211.14103 (2022)."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(83)90033-8"},{"key":"e_1_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Lijun Chang Xing Feng Xuemin Lin Lu Qin Wenjie Zhang and Dian Ouyang. 2020. Speeding up GED Verification for Graph Similarity Search. In ICDE. 793--804.","DOI":"10.1109\/ICDE48307.2020.00074"},{"key":"e_1_2_2_9_1","first-page":"4485","article-title":"Accelerating Graph Similarity Search via Efficient GED Computation","volume":"35","author":"Chang Lijun","year":"2022","unstructured":"Lijun Chang, Xing Feng, Kai Yao, Lu Qin, and Wenjie Zhang. 2022. Accelerating Graph Similarity Search via Efficient GED Computation. IEEE Transactions on Knowledge and Data Engineering 35, 5 (2022), 4485--4498.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_2_10_1","first-page":"2903","article-title":"Partial Optimal Transport with Applications on Positiveunlabeled Learning","volume":"33","author":"Chapel Laetitia","year":"2020","unstructured":"Laetitia Chapel, Mokhtar Z Alaya, and Gilles Gasso. 2020. Partial Optimal Transport with Applications on Positiveunlabeled Learning. NeurIPS 33 (2020), 2903--2913.","journal-title":"NeurIPS"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(87)90017-5"},{"key":"e_1_2_2_12_1","unstructured":"Wei-Ting Chiu Pei Wang and Patrick Shafto. 2022. Discrete Probabilistic Inverse Optimal Transport. In ICML. 3925--3946."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2615921"},{"key":"e_1_2_2_14_1","first-page":"2292","article-title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transport","volume":"26","author":"Cuturi Marco","year":"2013","unstructured":"Marco Cuturi. 2013. Sinkhorn Distances: Lightspeed Computation of Optimal Transport. NeurIPS 26 (2013), 2292--2300.","journal-title":"NeurIPS"},{"key":"e_1_2_2_15_1","first-page":"19327","article-title":"COPT: Coordinated Optimal Transport on Graphs","volume":"33","author":"Dong Yihe","year":"2020","unstructured":"Yihe Dong and Will Sawin. 2020. COPT: Coordinated Optimal Transport on Graphs. NeurIPS 33 (2020), 19327--19338.","journal-title":"NeurIPS"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20844-7_11"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38221-5_21"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.02.004"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498246"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.152"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452780"},{"key":"e_1_2_2_22_1","volume-title":"Inves: Incremental Partitioning-Based Verification for Graph Similarity Search.. In EDBT. 229--240.","author":"Kim Jongik","year":"2019","unstructured":"Jongik Kim, Dong-Hoon Choi, and Chen Li. 2019. Inves: Incremental Partitioning-Based Verification for Graph Similarity Search.. In EDBT. 229--240."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2695801"},{"key":"e_1_2_2_24_1","volume-title":"COCLEP: Contrastive Learning-based Semi-Supervised Community Search. In ICDE. 2483--2495.","author":"Li Ling","year":"2023","unstructured":"Ling Li, Siqiang Luo, Yuhai Zhao, Caihua Shan, ZhengkuiWang, and Lu Qin. 2023. COCLEP: Contrastive Learning-based Semi-Supervised Community Search. In ICDE. 2483--2495."},{"key":"e_1_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Yongjiang Liang and Peixiang Zhao. 2017. Similarity Search in Graph Databases: A Multi-Layered Indexing Approach. In ICDE. 783--794.","DOI":"10.1109\/ICDE.2017.129"},{"key":"e_1_2_2_26_1","volume-title":"Similarity Search in Graph Databases: A Multi-layered Indexing Approach. In 2017 IEEE 33rd International Conference on Data Engineering (ICDE). IEEE, 783--794","author":"Liang Yongjiang","year":"2017","unstructured":"Yongjiang Liang and Peixiang Zhao. 2017. Similarity Search in Graph Databases: A Multi-layered Indexing Approach. In 2017 IEEE 33rd International Conference on Data Engineering (ICDE). IEEE, 783--794."},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Junfeng Liu Min Zhou Shuai Ma and Lujia Pan. 2023. MATA*: Combining Learnable Node Matching with A* Algorithm for Approximate Graph Edit Distance Computation. In CIKM. 1503--1512.","DOI":"10.1145\/3583780.3614959"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9093-5"},{"key":"e_1_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Michel Neuhaus Kaspar Riesen and Horst Bunke. 2006. Fast Suboptimal Algorithms for The Computation of Graph Edit Distance. In Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR). 163--172.","DOI":"10.1007\/11815921_17"},{"key":"e_1_2_2_30_1","first-page":"13899","article-title":"GOT: An Optimal Transport Framework for Graph Comparison","volume":"32","author":"Maretic Hermina Petric","year":"2019","unstructured":"Hermina Petric Maretic, Mireille El Gheche, Giovanni Chierchia, and Pascal Frossard. 2019. GOT: An Optimal Transport Framework for Graph Comparison. NeurIPS 32 (2019), 13899--13910.","journal-title":"NeurIPS"},{"key":"e_1_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Gabriel Peyr\u00e9 Marco Cuturi et al. 2019. Computational Optimal Transport: With Applications to Data Science. Foundations and Trends\u00ae in Machine Learning 11 5--6 (2019) 355--607.","DOI":"10.1561\/2200000073"},{"key":"e_1_2_2_32_1","unstructured":"Gabriel Peyr\u00e9 Marco Cuturi and Justin Solomon. 2016. Gromov-Wasserstein Averaging of Kernel and Distance Matrices. In ICML. 2664--2672."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594514"},{"key":"e_1_2_2_34_1","first-page":"205","article-title":"Limits of Depth: Over-Smoothing and Over-Squashing in GNNs","volume":"7","author":"Shaima Qureshi","year":"2023","unstructured":"Shaima Qureshi et al. 2023. Limits of Depth: Over-Smoothing and Over-Squashing in GNNs. Big Data Mining and Analytics 7, 1 (2023), 205--216.","journal-title":"Big Data Mining and Analytics"},{"key":"e_1_2_2_35_1","volume-title":"Greed: A Neural Framework for Learning Graph Distance Functions. In NeurIPS. 22518--22530.","author":"Ranjan Rishabh","year":"2022","unstructured":"Rishabh Ranjan, Siddharth Grover, Sourav Medya, Venkatesan Chakaravarthy, Yogish Sabharwal, and Sayan Ranu. 2022. Greed: A Neural Framework for Learning Graph Distance Functions. In NeurIPS. 22518--22530."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38221-5_15"},{"key":"e_1_2_2_39_1","volume-title":"A Survey on Oversmoothing in Graph Neural Networks. arXiv preprint arXiv:2303.10993","author":"Rusch T Konstantin","year":"2023","unstructured":"T Konstantin Rusch, Michael M Bronstein, and Siddhartha Mishra. 2023. A Survey on Oversmoothing in Graph Neural Networks. arXiv preprint arXiv:2303.10993 (2023)."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078187"},{"key":"e_1_2_2_41_1","unstructured":"Liangliang Shi Jack Fan and Junchi Yan. 2024. OT-CLIP: Understanding and Generalizing CLIP via Optimal Transport. In ICML. 1--22."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i13.29419"},{"key":"e_1_2_2_43_1","unstructured":"Liangliang Shi Gu Zhang Haoyu Zhen Jintao Fan and Junchi Yan. 2023. Understanding and Generalizing Contrastive Learning from The Inverse Optimal Transport Perspective. In ICML. 31408--31421."},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1261122"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.3390\/a13090212"},{"key":"e_1_2_2_46_1","volume-title":"ICML","volume":"97","author":"Vayer Titouan","year":"2019","unstructured":"Titouan Vayer, Nicolas Courty, Romain Tavenard, Laetitia Chapel, and R\u00e9mi Flamary. 2019. Optimal Transport for Structured Data with Application on Graphs. In ICML, Vol. 97. PMLR, 6275--6284."},{"key":"e_1_2_2_47_1","volume-title":"[n. d.]. Optimal Transport: Old and New","author":"C\u00e9dric Villani","unstructured":"C\u00e9dric Villani et al. [n. d.]. Optimal Transport: Old and New. Vol. 338. Springer."},{"key":"e_1_2_2_48_1","unstructured":"C\u00e9dric Vincent-Cuaz R\u00e9mi Flamary Marco Corneli Titouan Vayer and Nicolas Courty. 2021. Semi-Relaxed Gromov- Wasserstein Divergence and Applications on Graphs. In ICLR. 1--14."},{"key":"e_1_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Hanchen Wang Rong Hu Ying Zhang Lu Qin Wei Wang and Wenjie Zhang. 2022. Neural Subgraph Counting with Wasserstein Estimator. In SIGMOD. 160--175.","DOI":"10.1145\/3514221.3526163"},{"key":"e_1_2_2_50_1","first-page":"1","article-title":"Neural Attributed Community Search at Billion Scale","volume":"1","author":"Wang Jianwei","year":"2024","unstructured":"Jianwei Wang, Kai Wang, Xuemin Lin, Wenjie Zhang, and Ying Zhang. 2024. Neural Attributed Community Search at Billion Scale. PACMMOD 1, 4 (2024), 1--25.","journal-title":"PACMMOD"},{"key":"e_1_2_2_51_1","doi-asserted-by":"crossref","unstructured":"Runzhong Wang Tianqi Zhang Tianshu Yu Junchi Yan and Xiaokang Yang. 2021. Combinatorial Learning of Graph Edit Distance via Dynamic Embedding. In CVPR. 5241--5250.","DOI":"10.1109\/CVPR46437.2021.00520"},{"key":"e_1_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Xiaoli Wang Xiaofeng Ding Anthony K. H. Tung Shanshan Ying and Hai Jin. 2012. An Efficient Graph Indexing Method. In ICDE. 210--221.","DOI":"10.1109\/ICDE.2012.28"},{"key":"e_1_2_2_53_1","volume-title":"The Use of Entropy Maximising Models, in the Theory of Trip Distribution, Mode Split and Route Split. Journal of Transport Economics and Policy","author":"Wilson Alan Geoffrey","year":"1969","unstructured":"Alan Geoffrey Wilson. 1969. The Use of Entropy Maximising Models, in the Theory of Trip Distribution, Mode Split and Route Split. Journal of Transport Economics and Policy (1969), 108--126."},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/1403745.1403746"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-021-01251-0"},{"key":"e_1_2_2_56_1","unstructured":"Hongteng Xu Dixin Luo and Lawrence Carin. 2019. Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching. In NeurIPS. 3046--3056."},{"key":"e_1_2_2_57_1","unstructured":"Jingjing Xu Hao Zhou Chun Gan Zaixiang Zheng and Lei Li. 2021. Vocabulary Learning via Optimal Transport for Neural Machine Translation. In ACL. 1--13."},{"key":"e_1_2_2_58_1","volume-title":"How Powerful Are Graph Neural Networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How Powerful Are Graph Neural Networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_2_2_59_1","volume-title":"Noah: Neural-Optimized A* Search Algorithm for Graph Edit Distance Computation. In ICDE. 576--587.","author":"Yang Lei","year":"2021","unstructured":"Lei Yang and Lei Zou. 2021. Noah: Neural-Optimized A* Search Algorithm for Graph Edit Distance Computation. In ICDE. 576--587."},{"key":"e_1_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Weijie Yu Zhongxiang Sun Jun Xu Zhenhua Dong Xu Chen Hongteng Xu and Ji-Rong Wen. 2022. Explainable Legal Case Matching via Inverse Optimal Transport-based Rationale Extraction. In SIGIR. 657--668.","DOI":"10.1145\/3477495.3531974"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_2_2_62_1","volume-title":"Graph Neural Networks: Link Prediction. Graph Neural Networks: Foundations, Frontiers, and Applications","author":"Zhang Muhan","year":"2022","unstructured":"Muhan Zhang. 2022. Graph Neural Networks: Link Prediction. Graph Neural Networks: Foundations, Frontiers, and Applications (2022), 195--223."},{"key":"e_1_2_2_63_1","first-page":"5171","article-title":"Link Prediction Based on Graph Neural Networks","volume":"31","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link Prediction Based on Graph Neural Networks. NeurIPS 31 (2018), 5171--5181.","journal-title":"NeurIPS"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.4208\/jml.240416"},{"key":"e_1_2_2_65_1","volume-title":"Hao Zhang, Qiyan Li, and Yu Rong.","author":"Zhao Kangfei","year":"2021","unstructured":"Kangfei Zhao, Jeffrey Xu Yu, Hao Zhang, Qiyan Li, and Yu Rong. 2021. A Learned Sketch for Subgraph Counting. In SIGMOD. 2142--2155."},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732236"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.91"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0487-0"},{"key":"e_1_2_2_69_1","doi-asserted-by":"crossref","unstructured":"Weiguo Zheng Lei Zou Xiang Lian DongWang and Dongyan Zhao. 2013. Graph Similarity Search with Edit Distance Constraint in Large Graph Databases. In CIKM. 1595--1600.","DOI":"10.1145\/2505515.2505723"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709673","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3709673","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3709673","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:21:31Z","timestamp":1774981291000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,10]]}},"alternative-id":["10.1145\/3709673"],"URL":"https:\/\/doi.org\/10.1145\/3709673","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]}}}