{"id":"https://openalex.org/W7149000548","doi":"https://doi.org/10.48550/arxiv.2604.01575","title":"Single-Pass Streaming CSPs via Two-Tier Sampling","display_name":"Single-Pass Streaming CSPs via Two-Tier Sampling","publication_year":2026,"publication_date":"2026-04-02","ids":{"openalex":"https://openalex.org/W7149000548","doi":"https://doi.org/10.48550/arxiv.2604.01575"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.01575","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01575","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.01575","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049819184","display_name":"Amir Azarmehr","orcid":"https://orcid.org/0009-0005-6451-3985"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Azarmehr, Amir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025934584","display_name":"Soheil Behnezhad","orcid":"https://orcid.org/0000-0002-0104-633X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Behnezhad, Soheil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132898462","display_name":"Shane Ferrante","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ferrante, Shane","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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.7735999822616577,"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.7735999822616577,"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.05000000074505806,"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.0478999987244606,"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/conjecture","display_name":"Conjecture","score":0.5692999958992004},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.5565000176429749},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.517799973487854},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5024999976158142},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4726000130176544},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.4715999960899353},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.447299987077713},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42890000343322754},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.4221999943256378}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5995000004768372},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5692999958992004},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.5565000176429749},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.517799973487854},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5024999976158142},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4726000130176544},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.4715999960899353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.459199994802475},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.447299987077713},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42890000343322754},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.4221999943256378},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4185999929904938},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4162999987602234},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4034000039100647},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3937000036239624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34709998965263367},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3246000111103058},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.29829999804496765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29030001163482666},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.2890999913215637},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.271699994802475},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.01575","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01575","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"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.01575","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01575","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":false,"raw_source_name":null,"raw_type":"article"},"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],"study":[1],"the":[2,9,15,32,39,67,72,76,82,89,95,110,122,127,159,163,198,234,250],"maximum":[3,40],"constraint":[4,25],"satisfaction":[5],"problem,":[6],"Max-CSP,":[7,193],"in":[8,19,52,71,126,181],"streaming":[10,129],"setting.":[11],"Given":[12,185],"$n$":[13],"variables,":[14],"constraints":[16,43],"arrive":[17],"sequentially":[18],"an":[20,49,105,138,168],"arbitrary":[21],"order,":[22],"with":[23,63,143],"each":[24],"involving":[26],"only":[27],"a":[28,53,59,113,118,182,189,205,212,218,223,227],"small":[29],"subset":[30],"of":[31,42,104,121,162,171,192,201],"variables.":[33],"The":[34,56,86,100],"objective":[35],"is":[36,124,188],"to":[37,84,88,243],"approximate":[38],"fraction":[41],"that":[44,125,167,186,229],"can":[45,140,173],"be":[46,141,175],"satisfied":[47],"by":[48,165],"optimal":[50],"assignment":[51],"single":[54,183],"pass.":[55,184],"problem":[57,70],"admits":[58],"trivial":[60],"near-optimal":[61],"solution":[62],"$O(n)$":[64],"space,":[65,145],"so":[66],"major":[68,119],"open":[69],"literature":[73],"has":[74],"been":[75],"best":[77],"approximation":[78],"achievable":[79],"when":[80],"limiting":[81],"space":[83,179],"$o(n)$.":[85],"answer":[87],"question":[90],"above":[91],"depends":[92],"heavily":[93],"on":[94,222],"CSP":[96],"instance":[97],"at":[98,249],"hand.":[99],"integrality":[101],"gap":[102],"$\u03b1$":[103],"LP":[106],"relaxation,":[107],"known":[108],"as":[109],"BasicLP,":[111],"plays":[112],"central":[114],"role.":[115],"In":[116,153],"particular,":[117],"conjecture":[120,164],"area":[123],"single-pass":[128],"setting,":[130],"for":[131],"any":[132,148],"fixed":[133],"$\\varepsilon":[134],">":[135],"0$,":[136],"(i)":[137],"$(\u03b1-\\varepsilon)$-approximation":[139],"achieved":[142,176],"$o(n)$":[144],"and":[146,180,209,240,246],"(ii)":[147],"$(\u03b1+\\varepsilon)$-approximation":[149],"requires":[150],"$\u03a9(n)$":[151],"space.":[152],"this":[154],"work,":[155],"we":[156,230],"fully":[157,196],"resolve":[158],"first":[160],"side":[161],"proving":[166],"$(\u03b1-":[169],"\\varepsilon)$-approximation":[170],"Max-CSP":[172],"indeed":[174],"using":[177,226],"$n^{1-\u03a9_\\varepsilon(1)}$":[178],"Max-DiCut":[187],"special":[190],"case":[191],"our":[194,215],"algorithm":[195,208,216,221,235],"recovers":[197],"recent":[199],"result":[200],"[ABFS26,":[202],"STOC'26]":[203],"via":[204],"completely":[206],"different":[207],"proof.":[210],"On":[211],"technical":[213],"level,":[214],"simulates":[217],"suitable":[219],"local":[220],"reduced":[224],"graph":[225],"technique":[228],"call":[231],"*two-tier":[232],"sampling*:":[233],"combines":[236],"both":[237],"edge":[238],"sampling":[239,242],"vertex":[241],"handle":[244],"high-":[245],"low-degree":[247],"vertices":[248],"same":[251],"time.":[252]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-04T00:00:00"}