{"id":"https://openalex.org/W7166853897","doi":"https://doi.org/10.48550/arxiv.2606.31657","title":"Sensitivity Lower Bounds via Locally Testable Codes","display_name":"Sensitivity Lower Bounds via Locally Testable Codes","publication_year":2026,"publication_date":"2026-06-30","ids":{"openalex":"https://openalex.org/W7166853897","doi":"https://doi.org/10.48550/arxiv.2606.31657"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.31657","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.31657","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.31657","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139753965","display_name":"Yuichi Yoshida","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yoshida, Yuichi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139763131","display_name":"Zihan Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Zihan","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":null,"has_fulltext":false,"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.9429000020027161,"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.9429000020027161,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.01860000006854534,"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.008200000040233135,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7815999984741211},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.628000020980835},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.5860000252723694},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.45660001039505005},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.45509999990463257},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4221000075340271}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7965999841690063},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7815999984741211},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.628000020980835},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.59579998254776},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.5860000252723694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5213000178337097},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.45660001039505005},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.45509999990463257},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4221000075340271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4172999858856201},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4138999879360199},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.37220001220703125},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.34459999203681946},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3059999942779541},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.25780001282691956}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.31657","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.31657","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":"doi:10.48550/arxiv.2606.31657","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.31657","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Sensitivity":[0],"quantifies":[1],"how":[2],"far":[3],"an":[4,79,90],"algorithm's":[5],"output":[6,203],"can":[7],"move":[8],"in":[9,227],"Hamming":[10],"distance":[11],"when":[12],"a":[13,21,31,48,123,165],"single":[14],"input":[15],"element":[16],"is":[17],"perturbed.":[18],"We":[19],"present":[20],"general":[22,74],"scheme":[23],"turning":[24],"any":[25,129,192],"locally":[26],"testable":[27],"code":[28],"(LTC)":[29],"into":[30],"sensitivity":[32,63,139,177,187],"lower":[33,69,81,102,178,188,225],"bound":[34,70,82,92],"for":[35,53,58,73,83,86,93,96,132,151,197],"the":[36,40,45,66,148,208,219,228],"CSP":[37],"encoded":[38],"by":[39],"code.":[41],"Instantiating":[42],"it":[43],"with":[44,214],"$c^3$-LTC":[46],"yields":[47],"constant":[49],"$\\varepsilon":[50,144,156],">":[51],"0$":[52],"which":[54,231],"every":[55],"$(1-\\varepsilon)$-approximation":[56,94,130],"algorithm":[57,131,196],"satisfiable":[59],"Max":[60,133,198],"E3LIN2":[61],"has":[62,138,200],"$\u03a9(n)$,":[64],"strengthening":[65],"previous":[67],"$\u03a9(n^\u03b4)$":[68],"known":[71],"only":[72],"instances.":[75],"Standard":[76],"reductions":[77],"give":[78],"$n^{1-O(\\varepsilon)}$":[80],"$n^{-\\varepsilon}$-approximation":[84],"algorithms":[85,95,114,153],"maximum":[87,97],"clique,":[88],"and":[89,108,234],"$\u03a9(k)$":[91],"$k$-coverage,":[98],"among":[99],"others.":[100],"These":[101],"bounds":[103,107,179,226],"match":[104],"trivial":[105],"upper":[106],"imply":[109,223],"that":[110,128,191],"even":[111,160],"slightly":[112],"stable":[113],"cannot":[115,172],"achieve":[116],"these":[117],"approximations.":[118],"A":[119],"second":[120],"instantiation,":[121],"using":[122],"simple":[124],"repetition":[125],"code,":[126],"shows":[127],"Cut":[134],"on":[135,161],"bipartite":[136,162],"graphs":[137],"$\u03a9(1/\\varepsilon)$":[140],"as":[141,143],"long":[142],"=":[145],"O(1/\\sqrt{n})$,":[146],"extending":[147],"prior":[149],"result":[150],"exact":[152],"(the":[154],"regime":[155],"<":[157],"1/n$).":[158],"Thus":[159],"graphs,":[163],"where":[164],"perfect":[166],"cut":[167],"always":[168],"exists,":[169],"near-optimal":[170],"solutions":[171],"be":[173],"maintained":[174],"stably.":[175],"Our":[176],"have":[180],"two":[181],"applications.":[182],"First,":[183],"they":[184,222],"yield":[185],"averaged":[186],"bounds,":[189],"implying":[190],"nearly":[193],"optimal":[194],"randomized":[195],"E3SAT":[199],"linearly":[201],"many":[202],"bits":[204],"that,":[205],"after":[206],"fixing":[207],"random":[209],"seed,":[210],"are":[211],"Boolean":[212],"functions":[213],"large":[215],"influence.":[216],"Second,":[217],"via":[218],"sensitivity-to-locality":[220],"connection,":[221],"locality":[224],"non-signaling":[229],"model,":[230],"generalizes":[232],"$\\mathsf{LOCAL}$":[233],"quantum-$\\mathsf{LOCAL}$.":[235]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}