{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:25:35Z","timestamp":1783059935022,"version":"3.54.6"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62502421"],"award-info":[{"award-number":["62502421"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008871","name":"Yunnan Provincial Science and Technology Department","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.eswa.2026.132666","type":"journal-article","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T16:06:22Z","timestamp":1778169982000},"page":"132666","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Exploiting bidirectional Mamba interaction for graph similarity learning"],"prefix":"10.1016","volume":"326","author":[{"given":"Song","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1318-5012","authenticated-orcid":false,"given":"Tao","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8388-3768","authenticated-orcid":false,"given":"Jinming","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoxuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1210-1135","authenticated-orcid":false,"given":"Shengfa","family":"Miao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5457-4147","authenticated-orcid":false,"given":"Ahmed","family":"Zahir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam","family":"Khalid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaowen","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.eswa.2026.132666_bib0001","series-title":"World wide web (WWW)","first-page":"37","article-title":"DDGK: Learning graph representations for deep divergence graph kernels","author":"Al-Rfou","year":"2019"},{"key":"10.1016\/j.eswa.2026.132666_bib0002","series-title":"Advances in neural information processing systems (neurIPS)","first-page":"8141","article-title":"On exact computation with an infinitely wide neural net","author":"Arora","year":"2019"},{"key":"10.1016\/j.eswa.2026.132666_bib0003","series-title":"ACM International conference on web search and data mining (WSDM)","first-page":"384","article-title":"SimGNN: A neural network approach to fast graph similarity computation","author":"Bai","year":"2019"},{"issue":"4","key":"10.1016\/j.eswa.2026.132666_bib0004","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","article-title":"Inexact graph matching for structural pattern recognition","volume":"1","author":"Bunke","year":"1983","journal-title":"Pattern Recognition Letters"},{"issue":"3\u20134","key":"10.1016\/j.eswa.2026.132666_bib0005","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","article-title":"A graph distance metric based on the maximal common subgraph","volume":"19","author":"Bunke","year":"1998","journal-title":"Pattern Recognition Letters"},{"issue":"6","key":"10.1016\/j.eswa.2026.132666_bib0006","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","article-title":"Learning graph matching","volume":"31","author":"Caetano","year":"2009","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/j.eswa.2026.132666_bib0007","series-title":"International ACM SIGIR Conference on research and development in information retrieval (SIGIR)","first-page":"665","article-title":"Interpretable graph similarity computation via differentiable optimal alignment of node embeddings","author":"Doan","year":"2021"},{"key":"10.1016\/j.eswa.2026.132666_bib0008","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.patrec.2018.09.014","article-title":"Error-tolerant graph matching using node contraction","volume":"116","author":"Dwivedi","year":"2018","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/j.eswa.2026.132666_bib0009","series-title":"World wide web (WWW)","first-page":"417","article-title":"Graph neural networks for social recommendation","author":"Fan","year":"2019"},{"key":"10.1016\/j.eswa.2026.132666_bib0010","unstructured":"Fey, M., & Lenssen, J. E. (2019). Fast graph representation learning with PyTorch Geometric. 10.48550\/arXiv.1903.02428."},{"key":"10.1016\/j.eswa.2026.132666_bib0011","series-title":"Conference on language modeling (COLM)","article-title":"Mamba: Linear-time sequence modeling with selective state spaces","author":"Gu","year":"2024"},{"key":"10.1016\/j.eswa.2026.132666_bib0012","series-title":"European conference on computer vision (ECCV)","first-page":"653","article-title":"Neural graph matching networks for fewshot 3d action recognition","author":"Guo","year":"2018"},{"key":"10.1016\/j.eswa.2026.132666_bib0013","series-title":"CGMN: A contrastive graph matching network for self-supervised graph similarity learning","first-page":"2101","author":"Jin","year":"2022"},{"key":"10.1016\/j.eswa.2026.132666_bib0014","series-title":"International conference on medical image computing and computer-assisted intervention (MICCAI)","first-page":"469","article-title":"Distance metric learning using graph convolutional networks: Application to functional brain networks","author":"Ktena","year":"2017"},{"issue":"11","key":"10.1016\/j.eswa.2026.132666_bib0015","doi-asserted-by":"crossref","first-page":"6588","DOI":"10.1109\/TKDE.2024.3387044","article-title":"More interpretable graph similarity computation via maximum common subgraph inference","volume":"36","author":"Lan","year":"2024","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.eswa.2026.132666_bib0016","series-title":"International conference on machine learning (ICML)","first-page":"3835","article-title":"Graph matching networks for learning the similarity of graph structured objects","author":"Li","year":"2019"},{"issue":"2","key":"10.1016\/j.eswa.2026.132666_bib0017","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1109\/TNNLS.2021.3102234","article-title":"Multilevel graph matching networks for deep graph similarity learning","volume":"34","author":"Ling","year":"2021","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"10.1016\/j.eswa.2026.132666_bib0018","first-page":"277","article-title":"Graph neural networks: Graph matching","author":"Ling","year":"2022","journal-title":"Graph Neural Networks: Foundations, Frontiers, and Applications"},{"issue":"1","key":"10.1016\/j.eswa.2026.132666_bib0019","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00500-023-09288-1","article-title":"DeepSIM: A novel deep learning method for graph similarity computation","volume":"28","author":"Liu","year":"2024","journal-title":"Soft Computing"},{"issue":"04","key":"10.1016\/j.eswa.2026.132666_bib0020","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1142\/S0217595904000333","article-title":"Experimental analysis of some variants of vogel\u2019s approximation method","volume":"21","author":"Mathirajan","year":"2004","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.132666_bib0021","series-title":"Structural, syntactic, and statistical pattern recognition (s+SSPR)","first-page":"163","article-title":"Fast suboptimal algorithms for the computation of graph edit distance","author":"Neuhaus","year":"2006"},{"key":"10.1016\/j.eswa.2026.132666_bib0022","series-title":"Conference on neural information processing systems (neurIPS)","first-page":"22518","article-title":"GREED: A neural framework for learning graph distance functions","author":"Ranjan","year":"2022"},{"key":"10.1016\/j.eswa.2026.132666_bib0023","series-title":"International conference on pattern recognition (ICPR)","first-page":"2239","article-title":"Learning graph distances with message passing neural networks","author":"Riba","year":"2018"},{"issue":"7","key":"10.1016\/j.eswa.2026.132666_bib0024","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","article-title":"Approximate graph edit distance computation by means of bipartite graph matching","volume":"27","author":"Riesen","year":"2009","journal-title":"Image and Vision Computing"},{"key":"10.1016\/j.eswa.2026.132666_bib0025","series-title":"Graph-based representations in pattern recognition (gbRPR)","first-page":"142","article-title":"A novel software toolkit for graph edit distance computation","author":"Riesen","year":"2013"},{"issue":"1","key":"10.1016\/j.eswa.2026.132666_bib0026","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","article-title":"The graph neural network model","volume":"20","author":"Scarselli","year":"2009","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/j.eswa.2026.132666_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.110739","article-title":"Exploring attention mechanism for graph similarity learning","volume":"276","author":"Tan","year":"2023","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/j.eswa.2026.132666_bib0028","unstructured":"Wang, S., Chen, Z., Yu, X., Li, D., Ni, J., Tang, L.-A., Gui, J., Li, Z., Chen, H., & Yu, P. S. (2019). Heterogeneous graph matching networks. 10.48550\/arXiv.1910.08074."},{"issue":"6","key":"10.1016\/j.eswa.2026.132666_bib0029","doi-asserted-by":"crossref","first-page":"11106","DOI":"10.1109\/TNNLS.2024.3513546","article-title":"Exploring attention and self-supervised learning mechanism for graph similarity learning","volume":"36","author":"Wen","year":"2025","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"10.1016\/j.eswa.2026.132666_bib0030","series-title":"IEEE International conference on data mining (ICDM)","first-page":"721","article-title":"gSpan: Graph-based substructure pattern mining","author":"Yan","year":"2002"},{"key":"10.1016\/j.eswa.2026.132666_bib0031","series-title":"ACM SIGKDD Conference on knowledge discovery and data mining (SIGKDD)","first-page":"1365","article-title":"Deep graph kernels","author":"Yanardag","year":"2015"},{"key":"10.1016\/j.eswa.2026.132666_bib0032","series-title":"AAAI Conference on artificial intelligence (AAAI)","first-page":"3219","article-title":"Learning-based efficient graph similarity computation via multi-scale convolutional set matching","author":"Yunsheng","year":"2020"},{"key":"10.1016\/j.eswa.2026.132666_bib0033","series-title":"ACM SIGKDD Conference on knowledge discovery and data mining (SIGKDD)","first-page":"2274","article-title":"H2MN: Graph similarity learning with hierarchical hypergraph matching networks","author":"Zhang","year":"2021"},{"issue":"1","key":"10.1016\/j.eswa.2026.132666_bib0034","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103932","article-title":"Graph similarity learning for cross-level interactions","volume":"62","author":"Zou","year":"2025","journal-title":"Information Processing and Management"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426015794?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426015794?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:07:36Z","timestamp":1783058856000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417426015794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":34,"alternative-id":["S0957417426015794"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2026.132666","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exploiting bidirectional Mamba interaction for graph similarity learning","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2026.132666","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"132666"}}