{"id":"https://openalex.org/W7160966076","doi":"https://doi.org/10.48550/arxiv.2605.08797","title":"Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH","display_name":"Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH","publication_year":2026,"publication_date":"2026-05-09","ids":{"openalex":"https://openalex.org/W7160966076","doi":"https://doi.org/10.48550/arxiv.2605.08797"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.ccc.2026.1","is_oa":true,"landing_page_url":"https://eccc.weizmann.ac.il/report/2016/128","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://eccc.weizmann.ac.il/report/2016/128","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135931426","display_name":"Rishav Gupta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gupta, Rishav","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101847362","display_name":"Bingkai Lin","orcid":"https://orcid.org/0000-0002-3444-6380"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lin, Bingkai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135930492","display_name":"Xin Zheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zheng, Xin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.52309425,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.8532000184059143,"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.8532000184059143,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.039900001138448715,"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/T10237","display_name":"Cryptography and Data Security","score":0.017400000244379044,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8209999799728394},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6574000120162964},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.6234999895095825},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6165000200271606},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.603600025177002},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.580299973487854},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5489000082015991},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4902999997138977},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.45190000534057617}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8209999799728394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7882000207901001},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6574000120162964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6348000168800354},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.6234999895095825},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6165000200271606},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.603600025177002},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.580299973487854},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5489000082015991},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49059998989105225},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4902999997138977},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.45190000534057617},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4426000118255615},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4332999885082245},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4239000082015991},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.39399999380111694},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.390500009059906},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.36660000681877136},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3212999999523163},{"id":"https://openalex.org/C55974624","wikidata":"https://www.wikidata.org/wiki/Q1188504","display_name":"Exponential family","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2662999927997589},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2624000012874603}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.4230/lipics.ccc.2026.1","is_oa":true,"landing_page_url":"https://eccc.weizmann.ac.il/report/2016/128","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2605.08797","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08797","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.ccc.2026.1","is_oa":true,"landing_page_url":"https://eccc.weizmann.ac.il/report/2016/128","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,51,73],"present":[1],"a":[2,53,63,70,76,85,111,147],"simple":[3],"deterministic":[4],"reduction":[5,145],"which,":[6],"assuming":[7],"the":[8,19,27,42,80,101,119,139,156],"Exponential":[9,104],"Time":[10,105],"Hypothesis":[11,106],"($\\mathsf{ETH}$),":[12],"yields":[13],"tight":[14],"lower":[15,122,158],"bounds":[16],"for":[17,94],"approximating":[18,142],"parameterized":[20,28],"Maximum":[21],"Likelihood":[22],"Decoding":[23],"problem":[24],"($\\mathsf{MLD}$)":[25],"and":[26,84,150],"Nearest":[29],"Codeword":[30],"Problem":[31],"($\\mathsf{NCP}$)":[32],"within":[33],"some":[34],"fixed":[35],"constant":[36],"factor.":[37],"Our":[38],"starting":[39],"point":[40],"is":[41,110],"ETH-based":[43],"exponential-time":[44],"hardness":[45,93,140],"of":[46,59,79,141],"$(c,s)$-Gap-$\\mathsf{MAXLIN}$":[47,54],"established":[48],"in":[49],"[BHI+24].":[50],"transform":[52],"instance":[55,58],"into":[56],"an":[57],"$\u03b3$-Gap":[60],"$k$-$\\mathsf{MLD}$":[61],"via":[62],"novel":[64],"combinatorial":[65],"object":[66],"that":[67,134],"we":[68],"call":[69],"cover":[71,82],"family.":[72],"provide":[74],"both":[75],"randomized":[77,102],"construction":[78],"required":[81],"families":[83],"subsequent":[86],"derandomization.":[87],"Prior":[88],"to":[89,129,154],"our":[90,144],"work,":[91],"$n^{\u03a9(k)}$":[92],"constant-factor":[95],"approximation":[96],"was":[97,124],"only":[98],"shown":[99],"under":[100],"Gap":[103],"Gap-$\\mathsf{ETH}$":[107],"[Man20],":[108],"which":[109],"much":[112],"stronger":[113],"assumption":[114],"than":[115],"$\\mathsf{ETH}$.":[116],"Under":[117],"$\\mathsf{ETH}$,":[118],"strongest":[120],"known":[121],"bound":[123],"$n^{\u03a9(k/\\operatorname{poly}":[125],"\\log":[126],"k)}$":[127],"due":[128],"[BKM25].":[130],"Unlike":[131],"previous":[132],"approaches":[133],"rely":[135],"on":[136],"reductions":[137],"from":[138],"$2$-$\\mathsf{CSP}$,":[143],"provides":[146],"more":[148],"direct":[149],"conceptually":[151],"simpler":[152],"route":[153],"achieving":[155],"optimal":[157],"bounds.":[159]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-05-13T00:00:00"}