{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T02:56:34Z","timestamp":1776394594980,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,10]],"date-time":"2009-03-10T00:00:00Z","timestamp":1236643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0831186"],"award-info":[{"award-number":["CNS-0831186"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,3,10]]},"DOI":"10.1145\/1533057.1533088","type":"proceedings-article","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T14:57:19Z","timestamp":1240930639000},"page":"218-227","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["The union-split algorithm and cluster-based anonymization of social networks"],"prefix":"10.1145","author":[{"given":"Brian","family":"Thompson","sequence":"first","affiliation":[{"name":"Rutgers University, Piscataway, NJ"}]},{"given":"Danfeng","family":"Yao","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscataway, NJ"}]}],"member":"320","published-online":{"date-parts":[[2009,3,10]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1783823.1783848"},{"key":"e_1_3_2_1_3_1","unstructured":"Cambridge English Dictionary. http:\/\/dictionary.cambridge.org\/define.asp? key=68410&dict=CALD.  Cambridge English Dictionary. http:\/\/dictionary.cambridge.org\/define.asp? key=68410&dict=CALD."},{"key":"e_1_3_2_1_4_1","volume-title":"R-MAT: A recursive model for graph mining","author":"Chakrabarti D.","year":"2004","unstructured":"D. Chakrabarti , Y. Zhan , and C. Faloutsos . R-MAT: A recursive model for graph mining . In M. W. Berry, U. Dayal, C. Kamath, and D. B. Skillicorn, editors, SDM. SIAM , 2004 . D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In M. W. Berry, U. Dayal, C. Kamath, and D. B. Skillicorn, editors, SDM. SIAM, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453947"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453873"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367856"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376629"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"issue":"1","key":"e_1_3_2_1_10_1","first-page":"60","article-title":"The small world problem","volume":"1","author":"Milgram S.","year":"1967","unstructured":"S. Milgram . The small world problem . Psychology Today , 1 ( 1 ): 60 -- 67 , May 1967 . S. Milgram. The small world problem. Psychology Today, 1(1):60--67, May 1967.","journal-title":"Psychology Today"},{"key":"e_1_3_2_1_11_1","first-page":"727","volume-title":"Proceedings of the Seventeenth International Conference on Machine Learning","author":"Moore A. W.","year":"2000","unstructured":"A. W. Moore and D. Pelleg . X-means: Extending k-means with efficient estimation of the number of clusters . In Proceedings of the Seventeenth International Conference on Machine Learning , pages 727 -- 734 . Morgan Kaufmann , 2000 . A. W. Moore and D. Pelleg. X-means: Extending k-means with efficient estimation of the number of clusters. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 727--734. Morgan Kaufmann, 2000."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.03.009"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.369025"},{"key":"e_1_3_2_1_15_1","unstructured":"Netflix Prize. http:\/\/www.netflixprize.com.  Netflix Prize. http:\/\/www.netflixprize.com."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275508"},{"key":"e_1_3_2_1_17_1","volume-title":"Washington Post","author":"Stein R.","year":"2008","unstructured":"R. Stein . Social networks' sway may be underestimated . Washington Post , May 26, 2008 . R. Stein. Social networks' sway may be underestimated. Washington Post, May 26, 2008."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150499"},{"issue":"4","key":"e_1_3_2_1_20_1","first-page":"1481","article-title":"Graph isomorphism problem","volume":"29","author":"Zemlyachenko V. N.","year":"1985","unstructured":"V. N. Zemlyachenko , N. M. Korneenko , and R. I. Tyshkevich . Graph isomorphism problem . Journal of Mathematical Sciences , 29 ( 4 ):1426\u00dc 1481 , May 1985 . V. N. Zemlyachenko, N. M. Korneenko, and R. I. Tyshkevich. Graph isomorphism problem. Journal of Mathematical Sciences, 29(4):1426\u00dc1481, May 1985.","journal-title":"Journal of Mathematical Sciences"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497459"}],"event":{"name":"Asia CCS 09: Asia CCS 2009 ACM Symposium on Information, Computer and Communications Security","location":"Sydney Australia","acronym":"Asia CCS 09","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 4th International Symposium on Information, Computer, and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1533057.1533088","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1533057.1533088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:44Z","timestamp":1750253384000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1533057.1533088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,10]]},"references-count":20,"alternative-id":["10.1145\/1533057.1533088","10.1145\/1533057"],"URL":"https:\/\/doi.org\/10.1145\/1533057.1533088","relation":{},"subject":[],"published":{"date-parts":[[2009,3,10]]},"assertion":[{"value":"2009-03-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}