{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T18:44:41Z","timestamp":1771267481553,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","funder":[{"name":"National Science Foundation","award":["2209921"],"award-info":[{"award-number":["2209921"]}]},{"name":"National Science Foundation","award":["2209922"],"award-info":[{"award-number":["2209922"]}]},{"name":"Korea Institute of Energy Technology Evaluation and Planning","award":["20228530050030"],"award-info":[{"award-number":["20228530050030"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,2,22]]},"DOI":"10.1145\/3773966.3779378","type":"proceedings-article","created":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:50:01Z","timestamp":1771264201000},"page":"1120-1124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Monte Carlo Algorithms for Approximating Katz Centrality on Large Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-1346-9443","authenticated-orcid":false,"given":"Garrett W.","family":"Cornett","sequence":"first","affiliation":[{"name":"Texas State University, San Marcos, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0274-9936","authenticated-orcid":false,"given":"Minh Phu","family":"Vuong","sequence":"additional","affiliation":[{"name":"Texas State Universtiy, San Marcos, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4778-8996","authenticated-orcid":false,"given":"Chul-Ho","family":"Lee","sequence":"additional","affiliation":[{"name":"Texas State University, San Marcos, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,2,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460772"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-023-01456-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-018-0493-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108591034"},{"key":"e_1_3_2_1_5_1","volume-title":"Networks, Crowds, and Markets: Reasoning about a Highly Connected World","author":"Easley David","unstructured":"David Easley and Jon Kleinberg. 2010. Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, USA."},{"key":"e_1_3_2_1_6_1","volume-title":"A Faster Katz Status Score Algorithm","author":"Foster Kurt","year":"2001","unstructured":"Kurt Foster, Stephen Muth, John Potterat, and Richard Rothenberg. 2001. A Faster Katz Status Score Algorithm. Computational & Mathematical Organization Theory, Vol. 7 (12 2001), 275-285."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3163672"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-36736-1"},{"key":"e_1_3_2_1_9_1","unstructured":"David Gleich Leonid Zhukov and Pavel Berkhin. 2004. Fast parallel PageRank: A linear system approach. Yahoo! Research Technical Report Vol. 13 (2004) 22."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 7th Python in Science Conference","author":"Hagberg Aric A.","unstructured":"Aric A. Hagberg, Daniel A. Schult, and Pieter J. Swart. 2008. Exploring Network Structure, Dynamics, and Function using NetworkX. In Proceedings of the 7th Python in Science Conference (Pasadena, California). 11-15."},{"key":"e_1_3_2_1_11_1","volume-title":"Matrix analysis","author":"Horn Roger A","unstructured":"Roger A Horn and Charles R Johnson. 2012. Matrix analysis. Cambridge University Press, USA."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_2_1_13_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_14_1","volume-title":"Sake: Estimating katz centrality based on sampling for large-scale social networks. ACM Transactions on Knowledge Discovery from Data (TKDD)","author":"Lin Mingkai","year":"2021","unstructured":"Mingkai Lin, Wenzhong Li, Lynda J Song, Cam-Tu Nguyen, Xiaoliang Wang, and Sanglu Lu. 2021. Sake: Estimating katz centrality based on sampling for large-scale social networks. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 15, 4 (2021), 1-21."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"e_1_3_2_1_16_1","first-page":"901","volume-title":"Proceedings of IEEE International Conference on Data Mining","author":"Mavroforakis C.","unstructured":"C. Mavroforakis, M. Mathioudakis, and A. Gionis. 2015. Absorbing random-walk centrality: Theory and algorithms. In Proceedings of IEEE International Conference on Data Mining (Atlantic City, NJ, USA). IEEE, 901-906."},{"key":"e_1_3_2_1_17_1","volume-title":"Parallel Processing and Applied Mathematics: 12th International Conference. Springer, Springer International Publishing, Cham, 290-302","author":"Nathan Eisha","year":"2018","unstructured":"Eisha Nathan and David A Bader. 2018. Approximating personalized Katz centrality in dynamic graphs. In Parallel Processing and Applied Mathematics: 12th International Conference. Springer, Springer International Publishing, Cham, 290-302."},{"key":"e_1_3_2_1_18_1","volume-title":"Networks","author":"Newman Mark","unstructured":"Mark Newman. 2018. Networks. Oxford University Press, USA."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401132.1401152"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.03.018"},{"key":"e_1_3_2_1_21_1","volume-title":"RAPIDS: Libraries for End to End GPU Data Science. https:\/\/rapids.ai","author":"Development Team RAPIDS","year":"2023","unstructured":"RAPIDS Development Team. 2023. RAPIDS: Libraries for End to End GPU Data Science. https:\/\/rapids.ai"},{"key":"e_1_3_2_1_22_1","first-page":"4840","volume-title":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery","author":"Wu Lingfei","year":"2022","unstructured":"Lingfei Wu, Peng Cui, Jian Pei, Liang Zhao, and Xiaojie Guo. 2022a. Graph neural networks: Foundation, frontiers and applications. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, 4840-4841."},{"key":"e_1_3_2_1_23_1","first-page":"2365","volume-title":"Proceedings of the 44th International Conference on Software Engineering. Association for Computing Machinery","author":"Wu Yueming","year":"2022","unstructured":"Yueming Wu, Deqing Zou, Shihan Dou, Wei Yang, Duo Xu, and Hai Jin. 2022b. Vulcnn: An image-inspired scalable vulnerability detection system. In Proceedings of the 44th International Conference on Software Engineering. Association for Computing Machinery, New York, NY, USA, 2365-2376."},{"key":"e_1_3_2_1_24_1","first-page":"29476","article-title":"Neural bellman-ford networks: A general graph neural network framework for link prediction","volume":"34","author":"Zhu Zhaocheng","year":"2021","unstructured":"Zhaocheng Zhu, Zuobai Zhang, Louis-Pascal Xhonneux, and Jian Tang. 2021. Neural bellman-ford networks: A general graph neural network framework for link prediction. Advances in Neural Information Processing Systems, Vol. 34 (2021), 29476-29490.","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"WSDM '26:The Nineteenth ACM International Conference on Web Search and Data Mining","location":"Boise ID USA","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the Nineteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"deposited":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:56:43Z","timestamp":1771264603000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3773966.3779378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,21]]},"references-count":24,"alternative-id":["10.1145\/3773966.3779378","10.1145\/3773966"],"URL":"https:\/\/doi.org\/10.1145\/3773966.3779378","relation":{},"subject":[],"published":{"date-parts":[[2026,2,21]]},"assertion":[{"value":"2026-02-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}