{"id":"https://openalex.org/W7161788153","doi":"https://doi.org/10.48550/arxiv.2605.19055","title":"Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances","display_name":"Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances","publication_year":2026,"publication_date":"2026-05-18","ids":{"openalex":"https://openalex.org/W7161788153","doi":"https://doi.org/10.48550/arxiv.2605.19055"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.19055","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19055","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.2605.19055","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brakensiek, Joshua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136574908","display_name":"Venkatesan Guruswami","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guruswami, Venkatesan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136553447","display_name":"Bart M. P. Jansen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jansen, Bart M. P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089123758","display_name":"Victor Lagerkvist","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lagerkvist, Victor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5001475076","display_name":"Magnus Wahlstr\u00f6m","orcid":"https://orcid.org/0000-0002-0933-4504"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wahlstr\u00f6m, Magnus","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9251999855041504,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9251999855041504,"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.03739999979734421,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.019300000742077827,"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/gadget","display_name":"Gadget","score":0.9247000217437744},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8604999780654907},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6046000123023987},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47749999165534973},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4593999981880188},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.44209998846054077},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3939000070095062}],"concepts":[{"id":"https://openalex.org/C119770614","wikidata":"https://www.wikidata.org/wiki/Q5516347","display_name":"Gadget","level":2,"score":0.9247000217437744},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8604999780654907},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6046000123023987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5289000272750854},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49300000071525574},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47749999165534973},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4593999981880188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45159998536109924},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4034000039100647},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3939000070095062},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.3677000105381012},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3637999892234802},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.34709998965263367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3003000020980835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2721000015735626},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.25870001316070557}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.19055","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19055","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.2605.19055","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.19055","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,88],"non-redundancy":[1,39,163,215],"(NRD)":[2],"of":[3,18,38,43,79,91,98,119,146,153,168,216],"a":[4,10,103,112,129,136],"constraint":[5],"satisfaction":[6],"problem":[7],"(CSP)":[8],"is":[9,40,94,164],"combinatorial":[11],"quantity":[12,113],"closely":[13],"tied":[14],"to":[15,84,95],"the":[16,36,41,116,144,151,166,214],"behavior":[17],"CSPs":[19,83],"in":[20,35,102],"various":[21,77,217],"computational":[22,207],"models":[23],"including":[24],"their":[25,86],"sparsification,":[26],"kernelization,":[27],"and":[28,58,63,67,72,171],"streaming":[29],"complexity.":[30],"A":[31],"primary":[32,89],"open":[33],"question":[34],"study":[37],"identification":[42],"which":[44,105],"CSP":[45,160],"predicates":[46,133,161],"have":[47,75,182],"near-linear":[48],"NRD.":[49],"Recent":[50],"works":[51],"by":[52],"Carbonnel":[53],"[CP":[54],"2022],":[55],"Khanna,":[56],"Putterman":[57],"Sudan":[59],"[STOC":[60,65],"2025],":[61],"Brakensiek":[62],"Guruswami":[64],"2025]":[66],"Brakensiek,":[68],"Guruswami,":[69],"Jansen,":[70],"Lagerkvist,":[71],"Wahlstr\u00f6m":[73],"[2025]":[74],"introduced":[76],"forms":[78],"gadget":[80,100,130,194],"reductions":[81,101,195],"between":[82,132,213],"relate":[85],"non-redundancy.":[87],"contribution":[90],"this":[92],"work":[93],"recontextualize":[96],"many":[97],"these":[99,120,186,193],"framework":[104],"we":[106,114,123,156],"call":[107,115],"hypergraph":[108,121],"projections.":[109],"By":[110],"studying":[111],"shrinking":[117],"factor":[118],"projections,":[122],"can":[124,134,196],"more":[125],"precisely":[126],"predict":[127],"when":[128],"reduction":[131],"yield":[135],"super-linear":[137],"NRD":[138],"lower":[139,177],"bound,":[140],"greatly":[141],"improving":[142],"on":[143],"analysis":[145],"previous":[147,187],"works.":[148],"To":[149],"illustrate":[150],"power":[152],"our":[154,169,174],"framework,":[155],"identify":[157],"some":[158],"concrete":[159],"whose":[162],"at":[165],"cusp":[167],"understanding":[170],"show":[172],"how":[173,192],"methods":[175],"give":[176],"bounds":[178],"that":[179],"could":[180],"not":[181],"been":[183],"achieved":[184],"with":[185],"methods.":[188],"We":[189],"also":[190],"demonstrate":[191],"be":[197],"automatically":[198],"deduced":[199],"using":[200],"SAT":[201],"solvers,":[202],"thereby":[203],"opening":[204],"up":[205],"novel":[206],"avenues":[208],"for":[209],"discovering":[210],"further":[211],"relationships":[212],"CSPs.":[218]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-21T00:00:00"}