{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IONR656APNYW77EMRU7SI6RMYQ","short_pith_number":"pith:IONR656A","schema_version":"1.0","canonical_sha256":"439b1f77c07b716ffc8c8d3f247a2cc430cd6b22d24be62426b1207c871e6dc3","source":{"kind":"arxiv","id":"2602.16937","version":2},"attestation_state":"computed","paper":{"title":"Graphs are maximally expressive for higher-order interactions","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","nlin.AO"],"primary_cat":"physics.soc-ph","authors_text":"Leto Peel, Manlio De Domenico, Thilo gross, Tiago P. Peixoto","submitted_at":"2026-02-18T23:00:04Z","abstract_excerpt":"We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on \"higher-order networks\" that graph-based representations are fundamentally limited to \"pairwise\" interactions, requiring hypergraph formulations to capture richer dependencies. We clarify this issue by emphasizing two frequently overlooked facts. First, graph-based models are not restricted to pairwise interactions, as they easily accommodate interactions that d"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2602.16937","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"physics.soc-ph","submitted_at":"2026-02-18T23:00:04Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","nlin.AO"],"title_canon_sha256":"3f6c6cb393997ed349d2c97d09f74eb47d0b28e0901847696a55a882fa46d555","abstract_canon_sha256":"086f523ee41c71c3598122b7ffd109df07dd1b10be31c397382f3e77fe6bcada"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-19T01:29:44.586969Z","signature_b64":"/JgGsSaHJmYUiG6dbt9El/L7KMutMEh0qavkv9JyjLA3tDPOujTDYqMrZB8Amhd9hm+7ziXpqHLAe/CylRQ6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"439b1f77c07b716ffc8c8d3f247a2cc430cd6b22d24be62426b1207c871e6dc3","last_reissued_at":"2026-08-19T01:29:44.584492Z","signature_status":"signed_v1","first_computed_at":"2026-08-19T01:29:44.584492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs are maximally expressive for higher-order interactions","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","nlin.AO"],"primary_cat":"physics.soc-ph","authors_text":"Leto Peel, Manlio De Domenico, Thilo gross, Tiago P. Peixoto","submitted_at":"2026-02-18T23:00:04Z","abstract_excerpt":"We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on \"higher-order networks\" that graph-based representations are fundamentally limited to \"pairwise\" interactions, requiring hypergraph formulations to capture richer dependencies. We clarify this issue by emphasizing two frequently overlooked facts. First, graph-based models are not restricted to pairwise interactions, as they easily accommodate interactions that d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.16937","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.16937/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2602.16937","created_at":"2026-08-19T01:29:44.586952+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.16937v2","created_at":"2026-08-19T01:29:44.586952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.16937","created_at":"2026-08-19T01:29:44.586952+00:00"},{"alias_kind":"pith_short_12","alias_value":"IONR656APNYW","created_at":"2026-08-19T01:29:44.586952+00:00"},{"alias_kind":"pith_short_16","alias_value":"IONR656APNYW77EM","created_at":"2026-08-19T01:29:44.586952+00:00"},{"alias_kind":"pith_short_8","alias_value":"IONR656A","created_at":"2026-08-19T01:29:44.586952+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":8,"sample":[{"citing_arxiv_id":"2607.07286","citing_title":"From Statistical to Structural Synergy: A Predictability Framework to Quantify the Effects due to High-Order Mechanisms","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07662","citing_title":"Impact of Channel Dynamics on Higher-order Interactions of Oscillators","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.30551","citing_title":"Beyond Direct Retweets: Multi-Step Pathways in Italian COVID-19 Twitter","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2605.31209","citing_title":"q-Exponential Random Graphs: higher-order networks from simple constraints","ref_index":69,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22853","citing_title":"Topological Signal Processing: An Application-Oriented Tutorial","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06301","citing_title":"Higher-order interactions in ecology can be hidden in plain sight","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06467","citing_title":"No Triangulation Without Representation: Generalization in Topological Deep Learning","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14065","citing_title":"Nonmonotonic percolation threshold in correlated networks and hypergraphs","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IONR656APNYW77EMRU7SI6RMYQ","json":"https://pith.science/pith/IONR656APNYW77EMRU7SI6RMYQ.json","graph_json":"https://pith.science/api/pith-number/IONR656APNYW77EMRU7SI6RMYQ/graph.json","events_json":"https://pith.science/api/pith-number/IONR656APNYW77EMRU7SI6RMYQ/events.json","paper":"https://pith.science/paper/IONR656A"},"agent_actions":{"view_html":"https://pith.science/pith/IONR656APNYW77EMRU7SI6RMYQ","download_json":"https://pith.science/pith/IONR656APNYW77EMRU7SI6RMYQ.json","view_paper":"https://pith.science/paper/IONR656A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.16937&json=true","fetch_graph":"https://pith.science/api/pith-number/IONR656APNYW77EMRU7SI6RMYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IONR656APNYW77EMRU7SI6RMYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IONR656APNYW77EMRU7SI6RMYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IONR656APNYW77EMRU7SI6RMYQ/action/storage_attestation","attest_author":"https://pith.science/pith/IONR656APNYW77EMRU7SI6RMYQ/action/author_attestation","sign_citation":"https://pith.science/pith/IONR656APNYW77EMRU7SI6RMYQ/action/citation_signature","submit_replication":"https://pith.science/pith/IONR656APNYW77EMRU7SI6RMYQ/action/replication_record"}},"created_at":"2026-08-19T01:29:44.586952+00:00","updated_at":"2026-08-19T01:29:44.586952+00:00"}