{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:50Z","timestamp":1750307210644,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,4,16]],"date-time":"2012-04-16T00:00:00Z","timestamp":1334534400000},"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,4,16]]},"DOI":"10.1145\/2187836.2187974","type":"proceedings-article","created":{"date-parts":[[2012,4,24]],"date-time":"2012-04-24T18:41:27Z","timestamp":1335292887000},"page":"1029-1036","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Framework and algorithms for network bucket testing"],"prefix":"10.1145","author":[{"given":"Liran","family":"Katzir","sequence":"first","affiliation":[{"name":"Yahoo! Labs, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edo","family":"Liberty","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Somekh","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,4,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963492"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_1_4_1","first-page":"2001","article-title":"The dense k-subgraph problem","volume":"29","author":"Feige Uriel","year":"1999","unstructured":"Uriel Feige , Guy Kortsarz , and David Peleg . The dense k-subgraph problem . Algorithmica , 29 : 2001 , 1999 . Uriel Feige, Guy Kortsarz, and David Peleg. The dense k-subgraph problem. Algorithmica, 29:2001, 1999.","journal-title":"Algorithmica"},{"key":"e_1_3_2_1_5_1","volume-title":"Athina Markopoulou. Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In Proceedings of IEEE INFOCOM '10","author":"Gjoka Minas","year":"2010","unstructured":"Minas Gjoka , Maciej Kurant , Carter T. Butts , and Athina Markopoulou. Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In Proceedings of IEEE INFOCOM '10 , San Diego, CA , March 2010 . Minas Gjoka, Maciej Kurant, Carter T. Butts, and Athina Markopoulou. Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In Proceedings of IEEE INFOCOM '10, San Diego, CA, March 2010."},{"key":"e_1_3_2_1_6_1","volume-title":"Combinatorics","author":"Lovasz L.","year":"1993","unstructured":"L. Lovasz . Random walks on graphs. a survey . Combinatorics , 1993 . L. Lovasz. Random walks on graphs. a survey. Combinatorics, 1993."},{"key":"e_1_3_2_1_7_1","first-page":"721","volume-title":"In VLDB '05: Proceedings of the 31st international conference on Very large data bases","author":"Ravi David Gibson","year":"2005","unstructured":"David Gibson Ravi , Ravi Kumar , and Andrew Tomkins . Discovering large dense subgraphs in massive graphs . In In VLDB '05: Proceedings of the 31st international conference on Very large data bases , pages 721 -- 732 , 2005 . David Gibson Ravi, Ravi Kumar, and Andrew Tomkins. Discovering large dense subgraphs in massive graphs. In In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 721--732, 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"}],"event":{"name":"WWW 2012: 21st World Wide Web Conference 2012","sponsor":["Univ. de Lyon Universite de Lyon","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Lyon France","acronym":"WWW 2012"},"container-title":["Proceedings of the 21st international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187836.2187974","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2187836.2187974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:35Z","timestamp":1750241195000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2187836.2187974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,16]]},"references-count":9,"alternative-id":["10.1145\/2187836.2187974","10.1145\/2187836"],"URL":"https:\/\/doi.org\/10.1145\/2187836.2187974","relation":{},"subject":[],"published":{"date-parts":[[2012,4,16]]},"assertion":[{"value":"2012-04-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}