{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T17:18:00Z","timestamp":1787851080182,"version":"build-2784847793"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100012554","name":"Hubei Provincial Department of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012554","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.neucom.2026.133892","type":"journal-article","created":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T14:26:56Z","timestamp":1778423216000},"page":"133892","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A semi-local centrality approach inspired by gravity and entropy for identifying influential nodes in weighted complex networks"],"prefix":"10.1016","volume":"694","author":[{"given":"Pengqiang","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qinghua","family":"Fu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.neucom.2026.133892_bib1","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1109\/TPDS.2021.3100785","article-title":"TianheGraph: Customizing graph search for Graph500 on Tianhe supercomputer","volume":"33","author":"Gan","year":"2021","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"10.1016\/j.neucom.2026.133892_bib2","doi-asserted-by":"crossref","first-page":"1838","DOI":"10.1007\/s10489-021-02403-5","article-title":"Identifying influential nodes in weighted complex networks using an improved WVoteRank approach","volume":"52","author":"Kumar","year":"2022","journal-title":"Appl. Intell."},{"issue":"1","key":"10.1016\/j.neucom.2026.133892_bib3","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1186\/s40537-025-01159-w","article-title":"Identifying influential nodes in weighted complex networks by considering the importance of shortest paths","volume":"12","author":"Wang","year":"2025","journal-title":"J. Big Data"},{"issue":"6","key":"10.1016\/j.neucom.2026.133892_bib4","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1007\/s11424-021-0111-7","article-title":"Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths","volume":"34","author":"Luan","year":"2021","journal-title":"J. Syst. Sci. Complex."},{"key":"10.1016\/j.neucom.2026.133892_bib5","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.physa.2019.01.136","article-title":"A novel measure of identifying influential nodes in complex networks","volume":"523","author":"Lv","year":"2019","journal-title":"Physica A Statis. Mechan. Appl."},{"issue":"10","key":"10.1016\/j.neucom.2026.133892_bib6","doi-asserted-by":"crossref","DOI":"10.1016\/j.jksuci.2023.101798","article-title":"Towards identifying influential nodes in complex networks using semi-local centrality metrics","volume":"35","author":"Zhang","year":"2023","journal-title":"J. King Saud. Univ. -Comput. Inf. Sci."},{"key":"10.1016\/j.neucom.2026.133892_bib7","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ins.2022.10.070","article-title":"A novel method to identify influential nodes in complex networks based on gravity centrality","volume":"618","author":"Zhang","year":"2022","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2026.133892_bib8","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107198","article-title":"An improved gravity model to identify influential nodes in complex networks based on k-shell method","volume":"227","author":"Yang","year":"2021","journal-title":"Knowl. -Based Syst."},{"key":"10.1016\/j.neucom.2026.133892_bib9","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2020.110456","article-title":"A generalized gravity model for influential spreaders identification in complex networks","volume":"143","author":"Li","year":"2021","journal-title":"Chaos Solitons & Fractals"},{"key":"10.1016\/j.neucom.2026.133892_bib10","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.116986","article-title":"Towards a scalable semi-local centrality for weighted complex networks using information entropy and shortest path analysis","volume":"200","author":"Gao","year":"2025","journal-title":"Chaos Solitons Fractals"},{"issue":"2","key":"10.1016\/j.neucom.2026.133892_bib11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.3390\/e24020293","article-title":"Identifying influential nodes in complex networks based on multiple local attributes and information entropy","volume":"24","author":"Zhang","year":"2022","journal-title":"Entropy"},{"key":"10.1016\/j.neucom.2026.133892_bib12","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.116411","article-title":"Effective and efficient identifying influential nodes in large scale networks by structural entropy","volume":"196","author":"Huang","year":"2025","journal-title":"Chaos Solitons & Fractals"},{"key":"10.1016\/j.neucom.2026.133892_bib13","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.neucom.2017.04.064","article-title":"Ranking influential nodes in social networks based on node position and neighborhood","volume":"260","author":"Wang","year":"2017","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2026.133892_bib14","article-title":"Identifying node importance based on evidence theory in complex networks","volume":"529","author":"Mo","year":"2019","journal-title":"Physica A Statis. Mechan. Appl."},{"key":"10.1016\/j.neucom.2026.133892_bib15","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.110177","article-title":"A novel semi-local centrality to identify influential nodes in complex networks by integrating multidimensional factors","volume":"145","author":"Zhang","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.neucom.2026.133892_bib16","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2024.115843","article-title":"Development of a multidimensional centrality metric for ranking nodes in complex networks","volume":"191","author":"Meng","year":"2025","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.neucom.2026.133892_bib17","doi-asserted-by":"crossref","first-page":"121421","DOI":"10.1109\/ACCESS.2019.2937903","article-title":"A new identification approach of power system vulnerable lines based on weighed H-index","volume":"7","author":"Zhang","year":"2019","journal-title":"Ieee Access"},{"key":"10.1016\/j.neucom.2026.133892_bib18","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","article-title":"Identifying influential spreaders in complex networks based on gravity formula","volume":"451","author":"Ma","year":"2016","journal-title":"Physica A Statistical Mechanics Applications"},{"issue":"1","key":"10.1016\/j.neucom.2026.133892_bib19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"issue":"1","key":"10.1016\/j.neucom.2026.133892_bib20","doi-asserted-by":"crossref","first-page":"10168","DOI":"10.1038\/ncomms10168","article-title":"The h-index of a network node and its relation to degree and coreness","volume":"7","author":"L\u00fc","year":"2016","journal-title":"Nat. Commun."},{"key":"10.1016\/j.neucom.2026.133892_bib21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"issue":"4","key":"10.1016\/j.neucom.2026.133892_bib22","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","article-title":"The centrality index of a graph","volume":"31","author":"Sabidussi","year":"1966","journal-title":"Psychometrika"},{"issue":"11","key":"10.1016\/j.neucom.2026.133892_bib23","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Kitsak","year":"2010","journal-title":"Nat. Phys."},{"key":"10.1016\/j.neucom.2026.133892_bib24","article-title":"Efficient algorithm for finding the influential nodes using local relative change of average shortest path","volume":"591","author":"Hajarathaiah","year":"2022","journal-title":"Physica A Statistical Mechanics Applications"},{"issue":"5","key":"10.1016\/j.neucom.2026.133892_bib25","article-title":"Subgraph centrality in complex networks","volume":"71","author":"Estrada","year":"2005","journal-title":"Phys. Rev. EStat. Nonlinear Soft Matter Phys."},{"issue":"5","key":"10.1016\/j.neucom.2026.133892_bib26","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10462-024-10725-2","article-title":"A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood","volume":"57","author":"Xiao","year":"2024","journal-title":"Artif. Intell. Rev."},{"issue":"1","key":"10.1016\/j.neucom.2026.133892_bib27","article-title":"Vital node identification in hypergraphs via gravity model","volume":"33","author":"Xie","year":"2023","journal-title":"Chaos Interdiscipl. J. Nonlinear Sci."},{"issue":"1","key":"10.1016\/j.neucom.2026.133892_bib28","doi-asserted-by":"crossref","first-page":"2691","DOI":"10.1038\/s41598-020-59616-w","article-title":"Identifying vital nodes in complex networks by adjacency information entropy","volume":"10","author":"Xu","year":"2020","journal-title":"Sci. Rep."},{"issue":"1","key":"10.1016\/j.neucom.2026.133892_bib29","article-title":"Mining important nodes in directed weighted complex networks","volume":"2017","author":"Yang","year":"2017","journal-title":"Discret. Dyn. Nat. Soc."},{"issue":"16","key":"10.1016\/j.neucom.2026.133892_bib30","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.101.168702","article-title":"Prominence and control: the weighted rich-club effect","volume":"101","author":"Opsahl","year":"2008","journal-title":"Phys. Rev. Lett."},{"issue":"8","key":"10.1016\/j.neucom.2026.133892_bib31","doi-asserted-by":"crossref","first-page":"3113","DOI":"10.1109\/TCSI.2019.2907751","article-title":"Coreness and h-index for weighted networks","volume":"66","author":"Wu","year":"2019","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"12","key":"10.1016\/j.neucom.2026.133892_bib32","first-page":"9","article-title":"Research on the approximation algorithms for the betweenness property computation on complex social networks","volume":"30","author":"Tang","year":"2008","journal-title":"Comput. Eengineering & Sci."},{"key":"10.1016\/j.neucom.2026.133892_bib33","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s13222-017-0261-x","article-title":"Efficient batched distance, closeness and betweenness centrality computation in unweighted and weighted graphs","volume":"17","author":"Then","year":"2017","journal-title":"Datenbank-Spektrum"},{"issue":"8","key":"10.1016\/j.neucom.2026.133892_bib34","doi-asserted-by":"crossref","DOI":"10.1088\/1367-2630\/14\/8\/083030","article-title":"A k-shell decomposition method for weighted networks","volume":"14","author":"Garas","year":"2012","journal-title":"N. J. Phys."},{"key":"10.1016\/j.neucom.2026.133892_bib35","series-title":"2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE)","first-page":"510","article-title":"Eigenvector centrality and its application in research professionals' relationship network","author":"Bihari","year":"2015"},{"key":"10.1016\/j.neucom.2026.133892_bib36","doi-asserted-by":"crossref","first-page":"108756","DOI":"10.1016\/j.neunet.2026.108756","article-title":"DADiffNet: Delay-aware diffusion networks with adaptive subgraphs for large-scale traffic forecasting","volume":"200","author":"Fan","year":"2026","journal-title":"Neural. Netw."},{"issue":"1","key":"10.1016\/j.neucom.2026.133892_bib37","doi-asserted-by":"crossref","DOI":"10.1111\/coin.70199","article-title":"LeF-MTP: Prioritizing GNN test cases by fusing model uncertainty and feature-space confusability","volume":"42","author":"Su","year":"2026","journal-title":"Comput. Intell."},{"issue":"2","key":"10.1016\/j.neucom.2026.133892_bib38","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1109\/TNNLS.2025.3614341","article-title":"HKANLP: Link prediction with hyperspherical embeddings and Kolmogorov\u2013Arnold networks","volume":"37","author":"Zhang","year":"2025","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"10.1016\/j.neucom.2026.133892_bib39","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TCSS.2024.3443746","article-title":"Semi-local average shortest path with augmented graph for identifying influential nodes","volume":"12","author":"Luo","year":"2024","journal-title":"IEEE Trans. Comput. Soc. Syst."}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226012890?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226012890?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T16:24:07Z","timestamp":1787847847000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231226012890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":39,"alternative-id":["S0925231226012890"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2026.133892","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A semi-local centrality approach inspired by gravity and entropy for identifying influential nodes in weighted complex networks","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2026.133892","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":"133892"}}