{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RPCRCU6O2RZT2FVDMMRAU4K5XV","short_pith_number":"pith:RPCRCU6O","schema_version":"1.0","canonical_sha256":"8bc51153ced4733d16a363220a715dbd72c04e6529661ecd929bb0b80d8c397b","source":{"kind":"arxiv","id":"2606.00893","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph backboning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alec Kirkley, Federico Battiston, Federico Malizia, Helcio Felippe","submitted_at":"2026-05-30T20:57:05Z","abstract_excerpt":"Hypergraphs provide a natural framework for describing complex networked systems with higher-order, non-dyadic interactions. Due to their high dimensionality and often redundant structure, a key challenge is to develop methods that simplify hypergraph representations while preserving the essential structure of interactions. Here we present a principled, efficient, and non-parametric information-theoretic method for pruning nested and/or redundant structures in hypergraphs, enabling a minimal representation of higher-order interactions in the presence of local heterogeneity. Our approach natura"},"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":"2606.00893","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2026-05-30T20:57:05Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"3d65aeb1c932880b043d9e1c68e94bf8b2985c69cb504d7f8a27af8760cf49d2","abstract_canon_sha256":"73cfe1de991f22230c32100f6e93a2c7c6f13e319efc87459bb221fa0f4c7ca5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:08.984820Z","signature_b64":"Xb0twWhhP/J5KTvTnJSYdsGlNZGm3l1m67fMVSBdy6lPDvTCYdD7YGxEsWE4ezwVHq72z+Iy0s4EjOTejUYFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc51153ced4733d16a363220a715dbd72c04e6529661ecd929bb0b80d8c397b","last_reissued_at":"2026-06-02T01:04:08.984461Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:08.984461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph backboning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alec Kirkley, Federico Battiston, Federico Malizia, Helcio Felippe","submitted_at":"2026-05-30T20:57:05Z","abstract_excerpt":"Hypergraphs provide a natural framework for describing complex networked systems with higher-order, non-dyadic interactions. Due to their high dimensionality and often redundant structure, a key challenge is to develop methods that simplify hypergraph representations while preserving the essential structure of interactions. Here we present a principled, efficient, and non-parametric information-theoretic method for pruning nested and/or redundant structures in hypergraphs, enabling a minimal representation of higher-order interactions in the presence of local heterogeneity. Our approach natura"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00893","kind":"arxiv","version":1},"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/2606.00893/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":"2606.00893","created_at":"2026-06-02T01:04:08.984516+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00893v1","created_at":"2026-06-02T01:04:08.984516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00893","created_at":"2026-06-02T01:04:08.984516+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPCRCU6O2RZT","created_at":"2026-06-02T01:04:08.984516+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPCRCU6O2RZT2FVD","created_at":"2026-06-02T01:04:08.984516+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPCRCU6O","created_at":"2026-06-02T01:04:08.984516+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPCRCU6O2RZT2FVDMMRAU4K5XV","json":"https://pith.science/pith/RPCRCU6O2RZT2FVDMMRAU4K5XV.json","graph_json":"https://pith.science/api/pith-number/RPCRCU6O2RZT2FVDMMRAU4K5XV/graph.json","events_json":"https://pith.science/api/pith-number/RPCRCU6O2RZT2FVDMMRAU4K5XV/events.json","paper":"https://pith.science/paper/RPCRCU6O"},"agent_actions":{"view_html":"https://pith.science/pith/RPCRCU6O2RZT2FVDMMRAU4K5XV","download_json":"https://pith.science/pith/RPCRCU6O2RZT2FVDMMRAU4K5XV.json","view_paper":"https://pith.science/paper/RPCRCU6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00893&json=true","fetch_graph":"https://pith.science/api/pith-number/RPCRCU6O2RZT2FVDMMRAU4K5XV/graph.json","fetch_events":"https://pith.science/api/pith-number/RPCRCU6O2RZT2FVDMMRAU4K5XV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPCRCU6O2RZT2FVDMMRAU4K5XV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPCRCU6O2RZT2FVDMMRAU4K5XV/action/storage_attestation","attest_author":"https://pith.science/pith/RPCRCU6O2RZT2FVDMMRAU4K5XV/action/author_attestation","sign_citation":"https://pith.science/pith/RPCRCU6O2RZT2FVDMMRAU4K5XV/action/citation_signature","submit_replication":"https://pith.science/pith/RPCRCU6O2RZT2FVDMMRAU4K5XV/action/replication_record"}},"created_at":"2026-06-02T01:04:08.984516+00:00","updated_at":"2026-06-02T01:04:08.984516+00:00"}