{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:09:56Z","timestamp":1777954196293,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T00:00:00Z","timestamp":1770681600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T00:00:00Z","timestamp":1775606400000},"content-version":"vor","delay-in-days":57,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2023YFF0905404"],"award-info":[{"award-number":["2023YFF0905404"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2023YFF0905404"],"award-info":[{"award-number":["2023YFF0905404"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2023YFF0905404"],"award-info":[{"award-number":["2023YFF0905404"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2023YFF0905404"],"award-info":[{"award-number":["2023YFF0905404"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s44443-026-00514-y","type":"journal-article","created":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T10:34:33Z","timestamp":1770719673000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ARN-GAT: an adaptive node and relation modeling framework for patent knowledge graph topic identification"],"prefix":"10.1007","volume":"38","author":[{"given":"Weizhong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,10]]},"reference":[{"issue":"1","key":"514_CR1","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/TNSE.2018.2884235","volume":"7","author":"M Avella-Medina","year":"2018","unstructured":"Avella-Medina M, Parise F, Schaub MT (2018) Segarra S Centrality measures for graphons: Accounting for uncertainty in networks. IEEE Trans Netw Sci Eng 7(1):520\u2013537. https:\/\/doi.org\/10.1109\/TNSE.2018.2884235","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"1","key":"514_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","volume":"27","author":"SP Borgatti","year":"2005","unstructured":"Borgatti SP (2005) Centrality and network flow. Soc Netw 27(1):55\u201371. https:\/\/doi.org\/10.1016\/j.socnet.2004.11.008","journal-title":"Soc Netw"},{"key":"514_CR3","unstructured":"Brody S, Alon U, Yahav E (2022) How attentive are graph attention networks? In: International conference on learning representations. https:\/\/openreview.net\/forum?id=F72ximsx7C1"},{"key":"514_CR4","doi-asserted-by":"crossref","unstructured":"Cheng D, Wang X, Zhang Y, Zhang L (2020b) Risk guarantee prediction in networked-loans. In: Proceedings of the 29th international joint conference on artificial intelligence (IJCAI), pp 2613\u20132619","DOI":"10.24963\/ijcai.2020\/618"},{"key":"514_CR5","doi-asserted-by":"crossref","unstructured":"Chen C, Liu X, Xu S, Zhang M, Wang X, Lin X (2021) Critical nodes identification in large networks: An inclination-based model. In: International conference on web information systems engineering. Springer, pp 453\u2013468","DOI":"10.1007\/978-3-030-90888-1_35"},{"key":"514_CR6","doi-asserted-by":"publisher","unstructured":"Chen C, Wang W, Wang X (2016) Efficient maximum closeness centrality group identification. In: Australasian database conference, pp 43\u201355. https:\/\/doi.org\/10.1007\/978-3-319-46922-5_4","DOI":"10.1007\/978-3-319-46922-5_4"},{"key":"514_CR7","unstructured":"Chen M, Wei Z, Huang Z, Ding B, Li Y (2020) Simple and deep graph convolutional networks. arXiv:2007.02133"},{"key":"514_CR8","unstructured":"Chen Y, Wu L, Zaki M (2020a) Iterative deep graph learning for graph neural networks: Better and robust node embeddings. In: Proceedings of the 34th international conference on neural information processing systems (NeurIPS)"},{"key":"514_CR9","unstructured":"Chen M, Zhang Y, Kou X, Li Y, Zhang Y (2021) r-gat: Relational graph attention network for multi-relational graphs. arXiv:2109.05922"},{"issue":"1","key":"514_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1038\/s43586-024-00294-7","volume":"4","author":"G Corso","year":"2024","unstructured":"Corso G, Stark H, Jegelka S, Jaakkola T (2024) Barzilay R Graph neural networks. Nat Rev Methods Primers 4(1):17","journal-title":"Nat Rev Methods Primers"},{"issue":"1","key":"514_CR11","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/TNET.2009.2022369","volume":"18","author":"D Fay","year":"2009","unstructured":"Fay D, Haddadi H, Thomason A, Moore AW, Mortier R, Jamakovic A, Uhlig S (2009) Rio M Weighted spectral distribution for internet topology analysis: Theory and applications. IEEE\/ACM Trans Netw 18(1):164\u2013176","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"6","key":"514_CR12","doi-asserted-by":"publisher","first-page":"5915","DOI":"10.1109\/TKDE.2022.3163672","volume":"35","author":"S Freitas","year":"2023","unstructured":"Freitas S, Yang D, Kumar S, Tong H, Chau DH (2023) Graph vulnerability and robustness: A survey. IEEE Trans Knowl Data Eng 35(6):5915\u20135934. https:\/\/doi.org\/10.1109\/TKDE.2022.3163672","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"514_CR13","unstructured":"Glorot X, Bordes A, Bengio Y (2011) Deep sparse rectifier neural networks. In: Proceedings of the 14th international conference on artificial intelligence and statistics (AISTATS), pp 315\u2013323"},{"key":"514_CR14","doi-asserted-by":"publisher","unstructured":"Gori M, Monfardini G, Scarselli F (2005) A new model for learning in graph domains. In: Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN), vol 2, pp 729\u2013734. https:\/\/doi.org\/10.1109\/IJCNN.2005.1555942","DOI":"10.1109\/IJCNN.2005.1555942"},{"issue":"8","key":"514_CR15","doi-asserted-by":"publisher","first-page":"3549","DOI":"10.1109\/TKDE.2020.3028705","volume":"34","author":"Q Guo","year":"2020","unstructured":"Guo Q, Zhuang F, Qin C, Zhu H, Xie X, Xiong H (2020) He Q A survey on knowledge graph-based recommender systems. IEEE Trans Knowl Data Eng 34(8):3549\u20133568","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"514_CR16","doi-asserted-by":"publisher","unstructured":"Haveliwala TH (2002) Topic-sensitive pagerank. In: Proceedings of the 11th international world wide web conference (WWW), pp 517\u2013526. https:\/\/doi.org\/10.1145\/511446.511513","DOI":"10.1145\/511446.511513"},{"key":"514_CR17","unstructured":"Hendrycks D, Gimpel K (2016) Gaussian error linear units (gelus). arXiv:1606.08415"},{"key":"514_CR18","doi-asserted-by":"crossref","unstructured":"Hu Z, Dong Y, Wang K, Sun Y (2020) Heterogeneous graph transformer. In: Advances in neural information processing systems (NeurIPS), vol 33, pp 1\u201312","DOI":"10.1145\/3366423.3380027"},{"key":"514_CR19","doi-asserted-by":"crossref","unstructured":"Hu F, Zhu Y, Wu S, Wang L, Tan T (2019) Hierarchical graph convolutional networks for semi-supervised node classification. In: International joint conference on artificial intelligence. https:\/\/api.semanticscholar.org\/CorpusID:173188231","DOI":"10.24963\/ijcai.2019\/630"},{"key":"514_CR20","unstructured":"Kipf T.N, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"issue":"3","key":"514_CR21","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1109\/TITS.2020.3026025","volume":"23","author":"J Liu","year":"2022","unstructured":"Liu J, Ong GP (2022) Chen X Graphsage-based traffic speed forecasting for segment network with sparse data. IEEE Trans Intell Transp Syst 23(3):1755\u20131766","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"514_CR22","unstructured":"Liu Z, Chen J, Zhao L (2023) Digraf: Dynamic graph activation functions for heterogeneous graph neural networks. IEEE Trans Knowl Data Eng. Early Access"},{"key":"514_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.osn.2014.05.004","volume":"14","author":"X Long","year":"2014","unstructured":"Long X, Tipper D (2014) Gomes T Measuring the survivability of networks to geographic correlated failures. Opt Switch Netw 14:117\u2013133","journal-title":"Opt Switch Netw"},{"key":"514_CR24","first-page":"3649","volume":"37","author":"KS Mantri","year":"2024","unstructured":"Mantri KS, Wang X, Sch\u00f6nlieb C-B et al (2024) Digraf: Diffeomorphic graph-adaptive activation function. Adv Neural Inf Process Syst 37:3649\u20133681","journal-title":"Adv Neural Inf Process Syst"},{"key":"514_CR25","doi-asserted-by":"crossref","unstructured":"Mumtaz S, Wang X (2017) Identifying top-k influential nodes in networks. In: Proceedings of the 26th ACM international conference on information and knowledge management (CIKM), pp 2219\u20132222","DOI":"10.1145\/3132847.3133126"},{"key":"514_CR26","doi-asserted-by":"crossref","unstructured":"Munikoti S, Das L (2022) Natarajan B Scalable graph neural network-based framework for identifying critical nodes and links in complex networks. Neurocomputing 468:211\u2013221","DOI":"10.1016\/j.neucom.2021.10.031"},{"issue":"4","key":"514_CR27","first-page":"1","volume":"56","author":"H Oon","year":"2023","unstructured":"Oon H, Aggarwal CC (2023) Understanding oversmoothing in graph neural networks. ACM Comput Surv 56(4):1\u201338","journal-title":"ACM Comput Surv"},{"key":"514_CR28","doi-asserted-by":"crossref","unstructured":"Park N, Kan A, Dong XL, Zhao T, Faloutsos C (2019) Estimating node importance in knowledge graphs using graph neural networks. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining, pp 596\u2013606","DOI":"10.1145\/3292500.3330855"},{"issue":"3","key":"514_CR29","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10115-007-0094-2","volume":"14","author":"H Tong","year":"2008","unstructured":"Tong H, Faloutsos C, Pan J-Y (2008) Random walk with restart: Fast solutions and applications. Knowl Inf Syst 14(3):327\u2013346. https:\/\/doi.org\/10.1007\/s10115-007-0094-2","journal-title":"Knowl Inf Syst"},{"issue":"19","key":"514_CR30","doi-asserted-by":"publisher","first-page":"9818","DOI":"10.3390\/app12199818","volume":"12","author":"AJC Trappey","year":"2022","unstructured":"Trappey AJC, Liang C-P, Lin H-J (2022) Using machine learning language models to generate innovation knowledge graphs for patent mining. Appl Sci 12(19):9818. https:\/\/doi.org\/10.3390\/app12199818","journal-title":"Appl Sci"},{"issue":"3","key":"514_CR31","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TKDE.2016.2633472","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang X, Zhang Y, Zhang W (2016) Lin X Efficient distance-aware influence maximization in geo-social networks. IEEE Trans Knowl Data Eng 29(3):599\u2013612","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"514_CR32","doi-asserted-by":"crossref","unstructured":"Wang X, Ji H, Shi C, Wang B, Ye PS, Cui P (2019) Heterogeneous graph attention network. In: Proceedings of the 2019 world wide web conference. ACM, pp 2022\u20132032","DOI":"10.1145\/3308558.3313562"},{"key":"514_CR33","unstructured":"Xiang B, Liu Q, Chen E, Xiong H, Zheng Y, Yang Y (2013) Pagerank with priors: An influence propagation perspective. In: Proceedings of the 23rd international joint conference on artificial intelligence (IJCAI), pp 2740\u20132746"},{"key":"514_CR34","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How powerful are graph neural networks? In: International conference on learning representations (ICLR)"},{"key":"514_CR35","doi-asserted-by":"crossref","unstructured":"Yang X, Yan M, Pan S, Ye X, Fan D (2023) Simple and efficient heterogeneous graph neural network. arXiv:2207.02547","DOI":"10.1609\/aaai.v37i9.26283"},{"key":"514_CR36","doi-asserted-by":"crossref","unstructured":"Ye H, Yuan J, Xia R et al (2024) Training-free adaptive diffusion with bounded difference approximation strategy. Adv Neural Inf Process Syst 37:306\u2013332","DOI":"10.52202\/079017-0010"},{"issue":"3","key":"514_CR37","doi-asserted-by":"publisher","first-page":"4462","DOI":"10.1109\/TNNLS.2024.3363695","volume":"36","author":"T Zhang","year":"2025","unstructured":"Zhang T, Hou C, Jiang R, Zhang X, Zhou C, Tang K, Lv H (2025) Label informed contrastive pretraining for node importance estimation on knowledge graphs. IEEE Trans Neural Netw Learn Syst 36(3):4462\u20134476. https:\/\/doi.org\/10.1109\/TNNLS.2024.3363695","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"514_CR38","doi-asserted-by":"publisher","unstructured":"Zhang C, Song D, Huang C, Swami A, Chawla NV (2019) Heterogeneous graph neural network. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining, pp 793\u2013803. https:\/\/doi.org\/10.1145\/3292500.3330961","DOI":"10.1145\/3292500.3330961"},{"key":"514_CR39","unstructured":"Zhao K et al (2023) Adversarial robustness in graph neural networks. In: NeurIPS 2023 (conference Proceedings). Analyzes GNN vulnerabilities, connects stability notions and proposes defenses"},{"key":"514_CR40","unstructured":"Zhao J, Dong Y, Ding M, Kharlamov E, Tang J (2021) Adaptive diffusion in graph neural networks. In: Advances in neural information processing systems (NeurIPS)"},{"key":"514_CR41","doi-asserted-by":"crossref","unstructured":"Zhu Q, Zheng J, Yang H, Chen C, Wang X, Zhang Y (2020) Hurricane in bipartite graphs: The lethal nodes of butterflies. In: Proceedings of the 32nd international conference on scientific and statistical database management (SSDBM), pp 1\u20134","DOI":"10.1145\/3400903.3400916"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-026-00514-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00514-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00514-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T17:28:00Z","timestamp":1777915680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-026-00514-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,10]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s44443-026-00514-y","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,10]]},"assertion":[{"value":"2 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"In this study, all data used were obtained in accordance with the relevant ethical guidelines and regulations. Informed consent was obtained from all participants involved in the data collection process. Any identifying information has been removed to ensure confidentiality and privacy.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}],"article-number":"124"}}