{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T11:18:23Z","timestamp":1772968703925,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,31]],"date-time":"2009-03-31T00:00:00Z","timestamp":1238457600000},"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,3,31]]},"DOI":"10.1145\/1578002.1578005","type":"proceedings-article","created":{"date-parts":[[2009,8,4]],"date-time":"2009-08-04T13:38:06Z","timestamp":1249393086000},"page":"13-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["Eight friends are enough"],"prefix":"10.1145","author":[{"given":"Joseph","family":"Bonneau","sequence":"first","affiliation":[{"name":"University of Cambridge Computer Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Anderson","sequence":"additional","affiliation":[{"name":"University of Cambridge Computer Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ross","family":"Anderson","sequence":"additional","affiliation":[{"name":"University of Cambridge Computer Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stajano","sequence":"additional","affiliation":[{"name":"University of Cambridge Computer Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,3,31]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"http:\/\/www.facebook.com\/policy.php","author":"Facebook","year":"2009","unstructured":"Facebook privacy policy. http:\/\/www.facebook.com\/policy.php ( 2009 ). Facebook privacy policy. http:\/\/www.facebook.com\/policy.php (2009)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11957454_3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/297805.297827"},{"key":"e_1_3_2_1_7_1","first-page":"3","volume":"4","author":"Chvatal","year":"1979","unstructured":"Chvatal , V. A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research 4 , 3 ( 1979 ), 233--235. Chvatal, V. A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research 4, 3 (1979), 233--235.","journal-title":"A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_3_2_1_9_1","volume-title":"WEIS: Workshop on the Economics of Information Security","author":"Danezis G.","year":"2006","unstructured":"Danezis , G. , and Wittneben , B . The economics of mass surveillance and the questionable value of anonymous communications . WEIS: Workshop on the Economics of Information Security ( 2006 ). Danezis, G., and Wittneben, B. The economics of mass surveillance and the questionable value of anonymous communications. WEIS: Workshop on the Economics of Information Security (2006)."},{"key":"e_1_3_2_1_10_1","volume-title":"Trust and privacy concern within social networking sites: A comparison of facebook and myspace. America's Conference on Information Systems","author":"Dwyer C.","year":"2007","unstructured":"Dwyer , C. , Hiltz , S. R. , and Passerini , K . Trust and privacy concern within social networking sites: A comparison of facebook and myspace. America's Conference on Information Systems ( 2007 ). Dwyer, C., Hiltz, S. R., and Passerini, K. Trust and privacy concern within social networking sites: A comparison of facebook and myspace. America's Conference on Information Systems (2007)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290958.1290968"},{"key":"e_1_3_2_1_13_1","volume-title":"Reducibility Among Combinatorial Problems. Complexity of Computer Computations","author":"Karp R.","year":"1972","unstructured":"Karp , R. Reducibility Among Combinatorial Problems. Complexity of Computer Computations ( 1972 ). Karp, R. Reducibility Among Combinatorial Problems. Complexity of Computer Computations (1972)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397744"},{"key":"e_1_3_2_1_15_1","volume-title":"WEIS: Workshop on the Economics of Information Security","author":"Nagaraja S.","year":"2008","unstructured":"Nagaraja , S. The economics of covert community detection and hiding . WEIS: Workshop on the Economics of Information Security ( 2008 ). Nagaraja, S. The economics of covert community detection and hiding. WEIS: Workshop on the Economics of Information Security (2008)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.75"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_3_2_1_19_1","volume-title":"International Conference on Data Engineering","author":"Xu W.","year":"2008","unstructured":"Xu , W. , Zhou , X. , and Li , L . Inferring privacy information via social relations . International Conference on Data Engineering ( 2008 ). Xu, W., Zhou, X., and Li, L. Inferring privacy information via social relations. International Conference on Data Engineering (2008)."}],"event":{"name":"EuroSys '09: Fourth EuroSys Conference 2009","location":"Nuremberg Germany","acronym":"EuroSys '09","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the Second ACM EuroSys Workshop on Social Network Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1578002.1578005","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1578002.1578005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:16Z","timestamp":1750253416000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1578002.1578005"}},"subtitle":["social graph approximation via public listings"],"short-title":[],"issued":{"date-parts":[[2009,3,31]]},"references-count":19,"alternative-id":["10.1145\/1578002.1578005","10.1145\/1578002"],"URL":"https:\/\/doi.org\/10.1145\/1578002.1578005","relation":{},"subject":[],"published":{"date-parts":[[2009,3,31]]},"assertion":[{"value":"2009-03-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}