{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:02:07Z","timestamp":1768093327256,"version":"3.49.0"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"JST SPRING","award":["JPMJSP2123"],"award-info":[{"award-number":["JPMJSP2123"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1109\/tbdata.2024.3524833","type":"journal-article","created":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T14:39:01Z","timestamp":1735742341000},"page":"1707-1719","source":"Crossref","is-referenced-by-count":2,"title":["Reducing Re-Indexing for Top-k Personalized PageRank Computation on Dynamic Graphs"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8393-8551","authenticated-orcid":false,"given":"Tsuyoshi","family":"Yamashita","sequence":"first","affiliation":[{"name":"Graduate School of Science and Technology, Keio University, Kanagawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Matsumoto","sequence":"additional","affiliation":[{"name":"Faculty of Education, University of the Ryukyus, Okinawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunitake","family":"Kaneko","sequence":"additional","affiliation":[{"name":"Research Institute for Digital Media and Content, Keio University, Kanagawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"The PageRank citation ranking: Bringing order to the Web","author":"Page","year":"1998"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2952653"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3376000"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488433"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054202"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186183"},{"key":"ref7","first-page":"1","article-title":"Predict then propagate: Graph neural networks meet personalized PageRank","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Gasteiger"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935914"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367618"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/140976649"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129128"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098072"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196920"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/3357377.3357379"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3360902"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645663"},{"key":"ref22","article-title":"Towards training graph neural networks with node-level differential privacy","volume-title":"Proc. ACM 33rd Int. Conf. World Wide Web","author":"Zhang"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035950"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035920"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732978"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2912606"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461554"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457298"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623745"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835823"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021936"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129104"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482317"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00038"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929864"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783297"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186107"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19274-7_12"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.14778\/3151113.3151121"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939804"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583474"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3588705"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_12"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772730"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129300"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983713"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313555"},{"key":"ref49","article-title":"Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"ref50","article-title":"Online social networks: Measurement, analysis, and applications to distributed information systems","author":"Mislove","year":"2009"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397742"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref53","first-page":"559","article-title":"GraphWalker: An I\/O-efficient and resource-friendly graph analytic system for fast and scalable random walks","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Wang"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6687317\/11077791\/10819623.pdf?arnumber=10819623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T17:45:45Z","timestamp":1752255945000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10819623\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":53,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2024.3524833","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}