{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T01:04:23Z","timestamp":1772586263852,"version":"3.50.1"},"reference-count":66,"publisher":"Cambridge University Press (CUP)","license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"unspecified","delay-in-days":344,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Net Sci"],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Many empirical systems contain complex interactions of arbitrary size, representing, for example, chemical reactions, social groups, co-authorship relationships, and ecological dependencies. These interactions are known as higher-order interactions, and the collection of these interactions comprise a higher-order network, or hypergraph. Hypergraphs have established themselves as a popular and versatile mathematical representation of such systems, and a number of software packages written in various programming languages have been designed to analyze these networks. However, the ecosystem of higher-order network analysis software is fragmented due to specialization of each software\u2019s programming interface and compatible data representations. To enable seamless data exchange between higher-order network analysis software packages, we introduce the Hypergraph Interchange Format (HIF), a standardized format for storing higher-order network data. HIF supports multiple types of higher-order networks, including undirected hypergraphs, directed hypergraphs, and abstract simplicial complexes, while actively exploring extensions to represent multiplex hypergraphs, temporal hypergraphs, and ordered hypergraphs. To accommodate the wide variety of metadata used in different contexts, HIF also includes support for attributes associated with nodes, edges, and incidences. This initiative is a collaborative effort involving authors, maintainers, and contributors from prominent hypergraph software packages. This project introduces a JSON schema with corresponding documentation and unit tests, example HIF-compliant datasets, and tutorials demonstrating the use of HIF with several popular higher-order network analysis software packages.<\/jats:p>","DOI":"10.1017\/nws.2025.10018","type":"journal-article","created":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T10:23:44Z","timestamp":1765448624000},"source":"Crossref","is-referenced-by-count":1,"title":["HIF: The hypergraph interchange format for higher-order networks"],"prefix":"10.1017","volume":"13","author":[{"given":"Mart\u00edn","family":"Coll","sequence":"first","affiliation":[{"name":"University of Buenos Aires"}]},{"given":"Cliff A.","family":"Joslyn","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory"},{"name":"Binghamton University"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1270-4980","authenticated-orcid":false,"given":"Nicholas W.","family":"Landry","sequence":"additional","affiliation":[{"name":"University of Virginia"},{"name":"University of Virginia"},{"name":"University of Vermont"}]},{"given":"Quintino Francesco","family":"Lotito","sequence":"additional","affiliation":[{"name":"University of Trento"},{"name":"Central European University"}]},{"given":"Audun","family":"Myers","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory"}]},{"given":"Joshua","family":"Pickard","sequence":"additional","affiliation":[{"name":"Institute of MIT and Harvard"}]},{"given":"Brenda","family":"Praggastis","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory"}]},{"given":"Przemys\u0142aw","family":"Szufel","sequence":"additional","affiliation":[{"name":"SGH Warsaw School of Economics"}]}],"member":"56","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"S2050124225100180_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0"},{"key":"S2050124225100180_ref45","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-022-00858-7"},{"key":"S2050124225100180_ref63","doi-asserted-by":"publisher","DOI":"10.21105\/joss.05940"},{"key":"S2050124225100180_ref66","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1116502109"},{"key":"S2050124225100180_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-023-01232-8"},{"key":"S2050124225100180_ref11","doi-asserted-by":"publisher","DOI":"10.1137\/18M1203031"},{"key":"S2050124225100180_ref32","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-024-50918-5"},{"key":"S2050124225100180_ref60","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2505.11608"},{"key":"S2050124225100180_ref18","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0011596"},{"key":"S2050124225100180_ref34","doi-asserted-by":"publisher","DOI":"10.1038\/35036627"},{"key":"S2050124225100180_ref46","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v7i1.14401"},{"key":"S2050124225100180_ref64","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0023176"},{"key":"S2050124225100180_ref41","unstructured":"Leskovec, J , & Krevl, A (2014). SNAP Datasets: Stanford large network dataset collection, June. Available at http:\/\/snap.stanford.edu\/data."},{"key":"S2050124225100180_ref29","first-page":"1","article-title":"TopoX: a suite of python packages for machine learning on topological domains","volume":"25","author":"Hajij","year":"2024","journal-title":"Journal of Machine Learning Research"},{"key":"S2050124225100180_ref15","first-page":"517","volume-title":"Handbook of graph drawing and visualization","author":"Brandes","year":"2010"},{"key":"S2050124225100180_ref21","unstructured":"Clauset, A , Tucker, E and Sainz, M (2016). The colorado index of complex networks. Available at https:\/\/icon.colorado.edu\/."},{"key":"S2050124225100180_ref17","doi-asserted-by":"publisher","DOI":"10.1126\/science.1245200"},{"key":"S2050124225100180_ref24","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac347"},{"key":"S2050124225100180_ref54","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1011190"},{"key":"S2050124225100180_ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-32296-9_9"},{"key":"S2050124225100180_ref47","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-24584-w"},{"key":"S2050124225100180_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-023-00555-6"},{"key":"S2050124225100180_ref52","unstructured":"ONNX Community. (2024). ONNX: Open neural network exchange. Available at https:\/\/onnx.ai\/."},{"key":"S2050124225100180_ref53","unstructured":"Peixoto, TP (2021). Netzschleuder. Available at https:\/\/networks.skewed.de\/."},{"key":"S2050124225100180_ref55","doi-asserted-by":"publisher","DOI":"10.1137\/23M1592547"},{"key":"S2050124225100180_ref20","unstructured":"Chitra, U and Raphael, B (2019). RandomWalks on hypergraphs with edge-dependent vertex weights. In Proceedings of the 36th International Conference on Machine Learning, pp. 1172\u20131181. Available at https:\/\/proceedings.mlr.press\/v97\/chitra19a.html."},{"key":"S2050124225100180_ref42","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnad019"},{"key":"S2050124225100180_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)90045-P"},{"key":"S2050124225100180_ref10","first-page":"1","article-title":"Networks beyond pairwise interactions: structure and dynamics","volume":"874","author":"Battiston","year":"2020","journal-title":"Physics Reports, Networks beyond Pairwise Interactions: Structure and Dynamics"},{"key":"S2050124225100180_ref9","doi-asserted-by":"publisher","DOI":"10.1038\/nrg1272"},{"key":"S2050124225100180_ref50","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"S2050124225100180_ref23","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2023.0141"},{"key":"S2050124225100180_ref3","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-020-00231-0"},{"key":"S2050124225100180_ref37","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0224307"},{"key":"S2050124225100180_ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.3002963"},{"key":"S2050124225100180_ref7","first-page":"2352","article-title":"Reticula: a temporal network and hypergraph analysis software package","volume":"101","author":"Badie-Modiri","year":"2023","journal-title":"SoftwareX"},{"key":"S2050124225100180_ref40","doi-asserted-by":"publisher","DOI":"10.21105\/joss.05162"},{"key":"S2050124225100180_ref59","unstructured":"Preston-Werner, T (2023). Semantic Versioning 2.0.0. Available at https:\/\/semver.org\/."},{"key":"S2050124225100180_ref58","doi-asserted-by":"publisher","DOI":"10.21105\/joss.06016"},{"key":"S2050124225100180_ref39","first-page":"2632","article-title":"Filtering higher-order datasets","volume":"5","author":"Landry","year":"2024","journal-title":"Journal of Physics: Complexity"},{"key":"S2050124225100180_ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"S2050124225100180_ref25","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-32980-z"},{"key":"S2050124225100180_ref22","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-34714-7"},{"key":"S2050124225100180_ref33","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/10858.001.0001"},{"key":"S2050124225100180_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2019.05.025"},{"key":"S2050124225100180_ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-023-01230-5"},{"key":"S2050124225100180_ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2024.08.301"},{"key":"S2050124225100180_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412034"},{"key":"S2050124225100180_ref4","doi-asserted-by":"publisher","DOI":"10.1038\/43601"},{"key":"S2050124225100180_ref2","doi-asserted-by":"publisher","DOI":"10.1137\/23M1584472"},{"key":"S2050124225100180_ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-024-00665-9"},{"key":"S2050124225100180_ref51","volume-title":"Exploratory Social Network Analysis with Pajek: Revised and Expanded Edition for Updated Software","author":"Nooy","year":"2018"},{"key":"S2050124225100180_ref31","unstructured":"HGX-Team 2025). HGX-data: collection of datasets for higher-order network analysis. Available at https:\/\/github.com\/HGX-Team\/data."},{"key":"S2050124225100180_ref61","article-title":"Analyzing, exploring, and visualizing complex networks via hypergraphs using SimpleHypergraphs.jl","volume":"1","author":"Spagnuolo","year":"2020","journal-title":"Internet Mathematics"},{"key":"S2050124225100180_ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67318-5_25"},{"key":"S2050124225100180_ref49","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.032310"},{"key":"S2050124225100180_ref57","doi-asserted-by":"publisher","DOI":"10.1109\/CDC49753.2023.10383387"},{"key":"S2050124225100180_ref12","unstructured":"Benson, AR (2021). Data! Available at https:\/\/www.cs.cornell.edu\/~arb\/data\/."},{"key":"S2050124225100180_ref13","volume-title":"Hypergraphs: combinatorics of finite sets","author":"Berge","year":"1989"},{"key":"S2050124225100180_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45446-2_20"},{"key":"S2050124225100180_ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.tics.2004.07.008"},{"key":"S2050124225100180_ref1","doi-asserted-by":"crossref","unstructured":"Adams, J (2019). Gathering social network data, 1st edn. Thousand Oaks: SAGE Publications, Inc.","DOI":"10.4135\/9781544321486"},{"key":"S2050124225100180_ref14","doi-asserted-by":"publisher","DOI":"10.1137\/21M1414024"},{"key":"S2050124225100180_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-59205-8_11"},{"key":"S2050124225100180_ref65","doi-asserted-by":"publisher","DOI":"10.1137\/20M1355896"},{"key":"S2050124225100180_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(02)00736-7"}],"container-title":["Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S2050124225100180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T10:23:50Z","timestamp":1765448630000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S2050124225100180\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":66,"alternative-id":["S2050124225100180"],"URL":"https:\/\/doi.org\/10.1017\/nws.2025.10018","relation":{},"ISSN":["2050-1242","2050-1250"],"issn-type":[{"value":"2050-1242","type":"print"},{"value":"2050-1250","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"article-number":"e21"}}