{"id":"https://openalex.org/W4382766352","doi":"https://doi.org/10.48550/arxiv.2306.17035","title":"Relaxed Local Correctability from Local Testing","display_name":"Relaxed Local Correctability from Local Testing","publication_year":2023,"publication_date":"2023-06-29","ids":{"openalex":"https://openalex.org/W4382766352","doi":"https://doi.org/10.48550/arxiv.2306.17035"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2306.17035","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.17035","pdf_url":"https://arxiv.org/pdf/2306.17035","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2306.17035","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057163359","display_name":"Vinayak M. Kumar","orcid":"https://orcid.org/0009-0002-7309-5648"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kumar, Vinayak M.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5050309474","display_name":"Geoffrey Mon","orcid":"https://orcid.org/0000-0003-4414-1019"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mon, Geoffrey","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057163359"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9997000098228455,"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.9997000098228455,"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.9995999932289124,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9882000088691711,"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.6312738060951233},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6093743443489075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5901510119438171},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.5108382105827332},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.46373429894447327},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4533913731575012},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.44158151745796204},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.43863630294799805},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4344392716884613},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.4195062816143036},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4032166302204132},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3691098690032959},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.3289951682090759},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3124765157699585},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2901766300201416},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1346069574356079},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.11581754684448242}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6312738060951233},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6093743443489075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5901510119438171},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.5108382105827332},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.46373429894447327},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4533913731575012},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.44158151745796204},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.43863630294799805},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4344392716884613},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4195062816143036},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4032166302204132},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3691098690032959},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3289951682090759},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3124765157699585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2901766300201416},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1346069574356079},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.11581754684448242},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2306.17035","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.17035","pdf_url":"https://arxiv.org/pdf/2306.17035","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2306.17035","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2306.17035","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2306.17035","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.17035","pdf_url":"https://arxiv.org/pdf/2306.17035","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4099999964237213,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1878690290","display_name":"AF: Small: The Unique Games Conjecture and Related Problems in Hardness of Approximation","funder_award_id":"2200956","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4758552775","display_name":null,"funder_award_id":"2137420","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5875010852","display_name":null,"funder_award_id":"DGE-2137420","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7849844184","display_name":"CCF: AF: Medium: Towards Optimal Pseudorandomness","funder_award_id":"2312573","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8132919349","display_name":"AF: Small: Randomness Extraction and Pseudorandomness","funder_award_id":"2008076","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310620","display_name":"University of Texas at Austin","ror":"https://ror.org/00hj54h04"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4382766352.pdf","grobid_xml":"https://content.openalex.org/works/W4382766352.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W127527215","https://openalex.org/W1484143370","https://openalex.org/W1967703498","https://openalex.org/W1996839061","https://openalex.org/W2000211775","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/W2617207196","https://openalex.org/W2791574816","https://openalex.org/W2795962163","https://openalex.org/W2998990001","https://openalex.org/W3082318583","https://openalex.org/W3092562962","https://openalex.org/W3097401090","https://openalex.org/W3131688971","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/W4313227214","https://openalex.org/W4386072218"],"related_works":["https://openalex.org/W2964136540","https://openalex.org/W645598334","https://openalex.org/W2184059163","https://openalex.org/W1665788294","https://openalex.org/W2098264941","https://openalex.org/W2111330432","https://openalex.org/W2027016617","https://openalex.org/W2171226783","https://openalex.org/W1990661161","https://openalex.org/W2087721965"],"abstract_inverted_index":{"We":[0,70],"construct":[1],"the":[2,15,21,43,55,72,80,85,99,104,151,162,166,188],"first":[3],"asymptotically":[4,132,149],"good":[5,133],"relaxed":[6,49,136,174],"locally":[7,38,50,73,118,157,175],"correctable":[8,51,176],"codes":[9,120,134,148,177],"with":[10,113,135,178],"polylogarithmic":[11,144,179],"query":[12,68,145,180],"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,155,165],"Gur":[25],"and":[26,58,67,101,127,143,153,185],"Lachish":[27],"(SICOMP":[28],"2021).":[29],"Our":[30,147],"result":[31],"follows":[32],"from":[33],"showing":[34],"that":[35,182],"a":[36,47,61,95,114],"high-rate":[37],"testable":[39,74,119,158],"code":[40,159],"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,161],"rate":[66,152,184],"complexity.":[69,146],"use":[71],"code's":[75,106],"tester":[76],"check":[78],"if":[79,89],"amount":[81],"corruption":[83],"input":[86,100],"is":[87],"low;":[88],"so,":[90],"we":[91],"\"zoom-in\"":[93],"suitable":[96,115],"substring":[97],"recurse":[102],"on":[103],"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,172],"correctability,":[138],"arbitrarily":[139],"large":[140],"length,":[142],"inherit":[150],"distance":[154,186],"any":[156],"used":[160],"final":[163],"invocation":[164],"operation.":[167],"Therefore,":[168],"our":[169],"framework":[170],"also":[171],"nonexplicit":[173],"complexity":[181],"have":[183],"approaching":[187],"Gilbert-Varshamov":[189],"bound.":[190]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}