{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T16:46:00Z","timestamp":1776876360956,"version":"3.51.2"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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":["62536006"],"award-info":[{"award-number":["62536006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106131"],"award-info":[{"award-number":["62106131"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62576198"],"award-info":[{"award-number":["62576198"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272285"],"award-info":[{"award-number":["62272285"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472270"],"award-info":[{"award-number":["62472270"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.asoc.2026.115182","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T07:43:06Z","timestamp":1775634186000},"page":"115182","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Stability-aware robust deep graph matching with outliers"],"prefix":"10.1016","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3431-0432","authenticated-orcid":false,"given":"Yu","family":"Xie","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9269-3988","authenticated-orcid":false,"given":"Zhiqiang","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1294-5832","authenticated-orcid":false,"given":"Hangyuan","family":"Du","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1218-2804","authenticated-orcid":false,"given":"Ming","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2026.115182_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.112117","article-title":"Boundary points guided 3D object detection for point clouds","volume":"165","author":"Tang","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115182_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.112680","article-title":"Unsupervised discovery of 3D structural elements for scanned indoor scenes","volume":"170","author":"Anti\u0107","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115182_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111839","article-title":"RCFI-Net: a reliable correspondences evaluation and feature interaction network for fast and accurate point cloud registration","volume":"163","author":"Zhang","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115182_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112929","article-title":"Deep learning based automated vein recognition using swin transformer and super graph glue model","volume":"310","author":"Bhushan","year":"2025","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.asoc.2026.115182_bib0025","doi-asserted-by":"crossref","first-page":"97650","DOI":"10.52202\/079017-3098","article-title":"Classic GNNs are strong baselines: reassessing GNNs for node classification","volume":"37","author":"Luo","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2026.115182_bib0030","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence, no. 13","first-page":"14964","article-title":"Structural information enhanced graph representation for link prediction","author":"Shi","year":"2024"},{"key":"10.1016\/j.asoc.2026.115182_bib0035","article-title":"SEGMN: a structure-enhanced graph matching network for graph similarity learning","author":"Wang","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.asoc.2026.115182_bib0040","series-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","first-page":"2083","article-title":"Finding matches in a haystack: a max-pooling strategy for graph matching in the presence of outliers","author":"Cho","year":"2014"},{"key":"10.1016\/j.asoc.2026.115182_bib0045","series-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition","first-page":"3033","article-title":"Zero-assignment constraint for graph matching with outliers","author":"Wang","year":"2020"},{"issue":"11","key":"10.1016\/j.asoc.2026.115182_bib0050","first-page":"2737","article-title":"A functional representation for graph matching","volume":"42","author":"Wang","year":"2019","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.asoc.2026.115182_bib0055","author":"Jiang"},{"key":"10.1016\/j.asoc.2026.115182_bib0060","author":"Liu"},{"key":"10.1016\/j.asoc.2026.115182_bib0065","series-title":"IJCAI","first-page":"966","article-title":"Adaptive edge attention for graph matching with outliers","author":"Qu","year":"2021"},{"key":"10.1016\/j.asoc.2026.115182_bib0070","series-title":"Tenth IEEE International Conference on Computer Vision (ICCV\u201905)","first-page":"1482","article-title":"A spectral technique for correspondence problems using pairwise constraints","author":"Leordeanu","year":"2005"},{"issue":"11","key":"10.1016\/j.asoc.2026.115182_bib0075","doi-asserted-by":"crossref","first-page":"1236","DOI":"10.1109\/34.730557","article-title":"Graph matching with a dual-step em algorithm","volume":"20","author":"Cross","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"10.1016\/j.asoc.2026.115182_bib0080","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.patcog.2005.06.014","article-title":"Graph matching and clustering using spectral partitions","volume":"39","author":"Qiu","year":"2006","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.asoc.2026.115182_bib0085","series-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","first-page":"2684","article-title":"Deep learning of graph matching","author":"Zanfir","year":"2018"},{"key":"10.1016\/j.asoc.2026.115182_bib0090","series-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision","first-page":"3056","article-title":"Learning combinatorial embedding networks for deep graph matching","author":"Wang","year":"2019"},{"key":"10.1016\/j.asoc.2026.115182_bib0095","series-title":"European Conference on Computer Vision","first-page":"407","article-title":"Deep graph matching via blackbox differentiation of combinatorial solvers","author":"Rol\u00ednek","year":"2020"},{"issue":"9","key":"10.1016\/j.asoc.2026.115182_bib0100","first-page":"5261","article-title":"Neural graph matching network: learning lawler\u2019s quadratic assignment problem with extension to hypergraph and multiple-graph matching","volume":"44","author":"Wang","year":"2021","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.asoc.2026.115182_bib0105","series-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision","first-page":"23362","article-title":"Graph matching with bi-level noisy correspondence","author":"Lin","year":"2023"},{"key":"10.1016\/j.asoc.2026.115182_bib0110","series-title":"The Thirteenth International Conference on Learning Representations","article-title":"Learning structured universe graph with outlier OOD detection for partial matching","author":"Jiang","year":"2025"},{"key":"10.1016\/j.asoc.2026.115182_bib0115","series-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision","first-page":"8321","article-title":"Unsupervised graph association for person re-identification","author":"Wu","year":"2019"},{"issue":"6","key":"10.1016\/j.asoc.2026.115182_bib0120","doi-asserted-by":"crossref","first-page":"2040","DOI":"10.1109\/TCBB.2019.2914050","article-title":"MPGM: scalable and accurate multiple network alignment","volume":"17","author":"Kazemi","year":"2019","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"1","key":"10.1016\/j.asoc.2026.115182_bib0125","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s11263-011-0442-2","article-title":"Unsupervised learning for graph matching","author":"Leordeanu","year":"2012","journal-title":"Int. J. Comput. Vis."},{"key":"10.1016\/j.asoc.2026.115182_bib0130","series-title":"European Conference on Computer Vision","first-page":"370","article-title":"Self-supervised learning of visual graph matching","author":"Liu","year":"2022"},{"key":"10.1016\/j.asoc.2026.115182_bib0135","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence, no. 6","first-page":"7784","article-title":"Self-supervised bidirectional learning for graph matching","author":"Guo","year":"2023"},{"issue":"8","key":"10.1016\/j.asoc.2026.115182_bib0140","doi-asserted-by":"crossref","first-page":"10500","DOI":"10.1109\/TPAMI.2023.3257830","article-title":"Unsupervised learning of graph matching with mixture of modes via discrepancy minimization","volume":"45","author":"Wang","year":"2023","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.asoc.2026.115182_bib0145","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence, no. 6","first-page":"5252","article-title":"Discrete cycle-consistency based unsupervised deep graph matching","author":"Tourani","year":"2024"},{"key":"10.1016\/j.asoc.2026.115182_bib0150","series-title":"International Symposium on Visual Computing","first-page":"287","article-title":"CLAP: concave linear approximation for quadratic graph matching","author":"Liang","year":"2024"},{"issue":"9","key":"10.1016\/j.asoc.2026.115182_bib0155","doi-asserted-by":"crossref","first-page":"3633","DOI":"10.1007\/s11263-024-02040-8","article-title":"Ensemble quadratic assignment network for graph matching","volume":"132","author":"Tan","year":"2024","journal-title":"Int. J. Comput. Vis."},{"issue":"2","key":"10.1016\/j.asoc.2026.115182_bib0160","doi-asserted-by":"crossref","first-page":"464","DOI":"10.3934\/fods.2024034","article-title":"Graph matching via convex relaxation to the simplex","volume":"7","author":"Araya","year":"2023","journal-title":"Found. Data Sci."},{"issue":"1","key":"10.1016\/j.asoc.2026.115182_bib0165","article-title":"Very deep convolutional networks for large-scale image recognition","volume":"2","author":"Donelly","year":"2012","journal-title":"Int. J. Artif. Intell. Mach. Learn."},{"issue":"9","key":"10.1016\/j.asoc.2026.115182_bib0170","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1109\/TPAMI.2015.2501802","article-title":"Factorized graph matching","volume":"38","author":"Zhou","year":"2015","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.asoc.2026.115182_bib0175","doi-asserted-by":"crossref","first-page":"51706","DOI":"10.52202\/075280-2252","article-title":"A robust exact algorithm for the Euclidean bipartite matching problem","volume":"36","author":"Gattani","year":"2023","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2026.115182_bib0180","series-title":"Findings of the Association for Computational Linguistics: NAACL 2025","first-page":"4521","article-title":"Rethinking smoothness for fast and adaptable entity alignment decoding","author":"Wang","year":"2025"},{"key":"10.1016\/j.asoc.2026.115182_bib0185","series-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition","first-page":"17638","article-title":"Adaptive softassign via hadamard-equipped sinkhorn","author":"Shen","year":"2024"},{"key":"10.1016\/j.asoc.2026.115182_bib0190","first-page":"19908","article-title":"Graduated assignment for joint multi-graph matching and clustering with application to unsupervised graph matching network learning","volume":"33","author":"Wang","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2026.115182_bib0195","series-title":"Proceedings of the 33rd ACM International Conference on Information and Knowledge Management","first-page":"3772","article-title":"Rece: reduced cross-entropy loss for large-catalogue sequential recommenders","author":"Gusak","year":"2024"},{"key":"10.1016\/j.asoc.2026.115182_bib0200","series-title":"2024 IEEE International Conference on Image Processing (ICIP)","first-page":"479","article-title":"Adaptive adversarial cross-entropy loss for sharpness-aware minimization","author":"Ratchatorn","year":"2024"},{"key":"10.1016\/j.asoc.2026.115182_bib0205","series-title":"Asian Conference on Machine Learning","first-page":"895","article-title":"Maximization of minimum weighted hamming distance between set pairs","author":"Matsuoka","year":"2024"},{"issue":"2","key":"10.1016\/j.asoc.2026.115182_bib0210","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s11263-009-0275-4","article-title":"The pascal visual object classes (VOC) challenge","volume":"88","author":"Everingham","year":"2010","journal-title":"Int. J. Comput. Vis."},{"key":"10.1016\/j.asoc.2026.115182_bib0215","series-title":"The Caltech-UCSD birds-200-2011 dataset","author":"Wah","year":"2011"},{"key":"10.1016\/j.asoc.2026.115182_bib0220","series-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition","first-page":"6272","article-title":"Deep learning of partial graph matching via differentiable top-k","author":"Wang","year":"2023"},{"key":"10.1016\/j.asoc.2026.115182_bib0225","series-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition","first-page":"2343","article-title":"Graph-context attention networks for size-varied deep graph matching","author":"Jiang","year":"2022"},{"key":"10.1016\/j.asoc.2026.115182_bib0230","series-title":"The Thirteenth International Conference on Learning Representations","article-title":"Learning partial graph matching via optimal partial transport","author":"Ratnayaka","year":"2025"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626006307?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626006307?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T16:01:48Z","timestamp":1776873708000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626006307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":46,"alternative-id":["S1568494626006307"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115182","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Stability-aware robust deep graph matching with outliers","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115182","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115182"}}