{"id":"https://openalex.org/W7154017495","doi":"https://doi.org/10.48550/arxiv.2604.08731","title":"Optimal Single-Pass Streaming Lower Bounds for Approximating CSPs","display_name":"Optimal Single-Pass Streaming Lower Bounds for Approximating CSPs","publication_year":2026,"publication_date":"2026-04-09","ids":{"openalex":"https://openalex.org/W7154017495","doi":"https://doi.org/10.48550/arxiv.2604.08731"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.08731","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.08731","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":null,"license_id":null,"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.2604.08731","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133544379","display_name":"Noah G. Singer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Singer, Noah G.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057481716","display_name":"Madhur Tulsiani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tulsiani, Madhur","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029847226","display_name":"Santhoshini Velusamy","orcid":"https://orcid.org/0000-0002-0294-5425"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Velusamy, Santhoshini","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.6308000087738037,"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.6308000087738037,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.08669999986886978,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.08340000361204147,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.757099986076355},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.628000020980835},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5626000165939331},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5570999979972839},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.45649999380111694},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.42419999837875366},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.39559999108314514}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.757099986076355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6793000102043152},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.628000020980835},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5626000165939331},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5595999956130981},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5570999979972839},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47589999437332153},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.45649999380111694},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.42419999837875366},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32339999079704285},{"id":"https://openalex.org/C2776194381","wikidata":"https://www.wikidata.org/wiki/Q3965271","display_name":"Subclass","level":3,"score":0.3176000118255615},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.2849000096321106},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2596000134944916},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2551000118255615},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.08731","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.08731","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.08731","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.08731","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"For":[0],"an":[1,198],"arbitrary":[2],"family":[3],"of":[4,26,29,36,41,47,67,83,93,108,122,192,200],"predicates":[5],"$\\mathcal{F}":[6],"\\subseteq":[7],"\\{0,1\\}^{[q]^k}$":[8],"and":[9,72,95,142,185],"any":[10],"$\u03b5>":[11],"0$,":[12],"we":[13,207],"prove":[14],"a":[15,53,80,118,172,175,209],"single-pass,":[16],"linear-space":[17,64],"streaming":[18,145],"lower":[19,65,125,169,215],"bound":[20,66,126,170],"against":[21],"the":[22,58,63,104,149,190,203],"gap":[23,55,159],"promise":[24],"problem":[25,180],"distinguishing":[27],"instances":[28,40,160],"Max-CSP$({\\mathcal{F}})$":[30,51],"with":[31,42,85],"at":[32,43],"most":[33],"$\u03b2+\u03b5$":[34],"fraction":[35,46],"satisfiable":[37,48],"constraints":[38],"from":[39,174],"least":[44],"$\u03b3-\u03b5$":[45],"constraints,":[49],"whenever":[50],"admits":[52],"$(\u03b3,\u03b2)$-integrality":[54],"instance":[56],"for":[57,99,130,167],"basic":[59],"LP.":[60],"This":[61],"subsumes":[62],"Chou,":[68],"Golovnev,":[69],"Sudan,":[70],"Velingker,":[71],"Velusamy":[73],"(STOC":[74,97,187],"2022),":[75],"which":[76],"applies":[77],"only":[78],"to":[79],"special":[81],"subclass":[82],"CSPs":[84,136],"linear-algebraic":[86,110],"structure.":[87],"(Their":[88],"result":[89,196],"itself":[90],"generalizes":[91],"work":[92],"Kapralov":[94],"Krachun":[96],"2019)":[98],"Max-CUT.)":[100],"Our":[101,124,195],"approach":[102],"identifies":[103],"right":[105],"``analytic''":[106],"analogues":[107],"previously-used":[109],"conditions;":[111],"this":[112],"yields":[113],"substantial":[114],"simplifications":[115],"while":[116],"capturing":[117],"much":[119,210],"larger":[120],"class":[121],"problems.":[123],"is":[127,171,197],"essentially":[128],"optimal":[129],"single-pass":[131,204],"streaming,":[132],"since:":[133],"(1)":[134],"All":[135],"admit":[137],"$(1-\u03b5)$-approximations":[138],"in":[139,189,202],"quasilinear":[140],"space,":[141],"(2)":[143],"sublinear-space":[144],"algorithms":[146,156],"can":[147],"simulate":[148],"LP":[150],"(on":[151],"bounded-degree":[152],"instances),":[153],"giving":[154],"approximation":[155],"when":[157],"integrality":[158],"do":[161],"not":[162],"exist.":[163],"The":[164],"starting":[165],"point":[166],"our":[168],"reduction":[173],"\"distributional":[176],"implicit":[177],"hidden":[178],"partition''":[179],"defined":[181],"by":[182],"Fei,":[183],"Minzer,":[184],"Wang":[186],"2026)":[188],"context":[191],"multi-pass":[193],"streaming.":[194],"analogue":[199],"theirs":[201],"setting,":[205],"where":[206],"obtain":[208],"stronger":[211],"(and":[212],"tight)":[213],"space":[214],"bound.":[216]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-14T00:00:00"}