{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T19:56:42Z","timestamp":1791143802485,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,8,20]]},"DOI":"10.1145\/1150402.1150432","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"245-255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":94,"title":["Measuring and extracting proximity in networks"],"prefix":"10.1145","author":[{"given":"Yehuda","family":"Koren","sequence":"first","affiliation":[{"name":"AT&amp;T Labs - Research, Florham Park, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen C.","family":"North","sequence":"additional","affiliation":[{"name":"AT&amp;T Labs - Research, Florham Park, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chris","family":"Volinsky","sequence":"additional","affiliation":[{"name":"AT&amp;T Labs - Research, Florham Park, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090193.1090195"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_44"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/264645.264657"},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"1990","unstructured":"T. H. Cormen , C. L. Leiserson , and R. L. Rivest . Introduction to Algorithms . McGraw-Hill and the MIT Press , 1990 . T. H. Cormen, C. L. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill and the MIT Press, 1990."},{"key":"e_1_3_2_1_7_1","unstructured":"DBLP computer science bibliography. dblp.uni-trier.de.  DBLP computer science bibliography. dblp.uni-trier.de."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9781614440222"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014068"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347121"},{"key":"e_1_3_2_1_11_1","volume-title":"A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability , A Guide to the Theory of NP-Completeness . W. H. Freeman and Company , New York , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/276627.276652"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1"},{"key":"e_1_3_2_1_14_1","unstructured":"Internet Movie Database. www.imdb.com.  Internet Movie Database. www.imdb.com."},{"key":"e_1_3_2_1_15_1","first-page":"26","volume-title":"Proc. 5th Workshop on Algorithm Engineering and Experimentation (ALENEX '05)","author":"John Hershberger M. M.","year":"2003","unstructured":"M. M. John Hershberger and S. Suri . Finding the k shortest simple paths: A new algorithm and its implementation . In Proc. 5th Workshop on Algorithm Engineering and Experimentation (ALENEX '05) , pages 26 -- 36 . SIAM, 2003 . M. M. John Hershberger and S. Suri. Finding the k shortest simple paths: A new algorithm and its implementation. In Proc. 5th Workshop on Algorithm Engineering and Experimentation (ALENEX '05), pages 26--36. SIAM, 2003."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120406"},{"key":"e_1_3_2_1_17_1","volume-title":"Yahoo Research Labs","author":"Lang K.","year":"2004","unstructured":"K. Lang . Finding good nearly balanced cuts in power law graphs. Technical report , Yahoo Research Labs , 2004 . K. Lang. Finding good nearly balanced cuts in power law graphs. Technical report, Yahoo Research Labs, 2004."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. Workshop on Learning Statistical Models from Relational Data (IJCAI '03)","author":"Popescul A.","year":"2003","unstructured":"A. Popescul and L. H. Ungar . Statistical relational learning for link prediction . In Proc. Workshop on Learning Statistical Models from Relational Data (IJCAI '03) , 2003 . A. Popescul and L. H. Ungar. Statistical relational learning for link prediction. In Proc. Workshop on Learning Statistical Models from Relational Data (IJCAI '03), 2003."},{"key":"e_1_3_2_1_20_1","volume-title":"Statistical Research Division","author":"Winkler W. E.","year":"1999","unstructured":"W. E. Winkler . The state of record linkage and current research problems. Technical report , Statistical Research Division , U.S. Bureau of the Census, 1999 . W. E. Winkler. The state of record linkage and current research problems. Technical report, Statistical Research Division, U.S. Bureau of the Census, 1999."}],"event":{"name":"KDD06: The 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Philadelphia PA USA","acronym":"KDD06","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1150402.1150432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T09:24:17Z","timestamp":1673169857000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1150402.1150432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,20]]},"references-count":20,"alternative-id":["10.1145\/1150402.1150432","10.1145\/1150402"],"URL":"https:\/\/doi.org\/10.1145\/1150402.1150432","relation":{},"subject":[],"published":{"date-parts":[[2006,8,20]]},"assertion":[{"value":"2006-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}