{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:17:50Z","timestamp":1780636670129,"version":"3.54.1"},"reference-count":64,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T00:00:00Z","timestamp":1687478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"name":"Polish National Agency","award":["BPI\/PST\/2021\/1\/00069\/U\/00001"],"award-info":[{"award-number":["BPI\/PST\/2021\/1\/00069\/U\/00001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The Artificial Benchmark for Community Detection (ABCD) graph is a recently introduced random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs with similar properties as the well-known Lancichinetti, Fortunato, Radicchi (LFR) one, and its main parameter \u03be can be tuned to mimic its counterpart in the LFR model, the mixing parameter \u03bc. In this article, we introduce hypergraph counterpart of the ABCD model, h\u2013ABCD, which also produces random hypergraph with distributions of ground-truth community sizes and degrees following power-law. As in the original ABCD, the new model h\u2013ABCD can produce hypergraphs with various levels of noise. More importantly, the model is flexible and can mimic any desired level of homogeneity of hyperedges that fall into one community. As a result, it can be used as a suitable, synthetic playground for analyzing and tuning hypergraph community detection algorithms.<\/jats:p>\n               <jats:p>[Received on 22 October 2022; editorial decision on 18 July 2023; accepted on 19 July 2023]<\/jats:p>","DOI":"10.1093\/comnet\/cnad028","type":"journal-article","created":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T00:34:45Z","timestamp":1691627685000},"source":"Crossref","is-referenced-by-count":21,"title":["Hypergraph Artificial Benchmark for Community Detection (h\u2013ABCD)"],"prefix":"10.1093","volume":"11","author":[{"given":"Bogumi\u0142","family":"Kami\u0144ski","sequence":"first","affiliation":[{"name":"Decision Analysis and Support Unit, SGH Warsaw School of Economics , Warsaw, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Toronto Metropolitan University , Toronto, ON M5B 2K3, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fran\u00e7ois","family":"Th\u00e9berge","sequence":"additional","affiliation":[{"name":"Tutte Institute for Mathematics and Computing , Ottawa, ON K1G 3Z4, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"2023081000344045800_cnad028-B1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"Newman","year":"2018"},{"key":"2023081000344045800_cnad028-B2","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvcm4gh1","volume-title":"Social and Economic Networks","author":"Jackson","year":"2010"},{"key":"2023081000344045800_cnad028-B3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning about a Highly Connected World","author":"Easley","year":"2010"},{"key":"2023081000344045800_cnad028-B4","doi-asserted-by":"crossref","DOI":"10.1201\/9781003218869","volume-title":"Mining complex networks","author":"Kami\u0144ski","year":"2021"},{"key":"2023081000344045800_cnad028-B5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1126\/science.aad9029","article-title":"Higher-order organization of complex networks","volume":"353","author":"Benson","year":"2016","journal-title":"Science"},{"key":"2023081000344045800_cnad028-B6","doi-asserted-by":"crossref","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","article-title":"Simplicial closure and higher-order link prediction","volume":"115","author":"Benson","year":"2018","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023081000344045800_cnad028-B7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2020.05.004","article-title":"Networks beyond pairwise interactions: structure and dynamics","volume":"874","author":"Battiston","year":"2020","journal-title":"Phys. Rep"},{"key":"2023081000344045800_cnad028-B8","author":"Benson","year":"2021"},{"key":"2023081000344045800_cnad028-B9","doi-asserted-by":"crossref","first-page":"e0224307","DOI":"10.1371\/journal.pone.0224307","article-title":"Clustering via hypergraph modularity","volume":"14","author":"Kami\u0144ski","year":"2019","journal-title":"PLoS One"},{"key":"2023081000344045800_cnad028-B10","first-page":"152","author":"Kami\u0144ski","year":"2020"},{"key":"2023081000344045800_cnad028-B11","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/978-3-030-36687-2_24","volume-title":"Complex Networks and Their Applications VIII","author":"Kumar","year":"2020"},{"key":"2023081000344045800_cnad028-B12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/s41109-020-00300-3","article-title":"Hypergraph clustering by iteratively reweighted modularity maximization","volume":"5","author":"Kumar","year":"2020","journal-title":"Appl. Netw. Sci"},{"key":"2023081000344045800_cnad028-B13","doi-asserted-by":"crossref","first-page":"eabh1303","DOI":"10.1126\/sciadv.abh1303","article-title":"Generative hypergraph clustering: from blockmodels to modularity","volume":"7","author":"Chodrow","year":"2021","journal-title":"Sci. Adv"},{"key":"2023081000344045800_cnad028-B14","first-page":"555","author":"Yin","year":"2017"},{"key":"2023081000344045800_cnad028-B15","doi-asserted-by":"crossref","first-page":"052306","DOI":"10.1103\/PhysRevE.97.052306","article-title":"Higher-order clustering in networks","volume":"97","author":"Yin","year":"2018","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B16","first-page":"118","author":"Benson","year":"2015"},{"key":"2023081000344045800_cnad028-B17","first-page":"871","author":"Chien","year":"2018"},{"key":"2023081000344045800_cnad028-B18","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1109\/JSTSP.2018.2837638","article-title":"Hypergraph spectral clustering in the weighted stochastic block model","volume":"12","author":"Ahn","year":"2018","journal-title":"IEEE J. Select. Top. Signal Process"},{"key":"2023081000344045800_cnad028-B19","first-page":"3396","author":"Lee","year":"2021"},{"key":"2023081000344045800_cnad028-B20","author":"Juul","year":"2022"},{"key":"2023081000344045800_cnad028-B21","article-title":"Learning with hypergraphs: clustering, classification, and embedding","volume":"19","author":"Zhou","year":"2006","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2023081000344045800_cnad028-B22","doi-asserted-by":"crossref","first-page":"7229","DOI":"10.1038\/s41467-022-34714-7","article-title":"Inference of hyperedges and overlapping communities in hypergraphs","volume":"13","author":"Contisciani","year":"2022","journal-title":"Nat. Commun"},{"key":"2023081000344045800_cnad028-B23","author":"Chodrow","year":"2022"},{"key":"2023081000344045800_cnad028-B24","first-page":"176","author":"Do","year":"2020"},{"key":"2023081000344045800_cnad028-B25","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B26","doi-asserted-by":"crossref","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","article-title":"Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities","volume":"80","author":"Lancichinetti","year":"2009","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B27","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1017\/nws.2020.45","article-title":"Artificial benchmark for community detection (ABCD): a fast random graph model with community structure","volume":"9","author":"Kami\u0144ski","year":"2021","journal-title":"Netw. Sci"},{"key":"2023081000344045800_cnad028-B28","doi-asserted-by":"crossref","first-page":"100348","DOI":"10.1016\/j.bdr.2022.100348","article-title":"Properties and performance of the abcde random graph model with community structure","volume":"30","author":"Kami\u0144ski","year":"2022","journal-title":"Big Data Res"},{"key":"2023081000344045800_cnad028-B29","doi-asserted-by":"crossref","first-page":"cnac050","DOI":"10.1093\/comnet\/cnac050","article-title":"Modularity of the ABCD random graph model with community structure","volume":"10","author":"Kami\u0144ski","year":"2022","journal-title":"J. Complex Netw"},{"key":"2023081000344045800_cnad028-B30","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution limit in community detection","volume":"104","author":"Fortunato","year":"2007","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023081000344045800_cnad028-B31","author":"Kami\u0144ski","year":"2022"},{"key":"2023081000344045800_cnad028-B32","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled regular graphs","volume":"1","author":"Bollob\u00e1s","year":"1980","journal-title":"Eur. J. Comb"},{"key":"2023081000344045800_cnad028-B33","doi-asserted-by":"crossref","first-page":"cnaa018","DOI":"10.1093\/comnet\/cnaa018","article-title":"Configuration models of random hypergraphs","volume":"8","author":"Chodrow","year":"2020","journal-title":"J. Complex Netw"},{"key":"2023081000344045800_cnad028-B34","doi-asserted-by":"crossref","first-page":"112566","DOI":"10.1016\/j.disc.2021.112566","article-title":"Sampling hypergraphs with given degrees","volume":"344","author":"Dyer","year":"2021","journal-title":"Discrete Math"},{"key":"2023081000344045800_cnad028-B35","doi-asserted-by":"crossref","first-page":"066118","DOI":"10.1103\/PhysRevE.79.066118","article-title":"Random hypergraphs and their applications","volume":"79","author":"Ghoshal","year":"2009","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B36","doi-asserted-by":"crossref","first-page":"062311","DOI":"10.1103\/PhysRevE.93.062311","article-title":"Generalized network structures: the configuration model and the canonical ensemble of simplicial complexes","volume":"93","author":"Courtney","year":"2016","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B37","doi-asserted-by":"crossref","first-page":"062301","DOI":"10.1103\/PhysRevE.95.062301","article-title":"Weighted growing simplicial complexes","volume":"95","author":"Courtney","year":"2017","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B38","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/S0273-0979-09-01249-X","article-title":"Topology and data","volume":"46","author":"Carlsson","year":"2009","journal-title":"Bull. Amer. Math. Soc"},{"key":"2023081000344045800_cnad028-B39","volume-title":"Complex Graphs and Networks","author":"Graham","year":"2006"},{"key":"2023081000344045800_cnad028-B40","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/comnet\/cnx001.","article-title":"Measuring and modeling bipartite graphs with community structure","volume":"5","author":"Aksoy","year":"2017","journal-title":"J. Complex Netw"},{"key":"2023081000344045800_cnad028-B41","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","article-title":"Stochastic blockmodels: first steps","volume":"5","author":"Holland","year":"1983","journal-title":"Soc. Netw"},{"key":"2023081000344045800_cnad028-B42","first-page":"6446","article-title":"Community detection and stochastic block models: recent developments","volume":"18","author":"Abbe","year":"2017","journal-title":"J. Mach. Learn. Res"},{"key":"2023081000344045800_cnad028-B43","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1214\/16-AOS1453","article-title":"Consistency of spectral hypergraph partitioning under planted partition model","volume":"45","author":"Ghoshdastidar","year":"2017","journal-title":"Ann. Stat"},{"key":"2023081000344045800_cnad028-B44","author":"Kim","year":"2018"},{"key":"2023081000344045800_cnad028-B45","author":"Brusa","year":"2022"},{"key":"2023081000344045800_cnad028-B46","doi-asserted-by":"publisher","first-page":"012805","DOI":"10.1103\/PhysRevE.90.012805.","article-title":"Efficiently inferring community structure in bipartite networks","volume":"90","author":"Larremore","year":"2014","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B47","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1109\/TCYB.2017.2783325","article-title":"Adapting stochastic block models to power-law degree distributions","volume":"49","author":"Qiao","year":"2018","journal-title":"IEEE Trans. Cybern"},{"key":"2023081000344045800_cnad028-B48","author":"Ruggeri","year":"2022"},{"key":"2023081000344045800_cnad028-B49","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1145\/3534678.3539272.","author":"Papachristou","year":"2022"},{"key":"2023081000344045800_cnad028-B50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/22M1480926","article-title":"Core\u2013periphery detection in hypergraphs","volume":"5","author":"Tudisco","year":"2023","journal-title":"SIAM J. Math. Data Sci"},{"key":"2023081000344045800_cnad028-B51","volume-title":"Research Report, hal-03154836","author":"Giroire","year":"2021"},{"key":"2023081000344045800_cnad028-B52","doi-asserted-by":"publisher","author":"Saracco","year":"2022","DOI":"10.48550\/ARXIV.2207.12123."},{"key":"2023081000344045800_cnad028-B53","first-page":"8","author":"Shamimul Hasan","year":"2020"},{"key":"2023081000344045800_cnad028-B54","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1137\/141000671","article-title":"Julia: a fresh approach to numerical computing","volume":"59","author":"Bezanson","year":"2017","journal-title":"SIAM Rev"},{"key":"2023081000344045800_cnad028-B55","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"2023081000344045800_cnad028-B56","volume-title":"Network Science","author":"Barab\u00e1si","year":"2016"},{"key":"2023081000344045800_cnad028-B57","first-page":"242","author":"Orman","year":"2009"},{"key":"2023081000344045800_cnad028-B58","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","article-title":"The asymptotic number of labeled graphs with given degree sequences","volume":"24","author":"Bender","year":"1978","journal-title":"J. Comb. Theory Ser. A"},{"key":"2023081000344045800_cnad028-B59","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(84)90030-0","article-title":"Generating random regular graphs","volume":"5","author":"Wormald","year":"1984","journal-title":"J. Algorithms"},{"key":"2023081000344045800_cnad028-B60","first-page":"239","volume-title":"Models of Random Regular Graphs","author":"Wormald","year":"1999"},{"key":"2023081000344045800_cnad028-B61","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B62","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks","volume":"70","author":"Clauset","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B63","doi-asserted-by":"crossref","first-page":"066122","DOI":"10.1103\/PhysRevE.84.066122","article-title":"Limits of modularity maximization in community detection","volume":"84","author":"Lancichinetti","year":"2011","journal-title":"Phys. Rev. E"},{"key":"2023081000344045800_cnad028-B64","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Physical Rev. E"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/11\/4\/cnad028\/51078232\/cnad028.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/11\/4\/cnad028\/51078232\/cnad028.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T00:35:16Z","timestamp":1691627716000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnad028\/7240122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,23]]},"references-count":64,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,6,23]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnad028","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,8,1]]},"published":{"date-parts":[[2023,6,23]]},"article-number":"cnad028"}}