{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:15:46Z","timestamp":1759032946774},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/tit.2015.2418284","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T18:08:13Z","timestamp":1428084493000},"page":"3056-3074","source":"Crossref","is-referenced-by-count":5,"title":["From Small-World Networks to Comparison-Based Search"],"prefix":"10.1109","volume":"61","author":[{"given":"Amin","family":"Karbasi","sequence":"first","affiliation":[]},{"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"Massoulie","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/06067626X"},{"key":"ref11","first-page":"376","article-title":"A doubling dimension threshold $\\theta (\\log \\log n)$ for augmented graph navigability","author":"fraigniaud","year":"2006","journal-title":"Algorithms–ESA"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806744"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0123019"},{"key":"ref14","article-title":"Shape recognition and twenty questions","author":"geman","year":"1993"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480192243516"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341538"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071382"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510013"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.7551\/mitpress\/4908.003.0005","article-title":"Nearest-neighbor searching and metric space dimensions","author":"clarkson","year":"2006","journal-title":"Nearest-Neighbor Methods in Learning and Vision Theory and Practice"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02260-9","author":"white","year":"2009","journal-title":"Exploratory Search Beyond the Query-Response Paradigm"},{"key":"ref3","first-page":"438","article-title":"Visual recognition with humans in the loop","author":"branson","year":"2010","journal-title":"Proc 11th ECCV"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref5","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9073-y"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_46"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.120"},{"key":"ref9","first-page":"791","article-title":"Greedy routing in tree-decomposed graphs","author":"fraigniaud","year":"2005","journal-title":"Proc Eur Symp Algorithms (ESA)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.36"},{"key":"ref21","first-page":"798","article-title":"Navigating nets: Simple algorithms for proximity search","author":"krauthgamer","year":"2004","journal-title":"Proc SODA"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073823"},{"key":"ref23","article-title":"Online algorithms for maintaining the topological order of a directed acyclic graph","author":"pearce","year":"2003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454139"},{"key":"ref25","article-title":"Approximate nearest neighbor search through comparisons","author":"tschopp","year":"2009"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7109216\/07078845.pdf?arnumber=7078845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T05:23:25Z","timestamp":1691558605000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7078845\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":27,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2418284","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}