{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:57Z","timestamp":1773377577993,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849322","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2414-2418","source":"Crossref","is-referenced-by-count":3,"title":["Relaxed Locally Correctable Codes in Computationally Bounded Channels"],"prefix":"10.1109","author":[{"given":"Jeremiah","family":"Blocki","sequence":"first","affiliation":[{"name":"Department of Computer Science, Purdue University"}]},{"given":"Venkata","family":"Gandikota","sequence":"additional","affiliation":[{"name":"College of Information and Computer Science, University of Massachusetts"}]},{"given":"Elena","family":"Grigorescu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Purdue University"}]},{"given":"Samson","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Informatics, Computing, and Engineering, Indiana University"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_29"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134031"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_4"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(75)90037-1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref37","first-page":"373","article-title":"Publicly verifiable proofs of sequential work","author":"mahmoody","year":"2013","journal-title":"ITCS 2013"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53008-5_9"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70500-2_15"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_1"},{"key":"ref10","article-title":"Some applications of coding theory in computational complexity","author":"trevisan","year":"2004","journal-title":"CoRR"},{"key":"ref11","first-page":"72","article-title":"A survey on private information retrieval (column: Computational complexity)","volume":"82","author":"gasarch","year":"2004","journal-title":"Bulletin of the EATCS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/090772721"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/100804322"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3051093"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2993749.2993761"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446810"},{"key":"ref19","first-page":"27:1","article-title":"Relaxed locally correctable codes","author":"gur","year":"2018","journal-title":"ITCS"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22935-0_51"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200880"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/110834949"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301397"},{"key":"ref9","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":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57785-8_183"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_1"},{"key":"ref21","article-title":"Error correction against computationally bounded adversaries","author":"ding","year":"2004"},{"key":"ref24","first-page":"45:1","article-title":"Explicit list-decodable codes with optimal rate for computationally bounded channels","author":"shaltiel","year":"2016","journal-title":"APPROX\/RANDOM"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2936015"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73420-8_35"},{"key":"ref25","article-title":"Relaxed locally correctable codes in computationally bounded channels","author":"blocki","year":"2018","journal-title":"CoRR"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849322.pdf?arnumber=8849322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:27Z","timestamp":1773347667000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849322\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849322","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}