{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T16:07:11Z","timestamp":1784390831452,"version":"3.55.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,11,30]],"date-time":"2008-11-30T00:00:00Z","timestamp":1228003200000},"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":["SIGIR Forum"],"published-print":{"date-parts":[[2008,11,30]]},"abstract":"<jats:p>We describe the techniques developed to gather and distribute in a highly compressed, yet accessible, form a series of twelve snapshot of the .uk web domain. Ad hoc compression techniques made it possible to store the twelve snapshots using just 1:9 bits per link, with constant-time access to temporal information. Our collection makes it possible to study the temporal evolution link-based scores (e.g., PageRank), the growth of online communities, and in general time-dependent phenomena related to the link structure.<\/jats:p>","DOI":"10.1145\/1480506.1480511","type":"journal-article","created":{"date-parts":[[2008,12,30]],"date-time":"2008-12-30T17:45:31Z","timestamp":1230659131000},"page":"33-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":130,"title":["A large time-aware web graph"],"prefix":"10.1145","volume":"42","author":[{"given":"Paolo","family":"Boldi","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Massimo","family":"Santini","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastiano","family":"Vigna","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,11,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321820"},{"key":"e_1_2_1_4_1","volume-title":"On the number of bits required to implement an associative memory. Memorandum 61","author":"Fano R. M.","year":"1971","unstructured":"R. M. Fano . On the number of bits required to implement an associative memory. Memorandum 61 , Computer Structures Group , Project MAC, MIT, Cambridge, Mass., n.d., 1971 . R. M. Fano. On the number of bits required to implement an associative memory. Memorandum 61, Computer Structures Group, Project MAC, MIT, Cambridge, Mass., n.d., 1971."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/77556.77566"},{"key":"e_1_2_1_6_1","unstructured":"J. Ratkiewicz. WebGraph++ 2006. http:\/\/homer.informatics.indiana.edu\/~nan\/webgraph\/.  J. Ratkiewicz. WebGraph++ 2006. http:\/\/homer.informatics.indiana.edu\/~nan\/webgraph\/."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788900"}],"container-title":["ACM SIGIR Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1480506.1480511","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1480506.1480511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:59Z","timestamp":1750253399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1480506.1480511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,30]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,11,30]]}},"alternative-id":["10.1145\/1480506.1480511"],"URL":"https:\/\/doi.org\/10.1145\/1480506.1480511","relation":{},"ISSN":["0163-5840"],"issn-type":[{"value":"0163-5840","type":"print"}],"subject":[],"published":{"date-parts":[[2008,11,30]]},"assertion":[{"value":"2008-11-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}