{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T13:03:24Z","timestamp":1785503004945,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","funder":[{"name":"NSFC","award":["62472400"],"award-info":[{"award-number":["62472400"]}]},{"name":"NSFC","award":["62271465"],"award-info":[{"award-number":["62271465"]}]},{"name":"National Key R&D Program of China","award":["2025YFC3408300"],"award-info":[{"award-number":["2025YFC3408300"]}]},{"name":"Suzhou Basic Research Program","award":["SYG202338"],"award-info":[{"award-number":["SYG202338"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,8,9]]},"DOI":"10.1145\/3770854.3780266","type":"proceedings-article","created":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T12:07:40Z","timestamp":1785499660000},"page":"336-347","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SIGHP: Scalable Information-Guided Hypergraph Partitioner"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2633-2559","authenticated-orcid":false,"given":"Huhao","family":"Guan","sequence":"first","affiliation":[{"name":"Suzhou Institute for Advanced Research, University of Science and Technology of China, HeFei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6286-8679","authenticated-orcid":false,"given":"Zezhong","family":"Ding","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence and Data Science, Suzhou Institute for Advanced Research, University of Science and Technology of China, Suzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5977-302X","authenticated-orcid":false,"given":"Ao","family":"Ke","sequence":"additional","affiliation":[{"name":"Suzhou Institute for Advanced Research, University of Science and Technology of China, Suzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5290-5408","authenticated-orcid":false,"given":"Xike","family":"Xie","sequence":"additional","affiliation":[{"name":"Suzhou Institute for Advanced Research, University of Science and Technology of China, Suzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6881-4444","authenticated-orcid":false,"given":"Kevin S.","family":"Zhou","sequence":"additional","affiliation":[{"name":"Suzhou Institute for Advanced Research, University of Science and Technology of China, Suzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,20]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"1900","article-title":"Streaming Min-max Hypergraph Partitioning","author":"Alistarh Dan","year":"2015","unstructured":"Dan Alistarh, Jennifer Iglesias, and Milan Vojnovic. 2015. Streaming Min-max Hypergraph Partitioning. In NIPS. 1900-1908. https:\/\/proceedings.neurips.cc\/paper\/2015\/hash\/83f97f4825290be4cb794ec6a234595f-Abstract.html","journal-title":"NIPS."},{"key":"e_1_3_2_2_2_1","first-page":"509","volume-title":"Science","volume":"286","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of Scaling in Random Networks. Science, Vol. 286, 5439 (1999), 509-512. https:\/\/www.science.org\/doi\/abs\/10.1126\/science.286.5439.509"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2009.02.005"},{"key":"e_1_3_2_2_4_1","first-page":"61","article-title":"Social Network Analysis with Content and Graphs","volume":"20","author":"Campbell William M","year":"2013","unstructured":"William M Campbell, Charlie K Dagli, and Clifford J Weinstein. 2013. Social Network Analysis with Content and Graphs. Lincoln Laboratory Journal, Vol. 20, 1 (2013), 61-81. https:\/\/www.researchgate.net\/publication\/297707303_Social_Network_Analysis_with_Content_and_Graphs","journal-title":"Lincoln Laboratory Journal"},{"key":"e_1_3_2_2_5_1","first-page":"1479","article-title":"Patoh (Partitioning Tool for Hypergraphs)","author":"\u00c7ataly\u00fcrek \u00dcmit V","year":"2011","unstructured":"\u00dcmit V \u00c7ataly\u00fcrek and Cevdet Aykanat. 2011. Patoh (Partitioning Tool for Hypergraphs). In Encyclopedia of Parallel Computing. 1479-1487. https:\/\/link.springer.com\/referencework\/10.1007\/978-0-387-09766-4","journal-title":"Encyclopedia of Parallel Computing."},{"key":"e_1_3_2_2_6_1","unstructured":"Scott Chacon. 2009. The 2009 GitHub Contest. https:\/\/github.com\/blog\/466-the-2009-github-contest"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1198\/000313007X244457"},{"key":"e_1_3_2_2_8_1","first-page":"1597","article-title":"A Simple Framework for Contrastive Learning of Visual Representations","volume":"119","author":"Chen Ting","year":"2020","unstructured":"Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey E. Hinton. 2020. A Simple Framework for Contrastive Learning of Visual Representations. In ICML, Vol. 119. 1597-1607. http:\/\/proceedings.mlr.press\/v119\/chen20j.html","journal-title":"ICML"},{"key":"e_1_3_2_2_9_1","first-page":"1172","article-title":"Random Walks on Hypergraphs with Edge-Dependent Vertex Weights","volume":"97","author":"Chitra Uthsav","year":"2019","unstructured":"Uthsav Chitra and Benjamin J. Raphael. 2019. Random Walks on Hypergraphs with Edge-Dependent Vertex Weights. In ICML, Vol. 97. 1172-1181. http:\/\/proceedings.mlr.press\/v97\/chitra19a.html","journal-title":"ICML"},{"key":"e_1_3_2_2_10_1","volume-title":"Science Advances","volume":"7","author":"Chodrow Philip S","year":"2021","unstructured":"Philip S Chodrow, Nate Veldt, and Austin R Benson. 2021. Generative Hypergraph Clustering: From Blockmodels to Modularity. Science Advances, Vol. 7, 28 (2021), eabh1303. https:\/\/www.science.org\/doi\/full\/10.1126\/sciadv.abh1303"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Kenneth Ward Church and Patrick Hanks. 1989. Word Association Norms Mutual Information and Lexicography. (1989) 76-83. https:\/\/aclanthology.org\/P89-1010\/","DOI":"10.3115\/981623.981633"},{"key":"e_1_3_2_2_12_1","volume-title":"Thomas","author":"Cover Thomas M.","year":"2006","unstructured":"Thomas M. Cover and Joy A. Thomas. 2006. Elements of Information Theory (2nd ed.). https:\/\/onlinelibrary.wiley.com\/doi\/book\/10.1002\/047174882X"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2950416"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-0185-2_8"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654965"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0032-4"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.439"},{"key":"e_1_3_2_2_18_1","first-page":"140","article-title":"The Pareto Principle","volume":"7","author":"Dunford Rosie","year":"2014","unstructured":"Rosie Dunford, Quanrong Su, Ekraj Tamang, and Abigail Wintour. 2014. The Pareto Principle. The Plymouth Student Scientist, Vol. 7, 1 (2014), 140-148. https:\/\/pearl.plymouth.ac.uk\/tpss\/vol7\/iss1\/4\/","journal-title":"The Plymouth Student Scientist"},{"key":"e_1_3_2_2_19_1","first-page":"17","article-title":". On the Evolution of Random Graphs","volume":"5","author":"Erd\u0151s Paul","year":"1960","unstructured":"Paul Erd\u0151s, Alfr\u00e9d R\u00e9nyi, et al., 1960. On the Evolution of Random Graphs. Publ. Math. Inst. Hungar. Acad. Sci, Vol. 5 (1960), 17-61. https:\/\/pages.cs.wisc.edu\/ cs809-1\/ErdosRenyi.pdf","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-024-01291-8"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467430"},{"key":"e_1_3_2_2_22_1","unstructured":"Wikimedia Foundation. 2010. Wikimedia Downloads. http:\/\/dumps.wikimedia.org\/"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803884"},{"key":"e_1_3_2_2_24_1","first-page":"17","article-title":"PowerGraph","author":"Gonzalez Joseph E.","year":"2012","unstructured":"Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In OSDI. 17-30. https:\/\/www.usenix.org\/conference\/osdi12\/technical-sessions\/presentation\/gonzalez","journal-title":"Distributed Graph-Parallel Computation on Natural Graphs. In OSDI."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/IC2E.2019.00-11"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2848257"},{"key":"e_1_3_2_2_28_1","unstructured":"George Karypis. 1998. hMETIS 1.5: A Hypergraph Partitioning Package. (1998). https:\/\/janders.eecg.utoronto.ca\/1387\/ex2_circuits\/manual_hmetis.pdf"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_2_30_1","first-page":"2654","article-title":"Disentangling by Factorising","volume":"80","author":"Kim Hyunjik","year":"2018","unstructured":"Hyunjik Kim and Andriy Mnih. 2018. Disentangling by Factorising. In ICML, Vol. 80. 2654-2663. http:\/\/proceedings.mlr.press\/v80\/kim18b.html","journal-title":"ICML"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599567"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437801.3441611"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8621968"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_2_37_1","volume-title":"Text REtrieval Conference (TREC) English Documents. http:\/\/trec.nist.gov\/data\/docs_eng.html","author":"National Institute of Standards and Technology.","year":"1997","unstructured":"National Institute of Standards and Technology. 1997. Text REtrieval Conference (TREC) English Documents. http:\/\/trec.nist.gov\/data\/docs_eng.html"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1561\/106.00000014"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3529090"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374527"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-023-00684-8"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2874881"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16578"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.07.018"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380590"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098033"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.3389\/fgene.2021.690049"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6170"},{"key":"e_1_3_2_2_50_1","unstructured":"Dengyong Zhou Jiayuan Huang and Bernhard Sch\u00f6lkopf. 2006. Learning with Hypergraphs: Clustering Classification and Embedding. (2006) 1601-1608. https:\/\/proceedings.neurips.cc\/paper\/2006\/hash\/dff8e9c2ac33381546d96deea9922999-Abstract.html"}],"event":{"name":"KDD '26: The 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Jeju Island Republic of Korea","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3770854.3780266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T12:17:52Z","timestamp":1785500272000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3770854.3780266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,20]]},"references-count":50,"alternative-id":["10.1145\/3770854.3780266","10.1145\/3770854"],"URL":"https:\/\/doi.org\/10.1145\/3770854.3780266","relation":{},"subject":[],"published":{"date-parts":[[2026,4,20]]},"assertion":[{"value":"2026-04-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}