{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5Y6ECHIBFONBQQSFTKAIURWOBF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e6e84f4e740085a66cd0a9c1b839c3bdd95a231e0ae1a36fea932951f79ee71f","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-16T16:41:27Z","title_canon_sha256":"2440a5c7041e7381e4d331044faae91d68694b37c0ddf2a80dda7f5176a12b71"},"schema_version":"1.0","source":{"id":"2408.08837","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08837","created_at":"2026-07-05T08:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08837v1","created_at":"2026-07-05T08:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08837","created_at":"2026-07-05T08:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"5Y6ECHIBFONB","created_at":"2026-07-05T08:56:09Z"},{"alias_kind":"pith_short_16","alias_value":"5Y6ECHIBFONBQQSF","created_at":"2026-07-05T08:56:09Z"},{"alias_kind":"pith_short_8","alias_value":"5Y6ECHIB","created_at":"2026-07-05T08:56:09Z"}],"graph_snapshots":[{"event_id":"sha256:f5bc9de025a3df70f28919c13081e9c5d82813fa787c9412c6e1b0fd279de01c","target":"graph","created_at":"2026-07-05T08:56:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.08837/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present shuffle coding, a general method for optimal compression of sequences of unordered objects using bits-back coding. Data structures that can be compressed using shuffle coding include multisets, graphs, hypergraphs, and others. We release an implementation that can easily be adapted to different data types and statistical models, and demonstrate that our implementation achieves state-of-the-art compression rates on a range of graph datasets including molecular data.","authors_text":"Daniel Severo, Giulio Zani, James Townsend, Jan-Willem van de Meent, Julius Kunze","cross_cats":["cs.DS","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-16T16:41:27Z","title":"Entropy Coding of Unordered Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08837","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cda3c9161f507124abf38898676508ea620ce20918e0bf9d3342c4cb16b0b4e6","target":"record","created_at":"2026-07-05T08:56:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e6e84f4e740085a66cd0a9c1b839c3bdd95a231e0ae1a36fea932951f79ee71f","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-16T16:41:27Z","title_canon_sha256":"2440a5c7041e7381e4d331044faae91d68694b37c0ddf2a80dda7f5176a12b71"},"schema_version":"1.0","source":{"id":"2408.08837","kind":"arxiv","version":1}},"canonical_sha256":"ee3c411d012b9a1842459a808a46ce09501dbf65bb2df0c5a315e10c9d2fa43d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee3c411d012b9a1842459a808a46ce09501dbf65bb2df0c5a315e10c9d2fa43d","first_computed_at":"2026-07-05T08:56:09.457679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:56:09.457679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zXehgP8l5bgrSpeKCVfCXePi9vR5ePGNeBQownJiR84/rDOgVWaD3qDab3QJtImbgm1wnZj9pqG2pkdkgmbmCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:56:09.458118Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.08837","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cda3c9161f507124abf38898676508ea620ce20918e0bf9d3342c4cb16b0b4e6","sha256:f5bc9de025a3df70f28919c13081e9c5d82813fa787c9412c6e1b0fd279de01c"],"state_sha256":"ccba93ba330bd72dd10b95f74fc96318efbb4246b4a83537a0ac02d70fccb501"}