{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:45Z","timestamp":1759063605928,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/infocom.2016.7524580","type":"proceedings-article","created":{"date-parts":[[2016,7,28]],"date-time":"2016-07-28T16:47:54Z","timestamp":1469724474000},"page":"1-9","source":"Crossref","is-referenced-by-count":8,"title":["High-precision shortest distance estimation for large-scale social networks"],"prefix":"10.1109","author":[{"given":"Jie","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangyang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2011.247162"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556554"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610500"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752948"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2373359"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref16","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"2009","journal-title":"Submitted to a journal"},{"key":"ref17","article-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010","journal-title":"UIUC Technical Report UILU-ENG-09&#x2013;2214"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/070698920"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"ref3","first-page":"45:1","article-title":"Christian Sommer. Shortest-path queries in static networks","volume":"46","year":"2014","journal-title":"ACM Computing Surveys"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028827"},{"key":"ref5","first-page":"170","article-title":"Predicting internet network distance with coordinates-based approaches","volume":"1","author":"eugene ng","year":"2002","journal-title":"Proceedings of IEEE Infocom"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.27"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884026"},{"journal-title":"An introduction to Twitter","year":"2015","key":"ref2"},{"journal-title":"Facebook Reports First Quarter","year":"2015","key":"ref1"},{"key":"ref9","first-page":"5","article-title":"Orion: shortest path estimation for large social graphs","author":"zhao","year":"2010","journal-title":"Proceedings of the Third USENIX Workshop on Online Social Networks"},{"key":"ref20","first-page":"539","article-title":"Learning to discover social circles in ego networks","author":"leskovec","year":"2012","journal-title":"Advances in neural information processing systems"}],"event":{"name":"IEEE INFOCOM 2016 - IEEE Conference on Computer Communications","start":{"date-parts":[[2016,4,10]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2016,4,14]]}},"container-title":["IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7515093\/7524326\/07524580.pdf?arnumber=7524580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,9,29]],"date-time":"2016-09-29T19:54:36Z","timestamp":1475178876000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7524580\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/infocom.2016.7524580","relation":{},"subject":[],"published":{"date-parts":[[2016,4]]}}}