{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T16:31:45Z","timestamp":1723653105766},"publisher-location":"Philadelphia, PA","reference-count":0,"publisher":"Society for Industrial and Applied Mathematics","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1,6]]},"DOI":"10.1137\/1.9781611973105.78","type":"proceedings-article","created":{"date-parts":[[2013,12,19]],"date-time":"2013-12-19T18:32:45Z","timestamp":1387477965000},"source":"Crossref","is-referenced-by-count":5,"title":["Lattice Sparsification and the Approximate Closest Vector Problem"],"prefix":"10.1137","author":[{"given":"Daniel","family":"Dadush","sequence":"first","affiliation":[]},{"given":"G\u00e1bor","family":"Kun","sequence":"additional","affiliation":[]}],"member":"351","published-online":{"date-parts":[[2013,12,18]]},"event":{"name":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms"},"container-title":["Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611973105.78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T17:03:14Z","timestamp":1547226194000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/1.9781611973105.78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,6]]},"references-count":0,"alternative-id":["10.1137\/1.9781611973105.78","10.1137\/1.9781611973105"],"URL":"https:\/\/doi.org\/10.1137\/1.9781611973105.78","relation":{},"subject":[],"published":{"date-parts":[[2013,1,6]]}}}