{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T09:40:59Z","timestamp":1791279659986,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T00:00:00Z","timestamp":1301270400000},"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":[[2011,3,28]]},"DOI":"10.1145\/1963405.1963493","type":"proceedings-article","created":{"date-parts":[[2011,3,29]],"date-time":"2011-03-29T12:02:18Z","timestamp":1301400138000},"page":"625-634","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":86,"title":["HyperANF"],"prefix":"10.1145","author":[{"given":"Paolo","family":"Boldi","sequence":"first","affiliation":[{"name":"Universit\u00e0 degli Studi di Milano, Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Rosa","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Milano, Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastiano","family":"Vigna","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Milano, Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,3,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_1_4_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/978-3-540-39658-1_55","volume-title":"Giuseppe Di Battista and Uri Zwick","author":"Durand Marianne","year":"2003"},{"key":"e_1_3_2_1_5_1","first-page":"127","volume-title":"Proceedings of the 13th conference on analysis of algorithm (AofA 07)","author":"Flajolet Philippe","year":"2007"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346577"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921634"},{"key":"e_1_3_2_1_8_1","unstructured":"Donald E. Knuth. The Art of Computer Programming. Pre-Fascicle 1A. Draft of Section 7.1.3: Bitwise Tricks and Techniques 2007.  Donald E. Knuth. The Art of Computer Programming. Pre-Fascicle 1A. Draft of Section 7.1.3: Bitwise Tricks and Techniques 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775059"},{"key":"e_1_3_2_1_11_1","unstructured":"Sebastiano Vigna. Stanford matrix considered harmful. In Andreas Frommer Michael W. Mahoney and Daniel B. Szyld editors Web Information Retrieval and Linear Algebra Algorithms number 07071 in Dagstuhl Seminar Proceedings 2007. http:\/\/arxiv.org\/abs\/0710.1962.  Sebastiano Vigna. Stanford matrix considered harmful. In Andreas Frommer Michael W. Mahoney and Daniel B. Szyld editors Web Information Retrieval and Linear Algebra Algorithms number 07071 in Dagstuhl Seminar Proceedings 2007. http:\/\/arxiv.org\/abs\/0710.1962."},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/978-3-540-68552-4_12","volume-title":"7th International Workshop, WEA","author":"Vigna Sebastiano","year":"2008"},{"key":"e_1_3_2_1_13_1","first-page":"23","article-title":"Proof of the 3\u03c3 rule for unimodal distributions","volume":"21","author":"Vysochanski\u012d D. F.","year":"1979","journal-title":"{Teor. Veroyatnost. i Mat. Statist."}],"event":{"name":"WWW '11: 20th International World Wide Web Conference","location":"Hyderabad India","acronym":"WWW '11","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","The International Institute of Information Technology Bangalore The International Institute of Information Technology Bangalore"]},"container-title":["Proceedings of the 20th international conference on World wide web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963405.1963493","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1963405.1963493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:19Z","timestamp":1750243939000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963405.1963493"}},"subtitle":["approximating the neighbourhood function of very large graphs on a budget"],"short-title":[],"issued":{"date-parts":[[2011,3,28]]},"references-count":13,"alternative-id":["10.1145\/1963405.1963493","10.1145\/1963405"],"URL":"https:\/\/doi.org\/10.1145\/1963405.1963493","relation":{},"subject":[],"published":{"date-parts":[[2011,3,28]]},"assertion":[{"value":"2011-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}