{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T20:21:32Z","timestamp":1774729292716,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339539","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"24-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["PageRank on an evolving graph"],"prefix":"10.1145","author":[{"given":"Bahman","family":"Bahmani","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Mahdian","sequence":"additional","affiliation":[{"name":"Google Inc., Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_28"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090249"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/050643799"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989425"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929864"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129098"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031248"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129090"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376928"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242630"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150419"},{"key":"e_1_3_2_2_12_1","volume-title":"Algorithms and Theoretical Computing Handbook","author":"Eppstein D.","year":"1999","unstructured":"D. Eppstein , Z. Galil , and G. F. Italiano . Dynamic graph algorithms . In M. J. Atallah, editor, Algorithms and Theoretical Computing Handbook . CRC Press , 1999 . D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In M. J. Atallah, editor, Algorithms and Theoretical Computing Handbook. CRC Press, 1999."},{"key":"e_1_3_2_2_13_1","volume-title":"Adaptive methods for the computation of PageRank. Technical report","author":"Kamvar S.","year":"2003","unstructured":"S. Kamvar , T. Haveliwala , and G. Golub . Adaptive methods for the computation of PageRank. Technical report , Stanford University , 2003 . S. Kamvar, T. Haveliwala, and G. Golub. Adaptive methods for the computation of PageRank. Technical report, Stanford University, 2003."},{"key":"e_1_3_2_2_14_1","volume-title":"Exploiting the block structure of the web for computing PageRank. Technical report","author":"Kamvar S.","year":"2003","unstructured":"S. Kamvar , T. Haveliwala , C. Manning , and G. Golub . Exploiting the block structure of the web for computing PageRank. Technical report , Stanford University , 2003 . S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Exploiting the block structure of the web for computing PageRank. Technical report, Stanford University, 2003."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775190"},{"key":"e_1_3_2_2_17_1","volume-title":"NCSU","author":"Langville A. N.","year":"2002","unstructured":"A. N. Langville and C. D. Meyer . Updating PageRank using the group inverse and stochastic complementation. Technical report , NCSU , Mathematics Department , 2002 . A. N. Langville and C. D. Meyer. Updating PageRank using the group inverse and stochastic complementation. Technical report, NCSU, Mathematics Department, 2002."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013367.1013491"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/040619028"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060829"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019604","volume-title":"Data Streams: Algorithms and Applications","author":"Muthukrishnan S.","year":"2005","unstructured":"S. Muthukrishnan . Data Streams: Algorithms and Applications . Now Publishers Inc , 2005 . S. Muthukrishnan. Data Streams: Algorithms and Applications. Now Publishers Inc, 2005."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367557"},{"key":"e_1_3_2_2_23_1","volume-title":"Stanford InfoLab","author":"Page L.","year":"1999","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The PageRank citation ranking: Bringing order to the web. Technical report , Stanford InfoLab , 1999 . L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060805"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341535"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000004"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000029"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644932"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.64"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511465"}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Beijing China","acronym":"KDD '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339539","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:08Z","timestamp":1750238468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":29,"alternative-id":["10.1145\/2339530.2339539","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339539","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}