{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:27Z","timestamp":1750306767346,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,7]],"date-time":"2013-10-07T00:00:00Z","timestamp":1381104000000},"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":[[2013,10,7]]},"DOI":"10.1145\/2512938.2512944","type":"proceedings-article","created":{"date-parts":[[2013,10,8]],"date-time":"2013-10-08T13:27:04Z","timestamp":1381238824000},"page":"131-142","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Scalable similarity estimation in social networks"],"prefix":"10.1145","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA, USA"}]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA, USA"}]},{"given":"Fabian","family":"Fuchs","sequence":"additional","affiliation":[{"name":"KIT, Karlsruhe, Germany"}]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA, USA"}]},{"given":"Moises","family":"Goldszmidt","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA, USA"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[{"name":"Microsoft Research SVC, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,10,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627949"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424365"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_3_2_1_4_1","first-page":"27","article-title":"How to search a social network","author":"Adamic L. A.","year":"2005","unstructured":"L. A. Adamic and E. Adar . How to search a social network . Social Networks , 27 , 2005 . L. A. Adamic and E. Adar. How to search a social network. Social Networks, 27, 2005.","journal-title":"Social Networks"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963493"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2050728.2050738"},{"key":"e_1_3_2_1_8_1","unstructured":"P. Boldi and S. Vigna. Studying network structures for IR: The impact of size. http:\/\/ecir2012.upf.edu\/ecir_paolo_boldi.pdf 2012.  P. Boldi and S. Vigna. Studying network structures for IR: The impact of size. http:\/\/ecir2012.upf.edu\/ecir_paolo_boldi.pdf 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"e_1_3_2_1_10_1","volume-title":"WWW","author":"Brin S.","year":"1998","unstructured":"S. Brin and L. Page . The anatomy of a large-scale hypertextual web search engine . In WWW , 1998 . S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In WWW, 1998."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.10.007"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.016"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281133"},{"key":"e_1_3_2_1_18_1","volume-title":"RANDOM","author":"Cohen E.","year":"2013","unstructured":"E. Cohen and H. Kaplan . What you can do with coordinated samples . In RANDOM , 2013 . E. Cohen and H. Kaplan. What you can do with coordinated samples. In RANDOM, 2013."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987334.1987345"},{"key":"e_1_3_2_1_20_1","first-page":"365","article-title":"Residual closeness in networks","author":"Dangalchev C.","year":"2006","unstructured":"C. Dangalchev . Residual closeness in networks . Phisica A , 365 , 2006 . C. Dangalchev. Residual closeness in networks. Phisica A, 365, 2006.","journal-title":"Phisica A"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb026526"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_2_1_25_1","volume-title":"Introduction to Statistical Inference","author":"Keeping E. S.","year":"1962","unstructured":"E. S. Keeping . Introduction to Statistical Inference . Dover , 1962 . E. S. Keeping. Introduction to Statistical Inference. Dover, 1962."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775059"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124379"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289527"},{"key":"e_1_3_2_1_32_1","first-page":"11","article-title":"Rethinking centrality: Methods and examples","author":"Stephenson K. A.","year":"1989","unstructured":"K. A. Stephenson and M. Zelen . Rethinking centrality: Methods and examples . Social Networks , 11 , 1989 . K. A. Stephenson and M. Zelen. Rethinking centrality: Methods and examples. Social Networks, 11, 1989.","journal-title":"Social Networks"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380798"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"}],"event":{"name":"COSN'13: Conference on Online Social Networks","sponsor":["ACM Association for Computing Machinery"],"location":"Boston Massachusetts USA","acronym":"COSN'13"},"container-title":["Proceedings of the first ACM conference on Online social networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2512938.2512944","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2512938.2512944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:51Z","timestamp":1750231731000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2512938.2512944"}},"subtitle":["closeness, node labels, and random edge lengths"],"short-title":[],"issued":{"date-parts":[[2013,10,7]]},"references-count":32,"alternative-id":["10.1145\/2512938.2512944","10.1145\/2512938"],"URL":"https:\/\/doi.org\/10.1145\/2512938.2512944","relation":{},"subject":[],"published":{"date-parts":[[2013,10,7]]},"assertion":[{"value":"2013-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}