{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T09:01:14Z","timestamp":1773910874371,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,28]],"date-time":"2009-06-28T00:00:00Z","timestamp":1246147200000},"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":[[2009,6,28]]},"DOI":"10.1145\/1557019.1557049","type":"proceedings-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:54Z","timestamp":1246367454000},"page":"219-228","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":218,"title":["On compressing social networks"],"prefix":"10.1145","author":[{"given":"Flavio","family":"Chierichetti","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Rome, UNK, Italy"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, UNK, Italy"}]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Sunnyvale, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/882454.875027"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1333875.1334206"},{"key":"e_1_3_2_2_4_1","first-page":"342","volume-title":"Proc. DCC","author":"Bladford D.","year":"2002","unstructured":"D. Bladford and G. Blelloch . Index compression through document reordering . In Proc. DCC , pages 342 -- 351 , 2002 . D. Bladford and G. Blelloch. Index compression through document reordering. In Proc. DCC, pages 342--351, 2002."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_10"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/971935.971982"},{"key":"e_1_3_2_2_8_1","first-page":"1","volume-title":"Handbook of Graphs and Networks","author":"Bollobas B.","year":"2002","unstructured":"B. Bollobas and O. Riordan . Mathematical results on scale-free random graphs . In S. Bornholdt and H. Schuster, editors, Handbook of Graphs and Networks , pages 1 -- 37 . Wiley-WCH , 2002 . B. Bollobas and O. Riordan. Mathematical results on scale-free random graphs. In S. Bornholdt and H. Schuster, editors, Handbook of Graphs and Networks, pages 1--37. Wiley-WCH, 2002."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.1009"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_3_2_2_12_1","volume-title":"High degree vertices and eigenvalues in the preferential attachment graph. Internet Mathematics, 2(1)","author":"Flaxman A.","year":"2005","unstructured":"A. Flaxman , A. M. Frieze , and T. I. Fenner . High degree vertices and eigenvalues in the preferential attachment graph. Internet Mathematics, 2(1) , 2005 . A. Flaxman, A. M. Frieze, and T. I. Fenner. High degree vertices and eigenvalues in the preferential attachment graph. Internet Mathematics, 2(1), 2005."},{"key":"e_1_3_2_2_13_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W.H. Freeman and Company , 1979 . M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"e_1_3_2_2_15_1","first-page":"721","volume-title":"Proc. 31st VLDB","author":"Gibson D.","year":"2005","unstructured":"D. Gibson , R. Kumar , and A. Tomkins . Extracting large dense subgraphs in massive graphs . In Proc. 31st VLDB , pages 721 -- 732 , 2005 . D. Gibson, R. Kumar, and A. Tomkins. Extracting large dense subgraphs in massive graphs. In Proc. 31st VLDB, pages 721--732, 2005."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150476"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0503018102"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1394399"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548301005089"},{"key":"e_1_3_2_2_21_1","first-page":"405","volume-title":"Proc. 19th ICDE","author":"Raghavan S.","year":"2003","unstructured":"S. Raghavan and H. Garcia-Molina . Representing web graphs . In Proc. 19th ICDE , pages 405 -- 416 , 2003 . S. Raghavan and H. Garcia-Molina. Representing web graphs. In Proc. 19th ICDE, pages 405--416, 2003."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/882455.874988"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702413197"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(02)00020-1"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763653.1763668"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/967900.968024"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/882454.875028"},{"key":"e_1_3_2_2_28_1","volume-title":"Morgan Kaufmann","author":"Witten I. H.","year":"1999","unstructured":"I. H. Witten , A. Moffat , and T. C. Bell . Managing Gigabytes: Compressing and Indexing Documents and Images . Morgan Kaufmann , 1999 . I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, 1999."}],"event":{"name":"KDD09: The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Paris France","acronym":"KDD09","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557049","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557019.1557049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:40Z","timestamp":1750253920000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":28,"alternative-id":["10.1145\/1557019.1557049","10.1145\/1557019"],"URL":"https:\/\/doi.org\/10.1145\/1557019.1557049","relation":{},"subject":[],"published":{"date-parts":[[2009,6,28]]},"assertion":[{"value":"2009-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}