{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CNDQYCTOP4PQ4D4JXDDKJVTZBZ","short_pith_number":"pith:CNDQYCTO","schema_version":"1.0","canonical_sha256":"13470c0a6e7f1f0e0f89b8c6a4d6790e4311706ef2a72de63e13e45e96a656d6","source":{"kind":"arxiv","id":"2506.15844","version":1},"attestation_state":"computed","paper":{"title":"HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dongfang Zhao, Luanzheng Guo, Nathan Tallent, Tianyu Zhao","submitted_at":"2025-06-18T19:48:55Z","abstract_excerpt":"Hypergraphs provide a natural representation for many-to-many relationships in data-intensive applications, yet their scalability is often hindered by high memory consumption. While prior work has improved computational efficiency, reducing the space overhead of hypergraph representations remains a major challenge. This paper presents a hybrid compression framework for integer-based hypergraph adjacency formats, which adaptively combines Huffman encoding and bitwise encoding to exploit structural redundancy. We provide a theoretical analysis showing that an optimal encoding ratio exists betwee"},"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":"2506.15844","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-18T19:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"5b989a2608037d2852b67b53c4840fe1d9c80947e6b5254ea0e0acc68388860e","abstract_canon_sha256":"c708476a84a8de0f7eb4ef258a1dcfc1ba65b2c37fb164855ad121e891eb3573"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:53.384543Z","signature_b64":"NqcZ8+2V4p915WI8vCIFH9fi4RiPledGcpV2TA9xbY+WS9lIw6K5x41tUjLMM2+Aea1pw2xKCFzyOh8uo6wgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13470c0a6e7f1f0e0f89b8c6a4d6790e4311706ef2a72de63e13e45e96a656d6","last_reissued_at":"2026-07-05T11:23:53.384134Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:53.384134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dongfang Zhao, Luanzheng Guo, Nathan Tallent, Tianyu Zhao","submitted_at":"2025-06-18T19:48:55Z","abstract_excerpt":"Hypergraphs provide a natural representation for many-to-many relationships in data-intensive applications, yet their scalability is often hindered by high memory consumption. While prior work has improved computational efficiency, reducing the space overhead of hypergraph representations remains a major challenge. This paper presents a hybrid compression framework for integer-based hypergraph adjacency formats, which adaptively combines Huffman encoding and bitwise encoding to exploit structural redundancy. We provide a theoretical analysis showing that an optimal encoding ratio exists betwee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15844","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/2506.15844/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":"2506.15844","created_at":"2026-07-05T11:23:53.384184+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15844v1","created_at":"2026-07-05T11:23:53.384184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15844","created_at":"2026-07-05T11:23:53.384184+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNDQYCTOP4PQ","created_at":"2026-07-05T11:23:53.384184+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNDQYCTOP4PQ4D4J","created_at":"2026-07-05T11:23:53.384184+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNDQYCTO","created_at":"2026-07-05T11:23:53.384184+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/CNDQYCTOP4PQ4D4JXDDKJVTZBZ","json":"https://pith.science/pith/CNDQYCTOP4PQ4D4JXDDKJVTZBZ.json","graph_json":"https://pith.science/api/pith-number/CNDQYCTOP4PQ4D4JXDDKJVTZBZ/graph.json","events_json":"https://pith.science/api/pith-number/CNDQYCTOP4PQ4D4JXDDKJVTZBZ/events.json","paper":"https://pith.science/paper/CNDQYCTO"},"agent_actions":{"view_html":"https://pith.science/pith/CNDQYCTOP4PQ4D4JXDDKJVTZBZ","download_json":"https://pith.science/pith/CNDQYCTOP4PQ4D4JXDDKJVTZBZ.json","view_paper":"https://pith.science/paper/CNDQYCTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15844&json=true","fetch_graph":"https://pith.science/api/pith-number/CNDQYCTOP4PQ4D4JXDDKJVTZBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CNDQYCTOP4PQ4D4JXDDKJVTZBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNDQYCTOP4PQ4D4JXDDKJVTZBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNDQYCTOP4PQ4D4JXDDKJVTZBZ/action/storage_attestation","attest_author":"https://pith.science/pith/CNDQYCTOP4PQ4D4JXDDKJVTZBZ/action/author_attestation","sign_citation":"https://pith.science/pith/CNDQYCTOP4PQ4D4JXDDKJVTZBZ/action/citation_signature","submit_replication":"https://pith.science/pith/CNDQYCTOP4PQ4D4JXDDKJVTZBZ/action/replication_record"}},"created_at":"2026-07-05T11:23:53.384184+00:00","updated_at":"2026-07-05T11:23:53.384184+00:00"}