{"id":"https://openalex.org/W4399523279","doi":"https://doi.org/10.1145/3618260.3649611","title":"Relaxed Local Correctability from Local Testing","display_name":"Relaxed Local Correctability from Local Testing","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399523279","doi":"https://doi.org/10.1145/3618260.3649611"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649611","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649611","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649611","source":null,"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649611","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057163359","display_name":"Vinayak M. Kumar","orcid":"https://orcid.org/0009-0002-7309-5648"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vinayak M. Kumar","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"raw_orcid":"https://orcid.org/0009-0002-7309-5648","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050309474","display_name":"Geoffrey Mon","orcid":"https://orcid.org/0000-0003-4414-1019"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Geoffrey Mon","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"raw_orcid":"https://orcid.org/0000-0003-4414-1019","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3205,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58704011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1585","last_page":"1593"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6322495341300964},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.6035955548286438},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5973840355873108},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.500626802444458},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.47513440251350403},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4354625940322876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4153054356575012},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.41100192070007324},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.391902893781662},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37833595275878906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32862433791160583},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.13529464602470398}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6322495341300964},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.6035955548286438},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5973840355873108},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.500626802444458},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.47513440251350403},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4354625940322876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4153054356575012},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.41100192070007324},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.391902893781662},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37833595275878906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32862433791160583},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.13529464602470398},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649611","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649611","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649611","source":null,"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649611","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649611","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649611","source":null,"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399523279.pdf"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W127527215","https://openalex.org/W1481582196","https://openalex.org/W1484143370","https://openalex.org/W1967703498","https://openalex.org/W1996839061","https://openalex.org/W2000211775","https://openalex.org/W2018925011","https://openalex.org/W2024011363","https://openalex.org/W2044199052","https://openalex.org/W2048651540","https://openalex.org/W2053086236","https://openalex.org/W2103358260","https://openalex.org/W2130786088","https://openalex.org/W2171179652","https://openalex.org/W2242452602","https://openalex.org/W2617207196","https://openalex.org/W2791574816","https://openalex.org/W2795962163","https://openalex.org/W2953424104","https://openalex.org/W2976976668","https://openalex.org/W3082318583","https://openalex.org/W3092562962","https://openalex.org/W3097401090","https://openalex.org/W3131688971","https://openalex.org/W3139983403","https://openalex.org/W3156157822","https://openalex.org/W3159135841","https://openalex.org/W3186241173","https://openalex.org/W3196947674","https://openalex.org/W3213933684","https://openalex.org/W3216957975","https://openalex.org/W4296544078","https://openalex.org/W4313227214","https://openalex.org/W4386072218"],"related_works":["https://openalex.org/W1583922594","https://openalex.org/W1542422837","https://openalex.org/W1974038726","https://openalex.org/W2998448420","https://openalex.org/W1598224733","https://openalex.org/W4280502676","https://openalex.org/W2000769876","https://openalex.org/W204227468","https://openalex.org/W1953626159","https://openalex.org/W2157233202"],"abstract_inverted_index":{"We":[0,70],"construct":[1],"the":[2,15,21,43,55,72,80,85,99,104],"first":[3],"asymptotically":[4,132],"good":[5,133],"relaxed":[6,49,136],"locally":[7,38,50,73,118],"correctable":[8,51],"codes":[9,120,134],"with":[10,113,135],"polylogarithmic":[11,144],"query":[12,68,145],"complexity,":[13],"bringing":[14],"upper":[16],"bound":[17,23],"polynomially":[18],"close":[19],"to":[20,77,94,122],"lower":[22],"of":[24,46,82,98,117],"Gur":[25],"and":[26,58,67,101,127,143],"Lachish":[27],"(SICOMP":[28],"2021).":[29],"Our":[30],"result":[31],"follows":[32],"from":[33],"showing":[34],"that":[35],"a":[36,47,61,95,114],"high-rate":[37],"testable":[39,74,119],"code":[40],"can":[41,92],"boost":[42],"block":[44,141],"length":[45],"smaller":[48,105],"code,":[52],"while":[53],"preserving":[54],"correcting":[56],"radius":[57],"incurring":[59],"only":[60],"modest":[62],"additive":[63],"cost":[64],"in":[65,84],"rate":[66],"complexity.":[69,146],"use":[71],"code's":[75],"tester":[76],"check":[78],"if":[79,89],"amount":[81],"corruption":[83],"input":[86,100],"is":[87],"low;":[88],"so,":[90],"we":[91],"\u201czoom-in\u201d":[93],"suitable":[96,115],"substring":[97],"recurse":[102],"on":[103],"code\u2019s":[106],"local":[107,137],"corrector.":[108],"Hence,":[109],"iterating":[110],"this":[111],"operation":[112],"family":[116],"due":[121],"Dinur,":[123],"Evra,":[124],"Livne,":[125],"Lubotzky,":[126],"Mozes":[128],"(STOC":[129],"2022)":[130],"yields":[131],"correctability,":[138],"arbitrarily":[139],"large":[140],"length,":[142]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}