{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IZCGDWQN3SGFMG5CL5PWLDTCWX","short_pith_number":"pith:IZCGDWQN","schema_version":"1.0","canonical_sha256":"464461da0ddc8c561ba25f5f658e62b5c1f3cf19f76bdf3d82e5fb212fa29446","source":{"kind":"arxiv","id":"2606.18274","version":1},"attestation_state":"computed","paper":{"title":"HyDRA: Lossless Hypergraph Summarization via Co-Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Aris Anagnostopoulos, Francesco Bonchi, Giulia Preti","submitted_at":"2026-06-05T14:00:51Z","abstract_excerpt":"Hypergraphs are a powerful representation for higher-order interactions but their scale and complexity pose significant data management and analysis challenges. While summarization techniques are widely used to distill simple graphs, lossless summarization for hypergraphs remains unexplored. We introduce HyDRA, the first formal framework for lossless summarization of weighted hypergraphs. In our framework, a summary is a new weighted hypergraph composed of supernodes (groups of nodes) and superhyperedges (groups of hyperedges), paired with a correction table for exact reconstruction. By establ"},"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.18274","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2026-06-05T14:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"76fb9fc15bf9cb0ac0ff4c0c3e499125275115a05505d97e673cb1317b16c087","abstract_canon_sha256":"98bc5b3762aeb111485a0ca6012f0fc32a5c5f6ee57c3ae2dc884d85a3cc83a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:56.691943Z","signature_b64":"Kub5KuXmFRYc+7x7hL/hda054VhPtSUr/HsVCQp8ibm709vfCjBIyNuAZ9ZCi3UAz/t/JW0gUld8qmnk9u2OBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"464461da0ddc8c561ba25f5f658e62b5c1f3cf19f76bdf3d82e5fb212fa29446","last_reissued_at":"2026-06-19T16:10:56.691592Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:56.691592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HyDRA: Lossless Hypergraph Summarization via Co-Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Aris Anagnostopoulos, Francesco Bonchi, Giulia Preti","submitted_at":"2026-06-05T14:00:51Z","abstract_excerpt":"Hypergraphs are a powerful representation for higher-order interactions but their scale and complexity pose significant data management and analysis challenges. While summarization techniques are widely used to distill simple graphs, lossless summarization for hypergraphs remains unexplored. We introduce HyDRA, the first formal framework for lossless summarization of weighted hypergraphs. In our framework, a summary is a new weighted hypergraph composed of supernodes (groups of nodes) and superhyperedges (groups of hyperedges), paired with a correction table for exact reconstruction. By establ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18274","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.18274/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.18274","created_at":"2026-06-19T16:10:56.691650+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18274v1","created_at":"2026-06-19T16:10:56.691650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18274","created_at":"2026-06-19T16:10:56.691650+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZCGDWQN3SGF","created_at":"2026-06-19T16:10:56.691650+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZCGDWQN3SGFMG5C","created_at":"2026-06-19T16:10:56.691650+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZCGDWQN","created_at":"2026-06-19T16:10:56.691650+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/IZCGDWQN3SGFMG5CL5PWLDTCWX","json":"https://pith.science/pith/IZCGDWQN3SGFMG5CL5PWLDTCWX.json","graph_json":"https://pith.science/api/pith-number/IZCGDWQN3SGFMG5CL5PWLDTCWX/graph.json","events_json":"https://pith.science/api/pith-number/IZCGDWQN3SGFMG5CL5PWLDTCWX/events.json","paper":"https://pith.science/paper/IZCGDWQN"},"agent_actions":{"view_html":"https://pith.science/pith/IZCGDWQN3SGFMG5CL5PWLDTCWX","download_json":"https://pith.science/pith/IZCGDWQN3SGFMG5CL5PWLDTCWX.json","view_paper":"https://pith.science/paper/IZCGDWQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18274&json=true","fetch_graph":"https://pith.science/api/pith-number/IZCGDWQN3SGFMG5CL5PWLDTCWX/graph.json","fetch_events":"https://pith.science/api/pith-number/IZCGDWQN3SGFMG5CL5PWLDTCWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZCGDWQN3SGFMG5CL5PWLDTCWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZCGDWQN3SGFMG5CL5PWLDTCWX/action/storage_attestation","attest_author":"https://pith.science/pith/IZCGDWQN3SGFMG5CL5PWLDTCWX/action/author_attestation","sign_citation":"https://pith.science/pith/IZCGDWQN3SGFMG5CL5PWLDTCWX/action/citation_signature","submit_replication":"https://pith.science/pith/IZCGDWQN3SGFMG5CL5PWLDTCWX/action/replication_record"}},"created_at":"2026-06-19T16:10:56.691650+00:00","updated_at":"2026-06-19T16:10:56.691650+00:00"}