{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T14:00:16Z","timestamp":1762783216145,"version":"3.33.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Key Research and Development Program of Xianyang.","award":["Grant No. : S2023-ZDYF-QYCX-1794"],"award-info":[{"award-number":["Grant No. : S2023-ZDYF-QYCX-1794"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-06917-4","type":"journal-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:30:24Z","timestamp":1737354624000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust graph neural networks based on feature fusion"],"prefix":"10.1007","volume":"81","author":[{"given":"Yan","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoyu","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaiye","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,20]]},"reference":[{"key":"6917_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbi.2023.102538","volume":"79","author":"P Veli\u010dkovi\u0107","year":"2023","unstructured":"Veli\u010dkovi\u0107 P (2023) Everything is connected: graph neural networks. Curr Opin Struct Biol 79:102538","journal-title":"Curr Opin Struct Biol"},{"issue":"1","key":"6917_CR2","first-page":"1","volume":"56","author":"J Vatter","year":"2023","unstructured":"Vatter J, Mayer R, Jacobsen H-A (2023) The evolution of distributed systems for graph neural networks and their origin in graph processing and deep learning: A survey. ACM Comput Sur 56(1):1\u201337","journal-title":"ACM Comput Sur"},{"issue":"2","key":"6917_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1561\/2200000096","volume":"16","author":"L Wu","year":"2023","unstructured":"Wu L, Chen Y, Shen K, Guo X, Gao H, Li S, Pei J, Long B et al (2023) Graph neural networks for natural language processing A survey. Found Trends Mach Learn 16(2):119\u2013328","journal-title":"Found Trends Mach Learn"},{"key":"6917_CR4","doi-asserted-by":"crossref","unstructured":"Jin M, Koh HY, Wen Q, Zambon D, Alippi C, Webb GI, King I, Pan S (2024) A survey on graph neural networks for time series: Forecasting, classification, imputation, and anomaly detection. In: IEEE Transactions on Pattern Analysis and Machine Intelligence.","DOI":"10.1109\/TPAMI.2024.3443141"},{"issue":"10","key":"6917_CR5","first-page":"1561","volume":"36","author":"J Cremer","year":"2023","unstructured":"Cremer J, Medrano Sandonas L, Tkatchenko A, Clevert D-A, De Fabritiis G (2023) Equivariant graph neural networks for toxicity prediction. Chem Res Toxicol 36(10):1561\u20131573","journal-title":"Chem Res Toxicol"},{"key":"6917_CR6","unstructured":"Wang X, Zhang M (2022) How powerful are spectral graph neural networks. In: International Conference on Machine Learning, pp. 23341\u201323362 . PMLR."},{"key":"6917_CR7","unstructured":"Bo D, Shi C, Wang L, Liao R (2023) Specformer: Spectral graph neural networks meet transformers. arXiv preprint arXiv:2303.01028."},{"key":"6917_CR8","unstructured":"You Y, Chen T, Wang Z, Shen Y (2023) Graph domain adaptation via theory-grounded spectral regularization. In: The Eleventh International Conference on Learning Representations."},{"key":"6917_CR9","doi-asserted-by":"crossref","unstructured":"Han P, Wang J, Yao D, Shang S, Zhang X (2021) A graph-based approach for trajectory similarity computation in spatial networks. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 556\u2013564.","DOI":"10.1145\/3447548.3467337"},{"key":"6917_CR10","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.neucom.2021.03.024","volume":"445","author":"H Zhou","year":"2021","unstructured":"Zhou H, Ren D, Xia H, Fan M, Yang X, Huang H (2021) Ast-gnn: An attention-based spatio-temporal graph neural network for interaction-aware pedestrian trajectory prediction. Neurocomputing 445:298\u2013308","journal-title":"Neurocomputing"},{"key":"6917_CR11","unstructured":"Zhao K, Kang Q, Song Y, She R, Wang S, Tay WP (2024) Adversarial robustness in graph neural networks: a hamiltonian approach. In: Advances in Neural Information Processing Systems 36."},{"key":"6917_CR12","first-page":"8954","volume":"35","author":"F Mujkanovic","year":"2022","unstructured":"Mujkanovic F, Geisler S, G\u00fcnnemann S, Bojchevski A (2022) Are defenses for graph neural networks robust? Adv Neural Inf Process Syst 35:8954\u20138968","journal-title":"Adv Neural Inf Process Syst"},{"key":"6917_CR13","doi-asserted-by":"crossref","unstructured":"Zhu D, Zhang Z, Cui P, Zhu W (2019) Robust graph convolutional networks against adversarial attacks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1399\u20131407.","DOI":"10.1145\/3292500.3330851"},{"key":"6917_CR14","doi-asserted-by":"crossref","unstructured":"Jin W, Ma Y, Liu X, Tang X, Wang S, Tang J (2020) Graph structure learning for robust graph neural networks. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 66\u201374.","DOI":"10.1145\/3394486.3403049"},{"issue":"9","key":"6917_CR15","first-page":"4935","volume":"44","author":"B Jiang","year":"2021","unstructured":"Jiang B, Wang B, Tang J, Luo B (2021) Gecns: graph elastic convolutional networks for data representation. IEEE Trans Pattern Analy Mach Intell 44(9):4935\u20134947","journal-title":"IEEE Trans Pattern Analy Mach Intell"},{"key":"6917_CR16","first-page":"13272","volume":"33","author":"S Geisler","year":"2020","unstructured":"Geisler S, Z\u00fcgner D, G\u00fcnnemann S (2020) Reliable graph neural networks via robust aggregation. Adv Neural Inf Process Syst 33:13272\u201313284","journal-title":"Adv Neural Inf Process Syst"},{"key":"6917_CR17","first-page":"9720","volume":"34","author":"X Liu","year":"2021","unstructured":"Liu X, Ding J, Jin W, Xu H, Ma Y, Liu Z, Tang J (2021) Graph neural networks with adaptive residual. Adv Neural Inf Process Syst 34:9720\u20139733","journal-title":"Adv Neural Inf Process Syst"},{"key":"6917_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2024.106276","volume":"175","author":"Q Tao","year":"2024","unstructured":"Tao Q, Liao J, Zhang E, Li L (2024) A dual robust graph neural network against graph adversarial attacks. Neural Netw 175:106276","journal-title":"Neural Netw"},{"key":"6917_CR19","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1007\/s11633-024-1510-8","volume":"21","author":"E Dai","year":"2024","unstructured":"Dai E, Zhao T, Zhu H, Xu J, Guo Z, Liu H, Tang J, Wang S (2024) A comprehensive survey on trustworthy graph neural networks: privacy, robustness, fairness, and explainability. Mach Intell Res 21:1011\u20131061","journal-title":"Mach Intell Res"},{"key":"6917_CR20","doi-asserted-by":"crossref","unstructured":"Qian S, Ying H, Hu R, Zhou J, Chen J, Chen DZ, Wu J (2023) Robust training of graph neural networks via noise governance. In: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, pp. 607\u2013615.","DOI":"10.1145\/3539597.3570369"},{"key":"6917_CR21","doi-asserted-by":"publisher","first-page":"3699","DOI":"10.1109\/TSP.2021.3087905","volume":"69","author":"S Chen","year":"2021","unstructured":"Chen S, Eldar YC, Zhao L (2021) Graph unrolling networks: interpretable neural networks for graph signal denoising. IEEE Trans Sig Process 69:3699\u20133713","journal-title":"IEEE Trans Sig Process"},{"key":"6917_CR22","doi-asserted-by":"crossref","unstructured":"Ma Y, Liu X, Zhao T, Liu Y, Tang, J, Shah N (2021) A unified view on graph neural networks as graph signal denoising. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 1202\u20131211.","DOI":"10.1145\/3459637.3482225"},{"key":"6917_CR23","unstructured":"Fu G, Hou Y, Zhang J, Ma K, Kamhoua BF, Cheng J (2020) Understanding graph neural networks from graph signal denoising perspectives. arXiv preprint arXiv:2006.04386."},{"key":"6917_CR24","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907."},{"key":"6917_CR25","doi-asserted-by":"crossref","unstructured":"Dong H, Chen J, Feng F, He X, Bi S, Ding Z, Cui P (2021) On the equivalence of decoupled graph convolution network and label propagation. In: Proceedings of the Web Conference 2021, pp. 3651\u20133662.","DOI":"10.1145\/3442381.3449927"},{"key":"6917_CR26","unstructured":"Gasteiger J, Bojchevski A, G\u00fcnnemann S (2018) Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997."},{"issue":"3","key":"6917_CR27","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh N, Boyd S et al (2014) Proximal algorithms. Found Trends Optim 1(3):127\u2013239","journal-title":"Found Trends Optim"},{"issue":"2","key":"6917_CR28","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat L (2013) A primal-dual splitting method for convex optimization involving lipschitzian, proximable and linear composite terms. J Optim Theory Appl 158(2):460\u2013479","journal-title":"J Optim Theory Appl"},{"key":"6917_CR29","volume-title":"Spectral graph theory","author":"FR Chung","year":"1997","unstructured":"Chung FR (1997) Spectral graph theory, vol 92. American Mathematical Soc, Rhode Island"},{"key":"6917_CR30","unstructured":"Brody S, Alon U, Yahav E (2021) How attentive are graph attention networks? arXiv preprint arXiv:2105.14491."},{"issue":"3","key":"6917_CR31","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93\u201393","journal-title":"AI Mag"},{"key":"6917_CR32","unstructured":"Shchur O, Mumme M., Bojchevski A, G\u00fcnnemann S (2018) Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868."},{"key":"6917_CR33","unstructured":"Velickovic P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y et al (2017) Graph attention networks. Stat 1050(20):10\u201348550."},{"key":"6917_CR34","unstructured":"Xu K, Li C, Tian Y, Sonobe T, Kawarabayashi K-i, Jegelka S (2018) Representation learning on graphs with jumping knowledge networks. In: International Conference on Machine Learning, pp. 5453\u20135462 . PMLR."},{"key":"6917_CR35","doi-asserted-by":"crossref","unstructured":"Z\u00fcgner D, Akbarnejad A, G\u00fcnnemann S (2018) Adversarial attacks on neural networks for graph data. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2847\u20132856.","DOI":"10.1145\/3219819.3220078"},{"key":"6917_CR36","unstructured":"Li Y, Jin W, Xu H, Tang J (2020) Deeprobust: A pytorch library for adversarial attacks and defenses. arXiv preprint arXiv:2005.06149."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06917-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-06917-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06917-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:30:37Z","timestamp":1737354637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-06917-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,20]]},"references-count":36,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,1]]}},"alternative-id":["6917"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-06917-4","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,20]]},"assertion":[{"value":"1 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no potential conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This research adheres to high ethical standards and respects the informed consent rights of all participants. The data used are sourced from publicly available repositories or with explicit authorization for private data. The datasets generated during and analyzed during the current study are available from the corresponding author on reasonable request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}}],"article-number":"406"}}