{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T11:28:48Z","timestamp":1747308528441,"version":"3.37.3"},"reference-count":22,"publisher":"Oxford University Press (OUP)","issue":"3","funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Project Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006234","name":"Sandia National Laboratories","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006234","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7,1]]},"DOI":"10.1093\/comnet\/cnx034","type":"journal-article","created":{"date-parts":[[2017,8,11]],"date-time":"2017-08-11T23:13:21Z","timestamp":1502493201000},"page":"321-341","source":"Crossref","is-referenced-by-count":5,"title":["An improved hyperbolic embedding algorithm"],"prefix":"10.1093","volume":"6","author":[{"given":"Kenny","family":"Chowdhary","sequence":"first","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA"}]},{"given":"Tamara G","family":"Kolda","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA"}]}],"member":"286","published-online":{"date-parts":[[2017,12,11]]},"reference":[{"key":"key\n\t\t\t\t20180611073749_B1","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","article-title":"Hyperbolic geometry of complex networks.","volume":"82","author":"Krioukov","year":"2010","journal-title":"Phys. Rev. E"},{"key":"key\n\t\t\t\t20180611073749_B2","first-page":"170","article-title":"Predicting internet network distance with coordinates-based approaches.","author":"Ng","year":"2002","journal-title":"INFOCOM 2002: Proceedings of the Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies."},{"key":"key\n\t\t\t\t20180611073749_B3","first-page":"77","article-title":"Efficient shortest paths on massive social graphs.","volume-title":"COLCOM\u201911: Proceedings of the 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing","author":"Zhao","year":"2011"},{"key":"key\n\t\t\t\t20180611073749_B4","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/TNET.2004.838597","article-title":"Big-bang Simulation for embedding network distances in Euclidean space.","volume":"12","author":"Shavitt","year":"2004","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"key\n\t\t\t\t20180611073749_B5","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/INFCOM.2004.1354510","article-title":"On the curvature of the internet and its usage for overlay construction and distance estimation.","volume-title":"INFOCOM 2004: Proceedings of the Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies.","author":"Shavitt","year":"2004"},{"key":"key\n\t\t\t\t20180611073749_B6","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1038\/ncomms1063","article-title":"Sustaining the internet with hyperbolic mapping.","volume":"1","author":"Bogu\u00f1\u00e1","year":"2010","journal-title":"Nat. Commun."},{"key":"key\n\t\t\t\t20180611073749_B7","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1038\/nature11459","article-title":"Popularity versus similarity in growing networks.","volume":"489","author":"Papadopoulos","year":"2012","journal-title":"Nature"},{"key":"key\n\t\t\t\t20180611073749_B8","first-page":"143","article-title":"Virtual landmarks for the internet.","author":"Tang","year":"2003","journal-title":"IMC\u201903: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement."},{"key":"key\n\t\t\t\t20180611073749_B9","first-page":"159","article-title":"An I\/O-efficient distance oracle for evolving real-world graphs.","volume-title":"ALENEX \u201915: Proceedings of the Meeting on Algorithm Engineering & Expermiments","author":"Ajwani","year":"2015"},{"key":"key\n\t\t\t\t20180611073749_B10","first-page":"1","article-title":"Orion: shortest path estimation for large social graphs.","volume-title":"WOSN\u201910: Proceedings of the 3rd Wonference on Online Social Networks","author":"Zhao","year":"2010"},{"key":"key\n\t\t\t\t20180611073749_B11","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TNET.2013.2294052","article-title":"Network mapping by replaying hyperbolic growth.","volume":"23","author":"Papadopoulos","year":"2015","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"key\n\t\t\t\t20180611073749_B12","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.92.022807","article-title":"Network geometry inference using common neighbors.","volume":"92","author":"Papadopoulos","year":"2015","journal-title":"Phys. Rev. E"},{"key":"key\n\t\t\t\t20180611073749_B13","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","article-title":"A simplex method for function minimization.","volume":"7","author":"Nelder","year":"1965","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t20180611073749_B14","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","article-title":"Updating quasi-Newton matrices with limited storage.","volume":"35","author":"Nocedal","year":"1980","journal-title":"Math. Comput."},{"key":"key\n\t\t\t\t20180611073749_B15","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/S003614450242889","article-title":"Optimization by direct search: new perspectives on some classical and modern methods.","volume":"45","author":"Kolda","year":"2003","journal-title":"SIAM Rev."},{"key":"key\n\t\t\t\t20180611073749_B16","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/S1052623496303482","article-title":"Convergence of the Nelder\u2013Mead simplex method to a nonstationary point.","volume":"9","author":"McKinnon","year":"1998","journal-title":"SIAM J. Optim."},{"key":"key\n\t\t\t\t20180611073749_B17","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","article-title":"On the limited memory BFGS method for large scale optimization.","volume":"45","author":"Liu","year":"1989","journal-title":"Math. Program."},{"volume-title":"Numerical Optimization","year":"2006","author":"Nocedal","key":"key\n\t\t\t\t20180611073749_B18"},{"key":"key\n\t\t\t\t20180611073749_B19","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEC.1961.5219222","article-title":"An algorithm for path connections and its applications.","volume":"EC-10","author":"Lee","year":"1961","journal-title":"IRE Trans. Electron. Comput."},{"article-title":"SNAP Datasets: Stanford Large Network Dataset Collection.","year":"2014","author":"Leskovec","key":"key\n\t\t\t\t20180611073749_B20"},{"key":"key\n\t\t\t\t20180611073749_B21","first-page":"1:1","article-title":"SNAP: A general-purpose network analysis and graph-mining library.","volume":"8","author":"Leskovec","year":"2016","journal-title":"ACM Trans. Intell. Sys. Technol."},{"article-title":"Rigel.","year":"2013","author":"Zhao","key":"key\n\t\t\t\t20180611073749_B22"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/6\/3\/321\/25031954\/cnx034.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T06:23:22Z","timestamp":1569997402000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/6\/3\/321\/4727184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,11]]},"references-count":22,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2017,12,11]]},"published-print":{"date-parts":[[2018,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnx034","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"type":"print","value":"2051-1310"},{"type":"electronic","value":"2051-1329"}],"subject":[],"published-other":{"date-parts":[[2018,7]]},"published":{"date-parts":[[2017,12,11]]}}}