{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:14:07Z","timestamp":1781259247672,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"ERC Starting Grant","award":["101163189"],"award-info":[{"award-number":["101163189"]}]},{"name":"UKRI Future Leaders Fellowship","award":["MR\/X023583\/1"],"award-info":[{"award-number":["MR\/X023583\/1"]}]},{"name":"NSF CCF","award":["2227876"],"award-info":[{"award-number":["2227876"]}]},{"name":"NSF CAREER","award":["2239160"],"award-info":[{"award-number":["2239160"]}]},{"name":"NSF GRFP DGE","award":["2141064"],"award-info":[{"award-number":["2141064"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800857","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1489-1496","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["3-Query RLDCs Are Strictly Stronger Than 3-Query LDCs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7864-7013","authenticated-orcid":false,"given":"Tom","family":"Gur","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8093-1328","authenticated-orcid":false,"given":"Dor","family":"Minzer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1213-8473","authenticated-orcid":false,"given":"Guy","family":"Weissenberg","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0436-8131","authenticated-orcid":false,"given":"Kai Zhe","family":"Zheng","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585143"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00493-003-0025-0"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2021.18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00059"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649714"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718197"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446810"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1595391.1595394"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/050646445"},{"key":"e_1_3_2_1_12_1","volume-title":"On relaxed locally decodable codes for hamming and insertion-deletion errors. arXiv preprint arXiv:2209.08688","author":"Block Alex","year":"2022","unstructured":"Alex Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, and Minshen Zhu. 2022. On relaxed locally decodable codes for hamming and insertion-deletion errors. arXiv preprint arXiv:2209.08688 (2022)."},{"key":"e_1_3_2_1_13_1","volume-title":"Outlaw distributions and locally decodable codes. arXiv preprint arXiv:1609.06355","author":"Bri\u00ebt Jop","year":"2016","unstructured":"Jop Bri\u00ebt, Zeev Dvir, and Sivakanth Gopi. 2016. Outlaw distributions and locally decodable codes. arXiv preprint arXiv:1609.06355 (2016)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-018-0168-4"},{"key":"e_1_3_2_1_15_1","volume-title":"Efficient and errorcorrecting data structures for membership and polynomial evaluation. arXiv preprint arXiv:0909.3696","author":"Chen Victor","year":"2009","unstructured":"Victor Chen, Elena Grigorescu, and Ronald de Wolf. 2009. Efficient and errorcorrecting data structures for membership and polynomial evaluation. arXiv preprint arXiv:0909.3696 (2009)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M135515X"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2024.8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1422781"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-10-"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649685"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649780"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236459"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0014-4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/100788161"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746630"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446962"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/090772721"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3710795.3710799"},{"key":"e_1_3_2_1_32_1","volume-title":"Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies. ECCC preprint TR25-192","author":"Goldberg Guy","year":"2025","unstructured":"Guy Goldberg, Tom Gur, and Sidhant Saraogi. 2025. Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies. ECCC preprint TR25-192 (2025)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108135252"},{"key":"e_1_3_2_1_34_1","volume-title":"On the relaxed LDC of BGHSV: A survey that corrects the record. Electron. Colloquium Comput. Complex. TR24-078","author":"Goldreich Oded","year":"2024","unstructured":"Oded Goldreich. 2024. On the relaxed LDC of BGHSV: A survey that corrects the record. Electron. Colloquium Comput. Complex. TR24-078 (2024). ECCC:TR24-078 https:\/\/eccc.weizmann.ac.il\/report\/2024\/078"},{"key":"e_1_3_2_1_35_1","unstructured":"Oded Goldreich and Tom Gur. 2018. Universal Locally Testable Codes. Chicago J. Theor. Comput. Sci. (2018)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.05.030"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319907"},{"key":"e_1_3_2_1_38_1","volume-title":"Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. arXiv preprint arXiv:2511.02633","author":"Grigorescu Elena","year":"2025","unstructured":"Elena Grigorescu, Vinayak M Kumar, Peter Manohar, and Geoffrey Mon. 2025. Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes. arXiv preprint arXiv:2511.02633 (2025)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1307834"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2020"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-016-0136-9"},{"key":"e_1_3_2_1_42_1","unstructured":"Venkatesan Guruswami Xuandi Ren and Kewen Wu. 2025. PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs. arXiv:2507.01192 [cs.CC] https:\/\/arxiv.org\/abs\/2507.01192"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649657"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649611"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9169-y"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754402"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_115"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1326554"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:37:41Z","timestamp":1781217461000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":51,"alternative-id":["10.1145\/3798129.3800857","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800857","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}