{"id":"https://openalex.org/W4416351638","doi":"https://doi.org/10.1145/3798129.3800921","title":"Optimal and Efficient Partite Decompositions of Hypergraphs","display_name":"Optimal and Efficient Partite Decompositions of Hypergraphs","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416351638","doi":"https://doi.org/10.1145/3798129.3800921"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800921","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800921","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800921","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120747867","display_name":"Andrew Krapivin","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Krapivin","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0009-0003-0227-7660","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009136134","display_name":"Benjamin Przybocki","orcid":"https://orcid.org/0009-0007-5489-1733"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Przybocki","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0009-0007-5489-1733","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017215680","display_name":"Nicol\u00e1s Sanhueza\u2010Matamala","orcid":"https://orcid.org/0000-0003-4791-5710"},"institutions":[{"id":"https://openalex.org/I172787465","display_name":"University of Concepci\u00f3n","ror":"https://ror.org/0460jpj73","country_code":"CL","type":"education","lineage":["https://openalex.org/I172787465"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Nicol\u00e1s Sanhueza-Matamala","raw_affiliation_strings":["Universidad de Concepci\u00f3n, Concepci\u00f3n, Chile"],"raw_orcid":"https://orcid.org/0000-0003-4791-5710","affiliations":[{"raw_affiliation_string":"Universidad de Concepci\u00f3n, Concepci\u00f3n, Chile","institution_ids":["https://openalex.org/I172787465"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030108071","display_name":"Bernardo Subercaseaux","orcid":"https://orcid.org/0000-0003-2295-1299"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bernardo Subercaseaux","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":"https://orcid.org/0000-0003-2295-1299","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04274571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2187","last_page":"2198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.486299991607666,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.486299991607666,"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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.1485999971628189,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.0892999991774559,"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/hypergraph","display_name":"Hypergraph","score":0.7138000130653381},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.654699981212616},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5367000102996826},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4487999975681305},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.426800012588501},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.42590001225471497},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.40709999203681946},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.34599998593330383}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7728000283241272},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7675999999046326},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7138000130653381},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.654699981212616},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5367000102996826},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48890000581741333},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4487999975681305},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.426800012588501},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.42590001225471497},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.40709999203681946},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.34599998593330383},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.29919999837875366},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.2815000116825104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C150591576","wikidata":"https://www.wikidata.org/wiki/Q739925","display_name":"Family of sets","level":3,"score":0.2574999928474426},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.2517000138759613}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800921","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800921","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2511.11855","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.11855","pdf_url":"https://arxiv.org/pdf/2511.11855","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.11855","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.11855","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800921","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800921","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G383231862","display_name":null,"funder_award_id":"DGE-2140739","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4148460812","display_name":null,"funder_award_id":"1251121","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8378853900","display_name":null,"funder_award_id":"DMS-2434625","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,22],"study":[1],"the":[2,6,49,104],"problem":[3],"of":[4,8,17,45,52,55,79,86,95],"partitioning":[5],"edges":[7],"a":[9,14,27,53,83],"d-uniform":[10],"hypergraph":[11],"H":[12],"into":[13],"family":[15],"F":[16,29],"complete":[18],"d-partite":[19],"hypergraphs":[20],"(d-cliques).":[21],"show":[23],"that":[24],"there":[25],"is":[26,98],"partition":[28],"in":[30],"which":[31],"every":[32],"vertex":[33],"v":[34],"\u2208":[35],"V(H)":[36],"belongs":[37],"to":[38],"at":[39],"most":[40],"(1/d!":[41],"+":[42],"od(1))nd\u22121/lgn":[43],"members":[44],"F.":[46],"This":[47],"settles":[48],"central":[50],"question":[51,85],"line":[54],"research":[56],"initiated":[57],"by":[58,68],"Erd\u0151s":[59],"and":[60,65,71,89],"Pyber":[61],"(1997)":[62],"for":[63,74,103,108],"graphs,":[64],"more":[66],"recently":[67],"Csirmaz,":[69],"Ligeti,":[70],"Tardos":[72],"(2014)":[73],"hypergraphs.":[75,115],"The":[76],"d=2":[77],"case":[78],"this":[80],"theorem":[81],"answers":[82],"40-year-old":[84],"Chung,":[87],"Erd\u0151s,":[88],"Spencer":[90],"(1983).":[91],"An":[92],"immediate":[93],"corollary":[94],"our":[96],"result":[97],"an":[99],"improved":[100],"upper":[101],"bound":[102],"maximum":[105],"share":[106],"size":[107],"binary":[109],"secret":[110],"sharing":[111],"schemes":[112],"on":[113],"uniform":[114]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-19T00:00:00"}