{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T03:35:30Z","timestamp":1792035330753,"version":"4.4.0"},"publisher-location":"New York, New York, USA","reference-count":0,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1145\/1341531.1341538","type":"proceedings-article","created":{"date-parts":[[2008,3,12]],"date-time":"2008-03-12T22:35:48Z","timestamp":1205361348000},"page":"25","source":"Crossref","is-referenced-by-count":22,"title":["Disorder inequality"],"prefix":"10.1145","author":[{"given":"Navin","family":"Goyal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yury","family":"Lifshits","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hinrich","family":"Sch\u00fctze","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","event":{"name":"the international conference","location":"Palo Alto, California, USA","acronym":"WSDM '08","number":"2008","sponsor":["ACM, Association for Computing Machinery","SIGKDD, ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD, ACM Special Interest Group on Management of Data","SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR, ACM Special Interest Group on Information Retrieval"],"start":{"date-parts":[[2008,2,11]]},"end":{"date-parts":[[2008,2,12]]}},"container-title":["Proceedings of the international conference on Web search and web data mining  - WSDM '08"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1341531.1341538","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=1341538&ftid=519328&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:54Z","timestamp":1750253934000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=1341531.1341538"}},"subtitle":["a combinatorial approach to nearest neighbor search"],"proceedings-subject":"Web search and web data mining","short-title":[],"issued":{"date-parts":[[2008]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1145\/1341531.1341538","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}