{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T02:03:47Z","timestamp":1780538627363,"version":"3.54.1"},"reference-count":37,"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,4,15]],"date-time":"2026-04-15T00:00:00Z","timestamp":1776211200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP25K15006"],"award-info":[{"award-number":["JP25K15006"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ins.2026.123507","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:07:06Z","timestamp":1776294426000},"page":"123507","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["PureRank: A parameter-free recursive importance measure for network nodes"],"prefix":"10.1016","volume":"751","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1350-887X","authenticated-orcid":false,"given":"Hiroyuki","family":"Masuyama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123507_bib0005","series-title":"Networks: an Introduction","author":"Newman","year":"2010"},{"key":"10.1016\/j.ins.2026.123507_bib0010","author":"Saxena"},{"issue":"4","key":"10.1016\/j.ins.2026.123507_bib0015","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1037\/h0084096","article-title":"The net of reciprocal influence; a problem in treating sociometric data","volume":"3","author":"Seeley","year":"1949","journal-title":"Can. J. Psychol."},{"issue":"1","key":"10.1016\/j.ins.2026.123507_bib0020","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\u20136","key":"10.1016\/j.ins.2026.123507_bib0025","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","article-title":"Graph structure in the Web","volume":"33","author":"Broder","year":"2000","journal-title":"Comput. Netw."},{"issue":"1","key":"10.1016\/j.ins.2026.123507_bib0030","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika"},{"issue":"1\u20137","key":"10.1016\/j.ins.2026.123507_bib0035","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN Syst."},{"key":"10.1016\/j.ins.2026.123507_bib0040","series-title":"Google\u2019s PageRank and Beyond: the Science of Search Engine Rankings","author":"Langville","year":"2006"},{"key":"10.1016\/j.ins.2026.123507_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2023.103900","article-title":"Axiomatic characterization of PageRank","volume":"318","author":"W\u0105s","year":"2023","journal-title":"Artif. Intell."},{"key":"10.1016\/j.ins.2026.123507_bib0050","doi-asserted-by":"crossref","first-page":"163049","DOI":"10.1109\/ACCESS.2019.2952653","article-title":"A survey on personalized PageRank computation algorithms","volume":"7","author":"Park","year":"2019","journal-title":"IEEE Access"},{"issue":"9","key":"10.1016\/j.ins.2026.123507_bib0055","doi-asserted-by":"crossref","first-page":"4582","DOI":"10.1109\/TKDE.2024.3376000","article-title":"Efficient algorithms for personalized PageRank computation: a survey","volume":"36","author":"Yang","year":"2024","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2026.123507_bib0060","series-title":"Proceedings of the 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Vol. 297 of Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"90:1","article-title":"Dynamic PageRank: algorithms and lower bounds","author":"Jayaram","year":"2024"},{"issue":"9","key":"10.1016\/j.ins.2026.123507_bib0065","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.14778\/3461535.3461554","article-title":"Massively parallel algorithms for personalized PageRank","volume":"14","author":"Hou","year":"2021","journal-title":"Proc. VLDB Endow."},{"issue":"45","key":"10.1016\/j.ins.2026.123507_bib0070","doi-asserted-by":"crossref","first-page":"11433","DOI":"10.1523\/JNEUROSCI.0003-08.2008","article-title":"The Eigenfactor metrics","volume":"28","author":"Bergstrom","year":"2008","journal-title":"J. Neurosci."},{"key":"10.1016\/j.ins.2026.123507_bib0075","series-title":"Proceedings of the 30th International Conference on Very Large Data Bases","first-page":"576","article-title":"Combating web spam with TrustRank","author":"Gy\u00f6ngyi","year":"2004"},{"issue":"1","key":"10.1016\/j.ins.2026.123507_bib0080","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/TKDE.2016.2611584","article-title":"BiRank: towards ranking on bipartite graphs","volume":"29","author":"He","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"10.1016\/j.ins.2026.123507_bib0085","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1186\/1471-2105-6-233","article-title":"Generank: using search engine technology for the analysis of microarray experiments","volume":"6","author":"Morrison","year":"2005","journal-title":"BMC Bioinform."},{"key":"10.1016\/j.ins.2026.123507_bib0090","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1038\/srep00541","article-title":"DebtRank: too central to fail? Financial networks, the FED and systemic risk","volume":"2","author":"Battiston","year":"2012","journal-title":"Sci. Rep."},{"key":"10.1016\/j.ins.2026.123507_bib0095","series-title":"Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing","first-page":"404","article-title":"TextRank: bringing order into texts","author":"Mihalcea","year":"2004"},{"issue":"3","key":"10.1016\/j.ins.2026.123507_bib0100","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1137\/140976649","article-title":"PageRank beyond the web","volume":"57","author":"Gleich","year":"2015","journal-title":"SIAM Rev."},{"key":"10.1016\/j.ins.2026.123507_bib0105","series-title":"Ranking Theory with Application to Popular Sports","author":"Govan","year":"2008"},{"key":"10.1016\/j.ins.2026.123507_bib0110","series-title":"Who\u2019s #1?: the Science of Rating and Ranking","author":"Langville","year":"2012"},{"issue":"1\u20132","key":"10.1016\/j.ins.2026.123507_bib0115","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/15427951.2008.10129300","article-title":"A singular perturbation approach for choosing the PageRank damping factor","volume":"5","author":"Avrachenkov","year":"2008","journal-title":"Internet Math."},{"issue":"2","key":"10.1016\/j.ins.2026.123507_bib0120","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.jda.2009.11.001","article-title":"Choose the damping, choose the ranking?","volume":"8","author":"Bressan","year":"2010","journal-title":"J. Discrete Algorithms"},{"issue":"6","key":"10.1016\/j.ins.2026.123507_bib0125","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0021202","article-title":"Leaders in social networks, the Delicious case","volume":"6","author":"L\u00fc","year":"2011","journal-title":"PLOS ONE"},{"key":"10.1016\/j.ins.2026.123507_bib0130","series-title":"SNAP Datasets: Stanford Large Network Dataset Collection, Online Dataset Collection","author":"Leskovec","year":"2014"},{"key":"10.1016\/j.ins.2026.123507_bib0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2020.125019","article-title":"Google matrix analysis of bi-functional SIGNOR network of protein\u2013protein interactions","volume":"559","author":"Frahm","year":"2020","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"10.1016\/j.ins.2026.123507_bib0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.121069","article-title":"Ising-PageRank model of opinion formation on social networks","volume":"526","author":"Frahm","year":"2019","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"10.1016\/j.ins.2026.123507_bib0145","series-title":"Markov Chains: Gibbs Fields, Monte Carlo Simulation and Queues","author":"Br\u00e9maud","year":"2020"},{"issue":"11","key":"10.1016\/j.ins.2026.123507_bib0150","doi-asserted-by":"crossref","first-page":"3075","DOI":"10.1016\/j.cam.2010.02.001","article-title":"Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph","volume":"234","author":"Avrachenkov","year":"2010","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.ins.2026.123507_bib0155","series-title":"Algorithms","author":"Sedgewick","year":"2011"},{"issue":"2","key":"10.1016\/j.ins.2026.123507_bib0160","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ins.2026.123507_bib0165","unstructured":"Stanford Network Analysis Project (SNAP), ego-Twitter: social circles from Twitter, Online dataset, 2012. (Accessed 31 May 2025)."},{"key":"10.1016\/j.ins.2026.123507_bib0170","unstructured":"Stanford Network Analysis Project (SNAP), cit-HepPh: arXiv high energy physics paper citation network, Online dataset, 2003. (Accessed 31 May 2025)."},{"key":"10.1016\/j.ins.2026.123507_bib0175","unstructured":"Stanford Network Analysis Project (SNAP), ca-AstroPh: collaboration network of arXiv astro physics, Online dataset, 2007. (Accessed 31 May 2025)."},{"key":"10.1016\/j.ins.2026.123507_bib0180","doi-asserted-by":"crossref","first-page":"989","DOI":"10.13001\/1081-3810.1570","article-title":"On the approximation of ergodic projections and stationary distributions of stochastic matrices","volume":"23","author":"Schomburg","year":"2012","journal-title":"Electron. J. Linear Algebra"},{"key":"10.1016\/j.ins.2026.123507_bib0185","series-title":"Stochastic Processes","author":"Doob","year":"1953"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002552600438X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002552600438X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T01:00:20Z","timestamp":1780534820000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002002552600438X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":37,"alternative-id":["S002002552600438X"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123507","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"PureRank: A parameter-free recursive importance measure for network nodes","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123507","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"123507"}}