{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T20:32:08Z","timestamp":1773693128026,"version":"3.50.1"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272008"],"award-info":[{"award-number":["62272008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Peking University-China Telecom Joint Laboratory for Big Data"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tkde.2025.3583059","type":"journal-article","created":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T14:25:09Z","timestamp":1750861509000},"page":"5141-5157","source":"Crossref","is-referenced-by-count":1,"title":["DeepNM: Incremental Graph Matching Based on Sinkhorn Similarity"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5483-9309","authenticated-orcid":false,"given":"Yikuan","family":"Xia","sequence":"first","affiliation":[{"name":"Key Laboratory of High Confidence Software Technologies, CS, Peking University, Hai Dian Qu, Beijing, China"}]},{"given":"Jiazun","family":"Chen","sequence":"additional","affiliation":[{"name":"Key Laboratory of High Confidence Software Technologies, CS, Peking University, Hai Dian Qu, Beijing, China"}]},{"given":"Xinchi","family":"Li","sequence":"additional","affiliation":[{"name":"Big data and Artificial Intelligence, China Telecom Research Institute, Changping, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6750-8496","authenticated-orcid":false,"given":"Jun","family":"Gao","sequence":"additional","affiliation":[{"name":"Key Laboratory of High Confidence Software Technologies, CS, Peking University, Hai Dian Qu, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.074"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"key":"ref4","first-page":"1823","article-title":"Predict anchor links across social networks via an embedding approach","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Man"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1032"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794371"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0437-z"},{"key":"ref9","first-page":"3835","article-title":"Graph matching networks for learning the similarity of graph structured objects","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref10","first-page":"3888","article-title":"Deep graph matching consensus","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Fey"},{"key":"ref11","first-page":"6815","article-title":"Stochastic iterative graph matching","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/312"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482353"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557605"},{"key":"ref15","first-page":"2713","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Welling"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref17","first-page":"9104","article-title":"How powerful are graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref24","article-title":"Survey of nearest neighbor techniques","author":"Bhatia","year":"2010"},{"key":"ref25","first-page":"1774","article-title":"Aligning users across social networks using network embedding","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Liu"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00284"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00315"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/733"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994702"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502415960"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2012-00556"},{"key":"ref33","article-title":"Ranking via sinkhorn propagation","author":"Adams","year":"2011"},{"key":"ref34","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cuturi"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3005590"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3078053"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20934"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16606"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3300877"},{"key":"ref41","first-page":"214","article-title":"Wasserstein generative adversarial networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Arjovsky"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512089"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-73003-5_196"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.2307\/2984875"},{"key":"ref45","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref46","first-page":"9104","article-title":"How powerful are graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref47","article-title":"A generalization of transformer networks to graphs","author":"Dwivedi","year":"2020"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref49","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref50","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref51","first-page":"8026","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Paszke"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00129"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11119623\/11051053.pdf?arnumber=11051053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T20:50:17Z","timestamp":1754945417000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11051053\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":52,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3583059","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}