{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T02:51:12Z","timestamp":1765507872041,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,10]]},"DOI":"10.1145\/3746252.3761209","type":"proceedings-article","created":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T01:03:27Z","timestamp":1762563807000},"page":"1903-1913","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Masked Graph Distance Network for Accurate Subgraph Similarity Computation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5783-8440","authenticated-orcid":false,"given":"Xijuan","family":"Liu","sequence":"first","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2034-9698","authenticated-orcid":false,"given":"Yin","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2951-2226","authenticated-orcid":false,"given":"Fan","family":"Li","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3554-3219","authenticated-orcid":false,"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6070-8524","authenticated-orcid":false,"given":"Haiyang","family":"Hu","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2674-1638","authenticated-orcid":false,"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"Zhejiang Gongshang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5720"},{"key":"e_1_3_2_1_3_1","volume-title":"New techniques for graph edit distance computation. arXiv preprint arXiv:1908.00265","author":"Blumenthal David B","year":"2019","unstructured":"David B Blumenthal. 2019. New techniques for graph edit distance computation. arXiv preprint arXiv:1908.00265 (2019)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20081-7_2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.05.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2019.10.028"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(83)90033-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18224-7_19"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.205"},{"key":"e_1_3_2_1_11_1","volume-title":"Thomas Laurent, Yoshua Bengio, and Xavier Bresson.","author":"Dwivedi Vijay Prakash","year":"2021","unstructured":"Vijay Prakash Dwivedi, Anh Tuan Luu, Thomas Laurent, Yoshua Bengio, and Xavier Bresson. 2021. Graph neural networks with learnable structural and positional representations. arXiv preprint arXiv:2110.07875 (2021)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_1_13_1","first-page":"4776","article-title":"How powerful are k-hop message passing graph neural networks","volume":"35","author":"Feng Jiarui","year":"2022","unstructured":"Jiarui Feng, Yixin Chen, Fuhai Li, Anindya Sarkar, and Muhan Zhang. 2022. How powerful are k-hop message passing graph neural networks. Advances in Neural Information Processing Systems, Vol. 35 (2022), 4776-4790.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_14_1","volume-title":"A survey of graph edit distance. Pattern Analysis and applications","author":"Gao Xinbo","year":"2010","unstructured":"Xinbo Gao, Bing Xiao, Dacheng Tao, and Xuelong Li. 2010. A survey of graph edit distance. Pattern Analysis and applications, Vol. 13 (2010), 113-129."},{"key":"e_1_3_2_1_15_1","volume-title":"International conference on machine learning. PMLR, 1263-1272","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. 2017. Neural message passing for quantum chemistry. In International conference on machine learning. PMLR, 1263-1272."},{"key":"e_1_3_2_1_16_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems","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, Vol. 30 (2017)."},{"key":"e_1_3_2_1_17_1","volume-title":"Strategies for pre-training graph neural networks. arXiv preprint arXiv:1905.12265","author":"Hu Weihua","year":"2019","unstructured":"Weihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik, Percy Liang, Vijay Pande, and Jure Leskovec. 2019. Strategies for pre-training graph neural networks. arXiv preprint arXiv:1905.12265 (2019)."},{"key":"e_1_3_2_1_18_1","volume-title":"Unignn: a unified framework for graph and hypergraph neural networks. arXiv preprint arXiv:2105.00956","author":"Huang Jing","year":"2021","unstructured":"Jing Huang and Jie Yang. 2021. Unignn: a unified framework for graph and hypergraph neural networks. arXiv preprint arXiv:2105.00956 (2021)."},{"key":"e_1_3_2_1_19_1","volume-title":"Graph Edit Distance with General Costs Using Neural Set Divergence. arXiv preprint arXiv:2409.17687","author":"Jain Eeshaan","year":"2024","unstructured":"Eeshaan Jain, Indradyumna Roy, Saswat Meher, Soumen Chakrabarti, and Abir De. 2024. Graph Edit Distance with General Costs Using Neural Set Divergence. arXiv preprint arXiv:2409.17687 (2024)."},{"key":"e_1_3_2_1_20_1","first-page":"7534","article-title":"Edge representation learning with hypergraphs","volume":"34","author":"Jo Jaehyeong","year":"2021","unstructured":"Jaehyeong Jo, Jinheon Baek, Seul Lee, Dongki Kim, Minki Kang, and Sung Ju Hwang. 2021. Edge representation learning with hypergraphs. Advances in Neural Information Processing Systems, Vol. 34 (2021), 7534-7546.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.152"},{"key":"e_1_3_2_1_22_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_23_1","volume-title":"International Workshop on Cost-Sensitive Learning. PMLR, 31-44","author":"Kriege Nils M","year":"2018","unstructured":"Nils M Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, and Frank Weichert. 2018. Recognizing cuneiform signs using graph based methods. In International Workshop on Cost-Sensitive Learning. PMLR, 31-44."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.07.029"},{"key":"e_1_3_2_1_25_1","volume-title":"Efficient Dynamic Attributed Graph Generation. In 2025 IEEE 41st International Conference on Data Engineering (ICDE). IEEE Computer Society, 1415-1428","author":"Li Fan","year":"2025","unstructured":"Fan Li, Xiaoyang Wang, Dawei Cheng, Cong Chen, Ying Zhang, and Xuemin Lin. 2025. Efficient Dynamic Attributed Graph Generation. In 2025 IEEE 41st International Conference on Data Engineering (ICDE). IEEE Computer Society, 1415-1428."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. 4398-4406","author":"Li Fan","year":"2024","unstructured":"Fan Li, Xiaoyang Wang, Dawei Cheng, Wenjie Zhang, Ying Zhang, and Xuemin Lin. 2024. Hypergraph self-supervised learning with sampling-efficient signals. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. 4398-4406."},{"key":"e_1_3_2_1_27_1","volume-title":"International conference on machine learning. PMLR, 3835-3845","author":"Li Yujia","year":"2019","unstructured":"Yujia Li, Chenjie Gu, Thomas Dullien, Oriol Vinyals, and Pushmeet Kohli. 2019. Graph matching networks for learning the similarity of graph structured objects. In International conference on machine learning. PMLR, 3835-3845."},{"key":"e_1_3_2_1_28_1","volume-title":"Towards accurate subgraph similarity computation via neural graph pruning. arXiv preprint arXiv:2210.10643","author":"Liu Linfeng","year":"2022","unstructured":"Linfeng Liu, Xu Han, Dawei Zhou, and Li-Ping Liu. 2022. Towards accurate subgraph similarity computation via neural graph pruning. arXiv preprint arXiv:2210.10643 (2022)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403247"},{"key":"e_1_3_2_1_30_1","volume-title":"IGFM: An Enhanced Graph Similarity Computation Method with Fine-Grained Analysis. Data Science and Engineering","author":"Pei Min","year":"2025","unstructured":"Min Pei, Jianke Yu, Chen Chen, Hanchen Wang, Xiaoyang Wang, and Ying Zhang. 2025. IGFM: An Enhanced Graph Similarity Computation Method with Fine-Grained Analysis. Data Science and Engineering (2025), 1-15."},{"key":"e_1_3_2_1_31_1","first-page":"22518","article-title":"Greed: A neural framework for learning graph distance functions","volume":"35","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. Advances in Neural Information Processing Systems, Vol. 35 (2022), 22518-22530.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_32_1","volume-title":"SSPR & SPR 2008, Orlando, USA, December 4-6, 2008. Proceedings. Springer, 287-297","author":"Riesen Kaspar","year":"2008","unstructured":"Kaspar Riesen and Horst Bunke. 2008. IAM graph database repository for graph based pattern recognition and machine learning. In Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshop, SSPR & SPR 2008, Orlando, USA, December 4-6, 2008. Proceedings. Springer, 287-297."},{"key":"e_1_3_2_1_33_1","volume-title":"Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing","author":"Riesen Kaspar","year":"2009","unstructured":"Kaspar Riesen and Horst Bunke. 2009. Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision computing, Vol. 27, 7 (2009), 950-959."},{"key":"e_1_3_2_1_34_1","volume-title":"Artificial Neural Networks in Pattern Recognition: 6th IAPR TC 3 International Workshop, ANNPR","author":"Riesen Kaspar","year":"2014","unstructured":"Kaspar Riesen, Andreas Fischer, and Horst Bunke. 2014. Combining bipartite graph matching and beam search for graph edit distance approximation. In Artificial Neural Networks in Pattern Recognition: 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014. Proceedings 6. Springer, 117-128."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615209"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714892"},{"key":"e_1_3_2_1_38_1","volume-title":"Hydra: Structured Cross-Source Enhanced Large Language Model Reasoning. arXiv preprint arXiv:2505.17464","author":"Tan Xingyu","year":"2025","unstructured":"Xingyu Tan, Xiaoyang Wang, Qing Liu, Xiwei Xu, Xin Yuan, Liming Zhu, and Wenjie Zhang. 2025b. Hydra: Structured Cross-Source Enhanced Large Language Model Reasoning. arXiv preprint arXiv:2505.17464 (2025)."},{"key":"e_1_3_2_1_39_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Veli\u010dkovi\u0107 Petar","year":"2017","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3279920"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714888"},{"key":"e_1_3_2_1_42_1","volume-title":"Efficient influence minimization via node blocking. arXiv preprint arXiv:2405.12871","author":"Wang Jinghao","year":"2024","unstructured":"Jinghao Wang, Yanping Wu, Xiaoyang Wang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2024. Efficient influence minimization via node blocking. arXiv preprint arXiv:2405.12871 (2024)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_1_44_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_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00255"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066244"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0381-6"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467328"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448942"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i21.34450"},{"key":"e_1_3_2_1_53_1","first-page":"30181","article-title":"Efficient graph similarity computation with alignment regularization","volume":"35","author":"Zhuo Wei","year":"2022","unstructured":"Wei Zhuo and Guang Tan. 2022. Efficient graph similarity computation with alignment regularization. Advances in Neural Information Processing Systems, Vol. 35 (2022), 30181-30193.","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"CIKM '25: The 34th ACM International Conference on Information and Knowledge Management","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Seoul Republic of Korea","acronym":"CIKM '25"},"container-title":["Proceedings of the 34th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746252.3761209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T02:47:30Z","timestamp":1765507650000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746252.3761209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":53,"alternative-id":["10.1145\/3746252.3761209","10.1145\/3746252"],"URL":"https:\/\/doi.org\/10.1145\/3746252.3761209","relation":{},"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}