{"paper":{"title":"Hypergraphx-data: a repository for higher-order network data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The authors release hypergraphx-data, an open repository of hypergraph datasets in JSON and binarized formats supporting weighted, directed, temporal, and multiplex structures with metadata and verification tools.","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Alberto Montresor, Bern\\'e Nortier, Federico Battiston, Lorenzo Betti, Quintino Francesco Lotito","submitted_at":"2026-05-18T10:09:31Z","abstract_excerpt":"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 datase"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The authors release hypergraphx-data, an open repository of hypergraph datasets in JSON and binarized formats supporting weighted, directed, temporal, and multiplex structures with metadata and verification tools.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"2f18b2729f7aaac8d943186690e1b3297323e1c25ce9e5626778980bd3b852e4"},"source":{"id":"2605.18166","kind":"arxiv","version":1},"verdict":{"id":"7207be46-7424-4eec-b53d-1a101824cb7e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-20T00:03:08.157781Z","strongest_claim":"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.","one_line_summary":"The authors release hypergraphx-data, an open repository of hypergraph datasets in JSON and binarized formats supporting weighted, directed, temporal, and multiplex structures with metadata and verification tools.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"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.","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18166/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T23:41:59.055750Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.356466Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"300123aa0ba288aee8d941c5b2bc2474061bb2d6916f95ded3e22e5a7f5c2215"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}