{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:44:32Z","timestamp":1750308272731,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T00:00:00Z","timestamp":1334016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["288021"],"award-info":[{"award-number":["288021"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,4,10]]},"DOI":"10.1145\/2181176.2181178","type":"proceedings-article","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T12:19:38Z","timestamp":1334060378000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["How much do your friends know about you?"],"prefix":"10.1145","author":[{"given":"Norbert","family":"Blenn","sequence":"first","affiliation":[{"name":"Delft University of Technology, GA Delft, The Netherlands"}]},{"given":"Christian","family":"Doerr","sequence":"additional","affiliation":[{"name":"Delft University of Technology, GA Delft, The Netherlands"}]},{"given":"Nasireddin","family":"Shadravan","sequence":"additional","affiliation":[{"name":"Delft University of Technology, GA Delft, The Netherlands"}]},{"given":"Piet","family":"Van Mieghem","sequence":"additional","affiliation":[{"name":"Delft University of Technology, GA Delft, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2012,4,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The meertens institute. Website 2012. http:\/\/www.meertens.knaw.nl\/cms\/en\/meertens-institute.  The meertens institute. Website 2012. http:\/\/www.meertens.knaw.nl\/cms\/en\/meertens-institute."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526784"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1578002.1578005"},{"key":"e_1_3_2_1_4_1","volume-title":"Efficient Implementations of Apriori and Eclat","author":"C. B. Department and C. Borgelt","year":"2003","unstructured":"C. B. Department and C. Borgelt . Efficient Implementations of Apriori and Eclat , 2003 . C. B. Department and C. Borgelt. Efficient Implementations of Apriori and Eclat, 2003."},{"key":"e_1_3_2_1_5_1","first-page":"314","volume-title":"NETWORKING","author":"Doerr C.","year":"2011","unstructured":"C. Doerr , S. Tang , N. Blenn , and P. Van Mieghem . Are friends overrated? a study for the social news aggregator digg.com . In NETWORKING 2011 , Part II, Lecture Notes in Computer Science 6641, pages 314 -- 327 . IFIP International Federation for Information Processing , 2011. C. Doerr, S. Tang, N. Blenn, and P. Van Mieghem. Are friends overrated? a study for the social news aggregator digg.com. In NETWORKING 2011, Part II, Lecture Notes in Computer Science 6641, pages 314--327. IFIP International Federation for Information Processing, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1086\/225469"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102199.1102214"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11760146_14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397744"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1672308.1672328"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1177\/000312240607100301"},{"key":"e_1_3_2_1_13_1","volume-title":"The Economist","author":"Miller A.","year":"2010","unstructured":"A. Miller . Untangling the social web . The Economist , September 2 2010 . A. Miller. Untangling the social web. The Economist, September 2 2010."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718519"},{"key":"e_1_3_2_1_15_1","volume-title":"Pulling sense out of today's informational chaos: Livejournal as a site of knowledge creation and sharing. First Monday, 8(12)","author":"Raynes-Goldie K.","year":"2004","unstructured":"K. Raynes-Goldie . Pulling sense out of today's informational chaos: Livejournal as a site of knowledge creation and sharing. First Monday, 8(12) , 2004 . K. Raynes-Goldie. Pulling sense out of today's informational chaos: Livejournal as a site of knowledge creation and sharing. First Monday, 8(12), 2004."},{"key":"e_1_3_2_1_16_1","first-page":"10","article-title":"Insurers test data profiles to identify risky clients. Wall Street Journal","author":"Scism L.","year":"2010","unstructured":"L. Scism and M. Maremont . Insurers test data profiles to identify risky clients. Wall Street Journal , Novmber 10 2010 . L. Scism and M. Maremont. Insurers test data profiles to identify risky clients. Wall Street Journal, Novmber 10 2010.","journal-title":"Novmber"},{"key":"e_1_3_2_1_17_1","volume-title":"New York Times","author":"Singer N.","year":"2011","unstructured":"N. Singer . Face recognition makes the leap from sci-fi . New York Times , November 12 2011 . N. Singer. Face recognition makes the leap from sci-fi. New York Times, November 12 2011."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076878"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526781"}],"event":{"name":"EuroSys '12: Seventh EuroSys Conference 2012","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Bern Switzerland","acronym":"EuroSys '12"},"container-title":["Proceedings of the Fifth Workshop on Social Network Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2181176.2181178","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2181176.2181178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:24:09Z","timestamp":1750267449000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2181176.2181178"}},"subtitle":["reconstructing private information from the friendship graph"],"short-title":[],"issued":{"date-parts":[[2012,4,10]]},"references-count":19,"alternative-id":["10.1145\/2181176.2181178","10.1145\/2181176"],"URL":"https:\/\/doi.org\/10.1145\/2181176.2181178","relation":{},"subject":[],"published":{"date-parts":[[2012,4,10]]},"assertion":[{"value":"2012-04-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}