{"id":"https://openalex.org/W7166851119","doi":"https://doi.org/10.4230/lipics.icalp.2026.44","title":"Multiplicative Error Set System Sparsification: A Simpler Proof via Chain Length Contraction","display_name":"Multiplicative Error Set System Sparsification: A Simpler Proof via Chain Length Contraction","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166851119","doi":"https://doi.org/10.4230/lipics.icalp.2026.44"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26433","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.44","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.44/LIPIcs.ICALP.2026.44.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.44/LIPIcs.ICALP.2026.44.pdf","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":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brakensiek, Joshua","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4149-7298","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I4210107338","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210107338"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guruswami, Venkatesan","raw_affiliation_strings":["Simons Institute for the Theory of Computing and the University of California, Berkeley, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-7926-3396","affiliations":[{"raw_affiliation_string":"Simons Institute for the Theory of Computing and the University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I4210107338"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091954510","display_name":"Aaron Putterman","orcid":"https://orcid.org/0000-0001-9737-2406"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Putterman, Aaron","raw_affiliation_strings":["School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9737-2406","affiliations":[{"raw_affiliation_string":"School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79173144,"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.5529000163078308,"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.5529000163078308,"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.32510000467300415,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.027899999171495438,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.7093999981880188},{"id":"https://openalex.org/keywords/chain","display_name":"Chain (unit)","score":0.5788999795913696},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5008999705314636},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5004000067710876},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.4975999891757965},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4869000017642975}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.767300009727478},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7093999981880188},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.5788999795913696},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5008999705314636},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5004000067710876},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.4975999891757965},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4869000017642975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46709999442100525},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4426000118255615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40149998664855957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3555999994277954},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.31949999928474426},{"id":"https://openalex.org/C196773441","wikidata":"https://www.wikidata.org/wiki/Q1475294","display_name":"Maximal element","level":3,"score":0.2989000082015991},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2847999930381775}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26433","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.44","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.44/LIPIcs.ICALP.2026.44.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.44","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.44","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26433","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.44","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.44/LIPIcs.ICALP.2026.44.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166851119.pdf","grobid_xml":"https://content.openalex.org/works/W7166851119.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"chain":[1,47,99],"length":[2,100],"of":[3,15,23,37,40,45,53,65,95],"a":[4,30,63,96,106],"set":[5,41,97],"family":[6],"\ud835\udcae":[7],"\u2286":[8],"2^[m]":[9],"is":[10],"the":[11,21,38,51,92,102],"largest":[12],"ascending":[13],"sequence":[14],"sets":[16],"in":[17,20,43],"containment":[18],"order":[19],"union-closure":[22],"S.":[24],"In":[25],"this":[26],"work,":[27],"we":[28,108],"provide":[29],"significantly":[31],"simpler":[32],"and":[33,55,72,81],"more":[34],"optimal":[35],"characterization":[36],"sparsifiability":[39,94],"systems":[42],"terms":[44],"their":[46],"length,":[48],"improving":[49],"on":[50,62],"work":[52],"Brakensiek":[54],"Guruswami":[56],"[STOC":[57],"2025].":[58],"Our":[59],"proof":[60],"relies":[61],"generalization":[64],"Karger\u2019s":[66],"[SODA":[67],"1993]":[68],"famous":[69],"contraction":[70],"algorithm":[71],"its":[73],"recent":[74],"linear":[75],"algebraic":[76],"extensions":[77],"[Khanna-Putterman-Sudan":[78],"SODA":[79],"2024],":[80],"our":[82],"resulting":[83],"bounds":[84,111],"show":[85],"that,":[86],"just":[87],"as":[88],"VC":[89],"dimension":[90],"characterizes":[91],"additive":[93],"system,":[98],"governs":[101],"multiplicative":[103],"sparsifiability.":[104],"As":[105],"corollary,":[107],"obtain":[109],"improved":[110],"for":[112],"weighted":[113],"CSP":[114],"sparsification.":[115]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}