{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:24Z","timestamp":1772164044622,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,15]],"date-time":"2011-08-15T00:00:00Z","timestamp":1313366400000},"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":[[2011,8,15]]},"DOI":"10.1145\/2018436.2018491","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T11:22:45Z","timestamp":1314789765000},"page":"406-407","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Pomelo"],"prefix":"10.1145","author":[{"given":"Zhuo","family":"Chen","sequence":"first","affiliation":[{"name":"Tsinghua Universiy, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Chen","sequence":"additional","affiliation":[{"name":"Duke University, Durham, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Ding","sequence":"additional","affiliation":[{"name":"University of Goettingen, Goettingen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beixing","family":"Deng","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,8,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Social computing data repository at arizona state university. http:\/\/socialcomputing.asu.edu\/.  Social computing data repository at arizona state university. http:\/\/socialcomputing.asu.edu\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01399-7_25"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015471"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of NSDI","author":"Ledlie J.","year":"2007","unstructured":"J. Ledlie , P. Gardner , and M. Seltzer . Network coordinates in the wild . In Proc. of NSDI , 2007 . J. Ledlie, P. Gardner, and M. Seltzer. Network coordinates in the wild. In Proc. of NSDI, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. of The 3rd Workshop on Online Social Networks (WOSN)","author":"Zhao X.","year":"2010","unstructured":"X. Zhao , A. Sala , C. Wilson , H. Zheng , and B. Y. Zhao . Orion: shortest path estimation for large social graphs . In Proc. of The 3rd Workshop on Online Social Networks (WOSN) , 2010 . X. Zhao, A. Sala, C. Wilson, H. Zheng, and B. Y. Zhao. Orion: shortest path estimation for large social graphs. In Proc. of The 3rd Workshop on Online Social Networks (WOSN), 2010."}],"event":{"name":"SIGCOMM '11: ACM SIGCOMM 2011 Conference","location":"Toronto Ontario Canada","acronym":"SIGCOMM '11","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2011 conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2018436.2018491","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2018436.2018491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:46Z","timestamp":1750225726000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2018436.2018491"}},"subtitle":["accurate and decentralized shortest-path distance estimation in social graphs"],"short-title":[],"issued":{"date-parts":[[2011,8,15]]},"references-count":6,"alternative-id":["10.1145\/2018436.2018491","10.1145\/2018436"],"URL":"https:\/\/doi.org\/10.1145\/2018436.2018491","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2043164.2018491","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,8,15]]},"assertion":[{"value":"2011-08-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}