{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:31:18Z","timestamp":1776285078957,"version":"3.50.1"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1755708"],"award-info":[{"award-number":["CNS-1755708"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1910659"],"award-info":[{"award-number":["CCF-1910659"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1649515"],"award-info":[{"award-number":["CCF-1649515"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1910659"],"award-info":[{"award-number":["CCF-1910659"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1910411"],"award-info":[{"award-number":["CCF-1910411"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007289","name":"Purdue Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007289","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1649515"],"award-info":[{"award-number":["CCF-1649515"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Simons Investigator Award of David P. Woodruff"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/tit.2021.3076396","type":"journal-article","created":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T20:37:17Z","timestamp":1619642237000},"page":"4338-4360","source":"Crossref","is-referenced-by-count":8,"title":["Relaxed Locally Correctable Codes in Computationally Bounded Channels"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5542-4674","authenticated-orcid":false,"given":"Jeremiah","family":"Blocki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2381-7788","authenticated-orcid":false,"given":"Venkata","family":"Gandikota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9673-4313","authenticated-orcid":false,"given":"Elena","family":"Grigorescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8288-5698","authenticated-orcid":false,"given":"Samson","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3051093"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0094-2"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22935-0_51"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_8"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2936015"},{"key":"ref30","first-page":"27:1","article-title":"Relaxed locally correctable codes","author":"gur","year":"2018","journal-title":"Proc ITC"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0432-z"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1201\/b17668"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.007"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref28","first-page":"113","article-title":"A survey on private information retrieval (column: Computational complexity)","volume":"82","author":"gasarch","year":"2004","journal-title":"Bull EATCS"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(75)90037-1"},{"key":"ref29","article-title":"On post-modern cryptography","author":"goldreich","year":"2006"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134031"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53008-5_9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_29"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_15"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/100804322"},{"key":"ref23","article-title":"Error correction against computationally bounded adversaries","author":"ding","year":"2004"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/090772721"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.8"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70500-2_16"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"},{"key":"ref54","article-title":"Some applications of coding theory in computational complexity","volume":"cs cc 409044","author":"trevisan","year":"2004","journal-title":"CoRR"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301397"},{"key":"ref52","first-page":"45:1","article-title":"Explicit list-decodable codes with optimal rate for computationally bounded channels","author":"shaltiel","year":"2016","journal-title":"Proc Approximation Randomization Combinat Optim Algorithms Techn (APPROX\/RANDOM)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446810"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2993749.2993761"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200880"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42045-0_17"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243773"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70500-2_15"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/110834949"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.84"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_1"},{"key":"ref6","first-page":"47","article-title":"Optimal hashing-based time-space trade-offs for approximate near neighbors","author":"andoni","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref5","article-title":"Cumulative space in black-white pebbling and resolution","author":"alwen","year":"2017","journal-title":"Proc 8th Innov Theor Comput Sci Conf (ITCS)"},{"key":"ref8","article-title":"Relaxed locally correctable codes with improved parameters","author":"asadi","year":"2020","journal-title":"arXiv 2009 07311"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746622"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73420-8_35"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70500-2_17"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422479"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_2"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754402"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_1"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57785-8_183"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/19M1307834"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9457114\/9417090-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9457114\/09417090.pdf?arnumber=9417090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:26Z","timestamp":1652194466000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9417090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":56,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3076396","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}