{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:34Z","timestamp":1750308814225,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,4,26]],"date-time":"2010-04-26T00:00:00Z","timestamp":1272240000000},"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":[[2010,4,26]]},"DOI":"10.1145\/1772690.1772716","type":"proceedings-article","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T12:45:48Z","timestamp":1272372348000},"page":"241-250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Stochastic models for tabbed browsing"],"prefix":"10.1145","author":[{"given":"Flavio","family":"Chierichetti","sequence":"first","affiliation":[{"name":"Sapienza Universita di Roma, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[{"name":"Yahoo! Inc., Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Tomkins","sequence":"additional","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,4,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378557"},{"key":"e_1_3_2_1_2_1","volume-title":"Branching Processes","author":"Athreya K. B.","year":"2004","unstructured":"K. B. Athreya and P. E. Ney . Branching Processes . Dover Publications, Inc. , New York , 2004 . K. B. Athreya and P. E. Ney. Branching Processes. Dover Publications, Inc., New York, 2004."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129134"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988716"},{"key":"e_1_3_2_1_5_1","first-page":"1","volume-title":"Proc. 1st AIRWeb","author":"Benczur A.","year":"2005","unstructured":"A. Benczur , K. Csalogany , T. Sarlos , and M. Uher . Spamrank - fully automatic link spam detection . Proc. 1st AIRWeb , pages 1 -- 14 , 2005 . A. Benczur, K. Csalogany, T. Sarlos, and M. Uher. Spamrank - fully automatic link spam detection. Proc. 1st AIRWeb, pages 1--14, 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129098"},{"key":"e_1_3_2_1_7_1","volume-title":"Web Information Retrieval & Linear Algebra Algorithms","author":"Boldi P.","year":"2007","unstructured":"P. Boldi , M. Santini , and S. Vigna . A deeper investigation of pagerank as a function of the damping factor . In Web Information Retrieval & Linear Algebra Algorithms , 2007 . P. Boldi, M. Santini, and S. Vigna. A deeper investigation of pagerank as a function of the damping factor. In Web Information Retrieval & Linear Algebra Algorithms, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052934.1052942"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062899"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_36"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_35"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462153.1462154"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1015345350"},{"key":"e_1_3_2_1_15_1","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller W.","year":"1968","unstructured":"W. Feller . An Introduction to Probability Theory and Its Applications , Volume 1 . Wiley , 1968 . W. Feller. An Introduction to Probability Theory and Its Applications, Volume 1. Wiley, 1968."},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. 2nd WSDM (Late Breaking Results)","author":"Gon\u00e7alves B.","year":"2009","unstructured":"B. Gon\u00e7alves , M. R. Meiss , J. J. Ramas , A. Flammini , and F. Menczer . Remembering what we like: Toward an agent-based model of web traffic . In Proc. 2nd WSDM (Late Breaking Results) , 2009 . B. Gon\u00e7alves, M. R. Meiss, J. J. Ramas, A. Flammini, and F. Menczer. Remembering what we like: Toward an agent-based model of web traffic. In Proc. 2nd WSDM (Late Breaking Results), 2009."},{"key":"e_1_3_2_1_17_1","first-page":"576","volume-title":"Proc. 30th VLDB","author":"Gyongi Z.","year":"2004","unstructured":"Z. Gyongi , H. Garcia-Molina , and J. Pedersen . Combating web spam with TrustRank . In Proc. 30th VLDB , pages 576 -- 587 , 2004 . Z. Gyongi, H. Garcia-Molina, and J. Pedersen. Combating web spam with TrustRank. In Proc. 30th VLDB, pages 576--587, 2004."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129091"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/382979.383041"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390412"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557914.1557946"},{"key":"e_1_3_2_1_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_1_24_1","volume-title":"Non-negative Matrices and Markov Chains","author":"Seneta E.","year":"1973","unstructured":"E. Seneta . Non-negative Matrices and Markov Chains . Springer , 1973 . E. Seneta. Non-negative Matrices and Markov Chains. Springer, 1973."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013367.1013471"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2006.147"}],"event":{"name":"WWW '10: The 19th International World Wide Web Conference","acronym":"WWW '10","location":"Raleigh North Carolina USA"},"container-title":["Proceedings of the 19th international conference on World wide web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1772690.1772716","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1772690.1772716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:28Z","timestamp":1750278388000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1772690.1772716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,26]]},"references-count":26,"alternative-id":["10.1145\/1772690.1772716","10.1145\/1772690"],"URL":"https:\/\/doi.org\/10.1145\/1772690.1772716","relation":{},"subject":[],"published":{"date-parts":[[2010,4,26]]},"assertion":[{"value":"2010-04-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}