{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:02Z","timestamp":1773377522120,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174519","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1195-1200","source":"Crossref","is-referenced-by-count":4,"title":["On the Randomized Babai Point"],"prefix":"10.1109","author":[{"given":"Xiao-Wen","family":"Chang","sequence":"first","affiliation":[{"name":"McGill University,School of Computer Science,Montreal,Canada,H3A 0E9"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhilong","family":"Chen","sequence":"additional","affiliation":[{"name":"McGill University,School of Computer Science,Montreal,Canada,H3A 0E9"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingzi","family":"Xu","sequence":"additional","affiliation":[{"name":"McGill University,School of Computer Science,Montreal,Canada,H3A 0E9"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"937","article-title":"Finding the closest lattice vector when it’s unusually close","author":"klein","year":"2000","journal-title":"Proc ACM-SIAM symposium on Discrete algorithms"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253596"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717822"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2592521"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162180"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2929922"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2926470"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s001900050199"},{"key":"ref9","article-title":"Trapdoors for hard lattices and new cryptographic constructions","author":"gentry","year":"2007","journal-title":"Cryptology ePrint Archive Report 2007\/432"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174519.pdf?arnumber=9174519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:14Z","timestamp":1773347654000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174519\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174519","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}