{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:18:19Z","timestamp":1778087899262,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,5,8]],"date-time":"2007-05-08T00:00:00Z","timestamp":1178582400000},"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":[[2007,5,8]]},"DOI":"10.1145\/1242572.1242598","type":"proceedings-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:31Z","timestamp":1181140651000},"page":"181-190","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":554,"title":["Wherefore art thou r3579x?"],"prefix":"10.1145","author":[{"given":"Lars","family":"Backstrom","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia","family":"Dwork","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,5,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"L. Adamic E. Adar. How to search a social network. Social Networks 27(2005).  L. Adamic E. Adar. How to search a social network. Social Networks 27(2005).","DOI":"10.1016\/j.socnet.2005.01.007"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"L. Adamic O. Buyukkokten E. Adar. A Social Network Caught in the Web. First Monday 8(2003).  L. Adamic O. Buyukkokten E. Adar. A Social Network Caught in the Web. First Monday 8(2003).","DOI":"10.5210\/fm.v8i6.1057"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375602"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335438"},{"key":"e_1_3_2_1_5_1","volume-title":"The Probabilistic Method","author":"Alon N.","year":"1992","unstructured":"N. Alon , J. Spencer , The Probabilistic Method , 1992 . N. Alon, J. Spencer, The Probabilistic Method, 1992."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_7_1","volume-title":"New York Times","author":"Barbaro M.","year":"2006","unstructured":"M. Barbaro , T. Zeller . A Face Is Exposed for AOL Searcher No. 4417749 . New York Times , 9 August 2006 . M. Barbaro, T. Zeller. A Face Is Exposed for AOL Searcher No. 4417749. New York Times, 9 August 2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","year":"2001","unstructured":"B. Bollob\u00e1s . Random Graphs . Cambridge , 2001 . B. Bollob\u00e1s. Random Graphs. Cambridge, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_13_1","unstructured":"C. Dwork F. McSherry and K. Talwar The Price of Privacy and the Limits of LP Decoding submitted for publication.  C. Dwork F. McSherry and K. Talwar The Price of Privacy and the Limits of LP Decoding submitted for publication."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1947-08785-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773174"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"G. Flake R. Tarjan K. Tsioutsiouliklis. Graph Clustering and Minimum Cut Trees. Internet Math. 1(2004).  G. Flake R. Tarjan K. Tsioutsiouliklis. Graph Clustering and Minimum Cut Trees. Internet Math. 1(2004).","DOI":"10.1080\/15427951.2004.10129093"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-905-7_3"},{"key":"e_1_3_2_1_18_1","series-title":"SIAM J. Appl. Math., 9:551--570","volume-title":"Multi-Terminal Network Flows","author":"Gomory R.","year":"1961","unstructured":"R. Gomory , T.C. Hu . ( 1961 ). Multi-Terminal Network Flows . SIAM J. Appl. Math., 9:551--570 . R. Gomory, T.C. Hu. (1961). Multi-Terminal Network Flows. SIAM J. Appl. Math., 9:551--570."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1116869"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1035134.1035162"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150476"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"D. Liben-Nowell R. Kumar J. Novak P. Raghavan A. Tomkins. Geographic routing in social networks. PNAS 102(2005).  D. Liben-Nowell R. Kumar J. Novak P. Raghavan A. Tomkins. Geographic routing in social networks. PNAS 102(2005).","DOI":"10.1073\/pnas.0503018102"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142373"},{"key":"e_1_3_2_1_24_1","volume-title":"Oct.","author":"Narayanan A","year":"2006","unstructured":"A Narayanan , V. Shmatikov How To Break Anonymity of the Netflix Prize Dataset. arxiv cs\/0610105 , Oct. 2006 . A Narayanan, V. Shmatikov How To Break Anonymity of the Netflix Prize Dataset. arxiv cs\/0610105, Oct. 2006."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988678"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"L. Sweeney. Weaving technology and policy together to maintain confidentiality. J Law Med Ethics 25(1997).  L. Sweeney. Weaving technology and policy together to maintain confidentiality. J Law Med Ethics 25(1997).","DOI":"10.1111\/j.1748-720X.1997.tb01885.x"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"}],"event":{"name":"WWW'07: 16th International World Wide Web Conference","location":"Banff Alberta Canada","acronym":"WWW'07","sponsor":["ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 16th international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1242572.1242598","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1242572.1242598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:53Z","timestamp":1750258073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1242572.1242598"}},"subtitle":["anonymized social networks, hidden patterns, and structural steganography"],"short-title":[],"issued":{"date-parts":[[2007,5,8]]},"references-count":27,"alternative-id":["10.1145\/1242572.1242598","10.1145\/1242572"],"URL":"https:\/\/doi.org\/10.1145\/1242572.1242598","relation":{},"subject":[],"published":{"date-parts":[[2007,5,8]]},"assertion":[{"value":"2007-05-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}