{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T20:42:48Z","timestamp":1792096968847,"version":"4.4.0"},"reference-count":39,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:00:00Z","timestamp":1780444800000},"content-version":"vor","delay-in-days":29,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The availability of network datasets advances research in network science, machine learning and related fields by enabling empirical analyses and their reproducibility, algorithm development, model validation and benchmarking. Existing repositories, such as SNAP and Netzschleuder, have made traditional network datasets widely accessible with metadata, metrics, and basic visualizations. However, they primarily focus on pairwise interactions, limiting data access to systems with many-body interactions. To address this gap, we created hypergraphx-data, a repository of real-world hypergraph datasets for higher-order network analysis, spanning different domains from social networks to biology and finance, and supporting configurations such as weighted, directed, temporal, and multiplex hypergraphs. Each dataset includes relational information and metadata, provided in an open JSON format and a binarized format for Hypergraphx. We provide a user-friendly interface to facilitate browsing, filtering, and accessing the datasets, while also ensuring integrity and reproducibility through hash-based verification and data versioning. The repository is available at https:\/\/hgx-team.github.io\/hypergraphx-data.<\/jats:p>","DOI":"10.1093\/comnet\/cnag014","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T11:43:01Z","timestamp":1776253381000},"source":"Crossref","is-referenced-by-count":2,"title":["Hypergraphx-data: a repository for higher-order network data"],"prefix":"10.1093","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7084-8339","authenticated-orcid":false,"given":"Quintino Francesco","family":"Lotito","sequence":"first","affiliation":[{"name":"Department of Network and Data Science, Central European University , Vienna, 1100,","place":["Austria"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Betti","sequence":"additional","affiliation":[{"name":"Department of Network and Data Science, Central European University , Vienna, 1100,","place":["Austria"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bern\u00e9","family":"Nortier","sequence":"additional","affiliation":[{"name":"Department of Network and Data Science, Central European University , Vienna, 1100,","place":["Austria"]},{"name":"University of St. Andrews School of Computer Science, , St. Andrews, KY16,","place":["UK"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Montresor","sequence":"additional","affiliation":[{"name":"Department of Information Engineering and Computer Science, University of Trento , via Sommarive 9 , Trento, 38123,","place":["Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Federico","family":"Battiston","sequence":"additional","affiliation":[{"name":"Department of Network and Data Science, Central European University , Vienna, 1100,","place":["Austria"]},{"name":"Department of AI, Data and Decision Sciences, Luiss University of Rome , Viale Romania 32 , Rome, 00197,","place":["Italy"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2026,5,31]]},"reference":[{"key":"2026060221062782400_cnag014-B1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"Newman","year":"2010"},{"key":"2026060221062782400_cnag014-B2","author":"Leskovec"},{"key":"2026060221062782400_cnag014-B3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/2897350.2897355","article-title":"An interactive data repository with visual analytics","volume":"17","author":"Rossi","year":"2016","journal-title":"SIGKDD Explor Newsl"},{"key":"2026060221062782400_cnag014-B4","first-page":"1343","author":"Kunegis","year":"2013"},{"key":"2026060221062782400_cnag014-B5","author":"Peixoto","year":"2023"},{"key":"2026060221062782400_cnag014-B6","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":"2026060221062782400_cnag014-B7","volume-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"2026060221062782400_cnag014-B8","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1038\/s41567-021-01371-4","article-title":"The physics of higher-order interactions in complex systems","volume":"17","author":"Battiston","year":"2021","journal-title":"Nat Phys"},{"key":"2026060221062782400_cnag014-B9","doi-asserted-by":"crossref","first-page":"cnad019","DOI":"10.1093\/comnet\/cnad019","article-title":"Hypergraphx: a library for higher-order network analysis","volume":"11","author":"Lotito","year":"2023","journal-title":"J Complex Netw"},{"key":"2026060221062782400_cnag014-B10","doi-asserted-by":"crossref","first-page":"5162","DOI":"10.21105\/joss.05162","article-title":"XGI: a Python package for higher-order interaction networks","volume":"8","author":"Landry","year":"2023","journal-title":"Joss"},{"key":"2026060221062782400_cnag014-B11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-59205-8\\_11"},{"key":"2026060221062782400_cnag014-B12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1140\/epjds\/s13688-018-0140-1","article-title":"Can co-location be used as a proxy for face-to-face contacts","volume":"7","author":"G\u2019enois","year":"2018","journal-title":"EPJ Data Science"},{"key":"2026060221062782400_cnag014-B13","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1017\/nws.2015.10","article-title":"Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers","volume":"3","author":"G\u00e9nois","year":"2015","journal-title":"Net Sci"},{"key":"2026060221062782400_cnag014-B14","doi-asserted-by":"crossref","first-page":"e0136497","DOI":"10.1371\/journal.pone.0136497","article-title":"Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys","volume":"10","author":"Mastrandrea","year":"2015","journal-title":"PloS One"},{"key":"2026060221062782400_cnag014-B15","doi-asserted-by":"crossref","first-page":"e23176","DOI":"10.1371\/journal.pone.0023176","article-title":"High-resolution measurements of face-to-face contact patterns in a primary school","volume":"6","author":"Stehl\u00e9","year":"2011","journal-title":"PloS One"},{"key":"2026060221062782400_cnag014-B16","doi-asserted-by":"crossref","first-page":"e73970","DOI":"10.1371\/journal.pone.0073970","article-title":"Estimating potential infection transmission routes in hospital wards using wearable proximity sensors","volume":"8","author":"Vanhems","year":"2013","journal-title":"PloS One"},{"key":"2026060221062782400_cnag014-B17","year":"2021"},{"key":"2026060221062782400_cnag014-B18","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":"2026060221062782400_cnag014-B19","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742839"},{"key":"2026060221062782400_cnag014-B20"},{"key":"2026060221062782400_cnag014-B21","author":"Epstein","year":"2019"},{"key":"2026060221062782400_cnag014-B22","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution","author":"Leskovec","year":"2007","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2026060221062782400_cnag014-B23","first-page":"555","author":"Yin","year":"2017"},{"key":"2026060221062782400_cnag014-B24","doi-asserted-by":"crossref","first-page":"20190737","DOI":"10.1098\/rspa.2019.0737","article-title":"Measuring social networks in primates: wearable sensors versus direct observations","volume":"476","author":"Gelardi","year":"2020","journal-title":"Proc R Soc A"},{"key":"2026060221062782400_cnag014-B25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0020284","article-title":"Gene-disease network analysis reveals functional modules in Mendelian, complex and environmental diseases","volume":"6","author":"Bauer-Mehren","year":"2011","journal-title":"Plos ONE"},{"key":"2026060221062782400_cnag014-B26","doi-asserted-by":"crossref","first-page":"e21","DOI":"10.1017\/nws.2025.10018","article-title":"HIF: The hypergraph interchange format for higher-order networks","volume":"13","author":"Coll","year":"2025","journal-title":"Network Science"},{"key":"2026060221062782400_cnag014-B27","doi-asserted-by":"crossref","first-page":"6016","DOI":"10.21105\/joss.06016","article-title":"HyperNetX: a Python package for modeling complex network data as hypergraphs","volume":"9","author":"Praggastis","year":"2024","journal-title":"Joss"},{"key":"2026060221062782400_cnag014-B28","first-page":"1","article-title":"Analyzing, exploring, and visualizing complex networks via hypergraphs using simpleHypergraphs.Jl","volume":"1","author":"Spagnuolo","year":"2020","journal-title":"Internet Math"},{"key":"2026060221062782400_cnag014-B29"},{"key":"2026060221062782400_cnag014-B30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-021-86469-8","article-title":"Temporal properties of higher-order interactions in social networks","volume":"11","author":"Cencetti","year":"2021","journal-title":"Sci Rep"},{"key":"2026060221062782400_cnag014-B31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1038\/s42005-025-02472-9","article-title":"The microscale organization of directed hypergraphs","volume":"9","author":"Lotito","year":"2026","journal-title":"Commun Phys"},{"key":"2026060221062782400_cnag014-B32","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s41109-024-00665-9","article-title":"Multiplex measures for higher-order networks","volume":"9","author":"Lotito","year":"2024","journal-title":"Appl Netw Sci"},{"key":"2026060221062782400_cnag014-B33","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s00607-023-01230-5","article-title":"Exact and sampling methods for mining higher-order motifs in large hypergraphs","volume":"106","author":"Lotito","year":"2024","journal-title":"Computing"},{"key":"2026060221062782400_cnag014-B34","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":"2026060221062782400_cnag014-B35","doi-asserted-by":"crossref","first-page":"eadg9159","DOI":"10.1126\/sciadv.adg9159","article-title":"Community detection in large hypergraphs","volume":"9","author":"Ruggeri","year":"2023","journal-title":"Sci Adv"},{"key":"2026060221062782400_cnag014-B36","doi-asserted-by":"crossref","first-page":"247401","DOI":"10.1103\/xrn7-cz8v","article-title":"Structural reducibility of hypergraphs","volume":"135","author":"Kirkley","year":"2025","journal-title":"Phys Rev Lett"},{"key":"2026060221062782400_cnag014-B37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s42005-021-00710-4","article-title":"Detecting informative higher-order interactions in statistically validated hypergraphs","volume":"4","author":"Musciotto","year":"2021","journal-title":"Commun Phys"},{"key":"2026060221062782400_cnag014-B38","first-page":"217","volume-title":"International Conference on Parallel Problem Solving from Nature","author":"Genetti","year":"2024"},{"key":"2026060221062782400_cnag014-B39","doi-asserted-by":"crossref","first-page":"054302","DOI":"10.1103\/1mxy-3cnl","article-title":"Higher-order shortest paths in hypergraphs","volume":"112","author":"Nortier","year":"2025","journal-title":"Phys Rev E"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/14\/3\/cnag014\/68456274\/cnag014.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/14\/3\/cnag014\/68456274\/cnag014.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:06:38Z","timestamp":1780448798000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnag014\/8700195"}},"subtitle":[],"editor":[{"family":"Matjaz Perc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2026,5,5]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5,5]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnag014","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,6]]},"published":{"date-parts":[[2026,5,5]]},"article-number":"cnag014"}}