{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T19:01:51Z","timestamp":1764788511842,"version":"3.46.0"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korea Government","award":["RS-2021-NR059723","RS-2023-00220762"],"award-info":[{"award-number":["RS-2021-NR059723","RS-2023-00220762"]}]},{"name":"ACM International Conference on Information and Knowledge Management"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tnse.2025.3596908","type":"journal-article","created":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T17:45:33Z","timestamp":1754588733000},"page":"1510-1526","source":"Crossref","is-referenced-by-count":0,"title":["Centrality-Based Node Feature Augmentation for Robust Network Alignment"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7906-8475","authenticated-orcid":false,"given":"Jin-Duk","family":"Park","sequence":"first","affiliation":[{"name":"School of Mathematics and Computing (Computational Science and Engineering), Yonsei University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9467-4978","authenticated-orcid":false,"given":"Cong","family":"Tran","sequence":"additional","affiliation":[{"name":"Faculty of Artificial Intelligence, Posts and Telecommunications Institute of Technology, Hanoi, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6533-3469","authenticated-orcid":false,"given":"Won-Yong","family":"Shin","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computing (Computational Science and Engineering), Yonsei University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3519-7013","authenticated-orcid":false,"given":"Xin","family":"Cao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00015"},{"key":"ref3","first-page":"1823","article-title":"Predict anchor links across social networks via an embedding approach","volume-title":"Proc. 25th Int. Joint Conf. Artif. Intell.","author":"Man","year":"2016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412136"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109939"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3300877"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505531"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623643"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486231"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/312"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.074"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2997861"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018668"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00174"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403063"},{"article-title":"Topological regularization for graph neural networks augmentation","year":"2021","author":"Song","key":"ref19"},{"key":"ref20","first-page":"1","article-title":"Weisfeiler and Leman go infinite: Spectral and combinatorial pre-colorings","volume-title":"Proc. ICLR Workshop Geometrical Topological Representation Learn.","author":"Feldman","year":"2022"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2023.3288872"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-022-00949-5"},{"key":"ref26","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0197-0"},{"issue":"2","key":"ref28","first-page":"138","article-title":"Graph data augmentation for graph machine learning: A survey","volume":"47","author":"Zhao","year":"2023","journal-title":"IEEE Data Eng. Bull."},{"key":"ref29","first-page":"14054","article-title":"Local augmentation for graph neural networks","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Liu","year":"2022"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.135"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.152"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467227"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3277843"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2024.3355479"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271705"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467332"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3201102"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3101840"},{"key":"ref40","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton","year":"2017"},{"key":"ref41","first-page":"1","article-title":"How powerful are graph neural networks","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Xu","year":"2019"},{"key":"ref42","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Learn. Representations","author":"Velickovic","year":"2018"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00021"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1972.9989806"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"article-title":"The PageRank citation ranking: Bringing order to the web","year":"1999","author":"Page","key":"ref47"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78512-7_10"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.008"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557605"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017012"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-023-01456-4"},{"issue":"9","key":"ref56","first-page":"12","article-title":"The reduction of a graph to canonical form and the algebra which appears therein","volume":"2","author":"Weisfeiler","year":"1968","journal-title":"NTI Ser."},{"key":"ref57","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Gilmer","year":"2017"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512100"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2984762"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3284359"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4_7"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/11264281\/11119820.pdf?arnumber=11119820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:44:00Z","timestamp":1764787440000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11119820\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/tnse.2025.3596908","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2026]]}}}