{"id":"https://openalex.org/W4376639534","doi":"https://doi.org/10.1145/3564246.3585143","title":"A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation","display_name":"A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639534","doi":"https://doi.org/10.1145/3564246.3585143"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585143","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585143","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585143","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th 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/3564246.3585143","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102900249","display_name":"Omar Alrabiah","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Omar Alrabiah","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068103506","display_name":"Pravesh K. Kothari","orcid":"https://orcid.org/0000-0002-8689-6770"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pravesh K. Kothari","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103039175","display_name":"Peter Manohar","orcid":"https://orcid.org/0000-0002-0732-5073"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Manohar","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5102900249"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":1.5763,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86016143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1438","last_page":"1448"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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/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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9993000030517578,"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/quadratic-equation","display_name":"Quadratic equation","score":0.6463645100593567},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6448096036911011},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6370795369148254},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6156153678894043},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5350391268730164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5051210522651672},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4249255359172821},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28330695629119873},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.15215817093849182},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05011391639709473}],"concepts":[{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6463645100593567},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6448096036911011},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6370795369148254},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6156153678894043},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5350391268730164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5051210522651672},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4249255359172821},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28330695629119873},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.15215817093849182},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05011391639709473},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585143","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585143","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585143","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585143","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585143","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585143","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639534.pdf","grobid_xml":"https://content.openalex.org/works/W4376639534.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1531719911","https://openalex.org/W1967703498","https://openalex.org/W1998698985","https://openalex.org/W2019578639","https://openalex.org/W2073240615","https://openalex.org/W2102801247","https://openalex.org/W2105537253","https://openalex.org/W2120217745","https://openalex.org/W2144581009","https://openalex.org/W2148352980","https://openalex.org/W2177108502","https://openalex.org/W2952469246","https://openalex.org/W3145604423","https://openalex.org/W3196550748","https://openalex.org/W4206039841","https://openalex.org/W4230909286","https://openalex.org/W4316652375"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4235381733","https://openalex.org/W2355022049","https://openalex.org/W2060429446","https://openalex.org/W2741782512","https://openalex.org/W3011302839","https://openalex.org/W2392958391","https://openalex.org/W3155227409","https://openalex.org/W2386709048","https://openalex.org/W2898682874"],"abstract_inverted_index":{"A":[0],"code":[1,11],"C":[2],"\u2236":[3],"{0,1}k":[4,26],"\u2192":[5],"{0,1}n":[6],"is":[7,57,68],"a":[8,84],"q-locally":[9],"decodable":[10],"(q-LDC)":[12],"if":[13],"one":[14],"can":[15],"recover":[16],"any":[17],"chosen":[18],"bit":[19],"bi":[20],"of":[21,45],"the":[22,33,70,78,92],"message":[23],"b":[24],"\u2208":[25],"with":[27],"good":[28],"confidence":[29],"by":[30],"randomly":[31],"querying":[32],"encoding":[34],"x":[35],"=":[36,49,64,75],"C(b)":[37],"on":[38,91],"at":[39],"most":[40],"q":[41,63],"coordinates.":[42],"Existing":[43],"constructions":[44,72],"2-LDCs":[46],"achieve":[47,73],"n":[48,74,88],"exp(O(k)),":[50],"and":[51],"lower":[52,86],"bounds":[53],"show":[54,83],"that":[55],"this":[56],"in":[58],"fact":[59],"tight.":[60],"However,":[61],"when":[62],"3,":[65],"far":[66],"less":[67],"known:":[69],"best":[71,79],"exp(ko(1)),":[76],"while":[77],"known":[80],"results":[81],"only":[82],"quadratic":[85],"bound":[87],"\u2265":[89],"\u03a9(k2/log(k))":[90],"blocklength.":[93]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}