{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:37:03Z","timestamp":1765355823495,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T00:00:00Z","timestamp":1404086400000},"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":[[2014,6,30]]},"DOI":"10.1145\/2618243.2618269","type":"proceedings-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:16:26Z","timestamp":1403612186000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["(k, d)-core anonymity"],"prefix":"10.1145","author":[{"given":"Roland","family":"Assam","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Germany"}]},{"given":"Marwan","family":"Hassani","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}]},{"given":"Michael","family":"Brysch","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}]}],"member":"320","published-online":{"date-parts":[[2014,6,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"http:\/\/snap.stanford.edu\/data\/index.html","author":"Network Dataset Collection Stanford Large","year":"2013","unstructured":"Stanford Large Network Dataset Collection . http:\/\/snap.stanford.edu\/data\/index.html , 2013 . Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data\/index.html, 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_1_3_1","volume-title":"CoRR' 05","author":"Alvarez-Hamelin J. I.","year":"2005","unstructured":"J. I. Alvarez-Hamelin , L. Dall'Asta , A. Barrat , and A. Vespignani . k-core decomposition: a tool for the visualization of large scale networks . CoRR' 05 , 2005 . J. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani. k-core decomposition: a tool for the visualization of large scale networks. CoRR' 05, 2005."},{"key":"e_1_3_2_1_4_1","volume-title":"Wherefore art thou r3579x?: Anonymized social networks, hidden patterns, and structural steganography","author":"Backstrom L.","year":"2007","unstructured":"L. Backstrom , C. Dwork , and J. M. Kleinberg . Wherefore art thou r3579x?: Anonymized social networks, hidden patterns, and structural steganography . 2007 . L. Backstrom, C. Dwork, and J. M. Kleinberg. Wherefore art thou r3579x?: Anonymized social networks, hidden patterns, and structural steganography. 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807218"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"e_1_3_2_1_7_1","unstructured":"S. Chester B. M. Kapron G. Ramesh G. Srivastava A. Thomo and S. Venkatesh. k-anonymization of social networks by vertex addition. In ADBIS' 11.  S. Chester B. M. Kapron G. Ramesh G. Srivastava A. Thomo and S. Venkatesh. k-anonymization of social networks by vertex addition. In ADBIS' 11 ."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453947"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453873"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611523"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376629"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.82"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217302"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2068816.2068825"},{"key":"e_1_3_2_1_15_1","volume-title":"Social Networks","author":"Seidman S. B.","year":"1983","unstructured":"S. B. Seidman . Network structure and minimum degree . Social Networks , 1983 . S. B. Seidman. Network structure and minimum degree. Social Networks, 1983."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020599"},{"key":"e_1_3_2_1_17_1","first-page":"35","volume-title":"SDM' 11","author":"Tai C.-H.","unstructured":"C.-H. Tai , P. S. Yu , D.-N. Yang , and M.-S. Chen . Structural diversity for privacy in publishing social networks . In SDM' 11 , pages 35 -- 46 . C.-H. Tai, P. S. Yu, D.-N. Yang, and M.-S. Chen. Structural diversity for privacy in publishing social networks. In SDM' 11, pages 35--46."},{"key":"e_1_3_2_1_18_1","volume-title":"Social structure of facebook networks","author":"Traud A. L.","year":"2011","unstructured":"A. L. Traud , P. J. Mucha , M. A. Porter , and M. A. Porter . Social structure of facebook networks . 2011 . A. L. Traud, P. J. Mucha, M. A. Porter, and M. A. Porter. Social structure of facebook networks. 2011."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.6"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396823"},{"key":"e_1_3_2_1_21_1","unstructured":"X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In SDM' 08.  X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In SDM' 08 ."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921080"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497459"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687734"}],"event":{"name":"SSDBM '14: Conference on Scientific and Statistical Database Management","acronym":"SSDBM '14","location":"Aalborg Denmark"},"container-title":["Proceedings of the 26th International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2618243.2618269","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2618243.2618269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:06Z","timestamp":1750229766000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2618243.2618269"}},"subtitle":["structural anonymization of massive networks"],"short-title":[],"issued":{"date-parts":[[2014,6,30]]},"references-count":24,"alternative-id":["10.1145\/2618243.2618269","10.1145\/2618243"],"URL":"https:\/\/doi.org\/10.1145\/2618243.2618269","relation":{},"subject":[],"published":{"date-parts":[[2014,6,30]]},"assertion":[{"value":"2014-06-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}