{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AYQSSZRLYXAL254ZWKXTF3S6WE","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":"c7241e7f48ddc84e90387d88adeeaff8fe24ef6acf165dd06c1c312e8d21f17b","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T17:36:32Z","title_canon_sha256":"8666bba2251ac5f776bf0f8143f70083c2fd8fd2685666b7ed341176ccb14a52"},"schema_version":"1.0","source":{"id":"1401.6410","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6410","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6410v1","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6410","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"AYQSSZRLYXAL","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AYQSSZRLYXAL254Z","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AYQSSZRL","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:b84131a0ac33facc2de209446fd84f302da17bc48b8d3335732d93a61869f063","target":"graph","created_at":"2026-05-18T03:01:12Z","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"},"paper":{"abstract_excerpt":"This article describes lossless compression algorithms for multisets of sequences, taking advantage of the multiset's unordered structure. Multisets are a generalisation of sets where members are allowed to occur multiple times. A multiset can be encoded na\\\"ively by simply storing its elements in some sequential order, but then information is wasted on the ordering. We propose a technique that transforms the multiset into an order-invariant tree representation, and derive an arithmetic code that optimally compresses the tree. Our method achieves compression even if the sequences in the multis","authors_text":"Christian Steinruecken","cross_cats":["math.IT","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T17:36:32Z","title":"Compressing Sets and Multisets of Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6410","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:2e8baa2b2091e2d313df3bc6a9c30d365dd582b19b9811ffb0515c586f46767a","target":"record","created_at":"2026-05-18T03:01:12Z","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":"c7241e7f48ddc84e90387d88adeeaff8fe24ef6acf165dd06c1c312e8d21f17b","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T17:36:32Z","title_canon_sha256":"8666bba2251ac5f776bf0f8143f70083c2fd8fd2685666b7ed341176ccb14a52"},"schema_version":"1.0","source":{"id":"1401.6410","kind":"arxiv","version":1}},"canonical_sha256":"062129662bc5c0bd7799b2af32ee5eb10eceee594fe450a02c08f1e0594c03f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"062129662bc5c0bd7799b2af32ee5eb10eceee594fe450a02c08f1e0594c03f4","first_computed_at":"2026-05-18T03:01:12.105754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:12.105754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LEGOIeSL46bxzl7hWqbYxD7j5VXocWGZbQdOWIJCyKSABOaETQz5v8bkUYFFu6UuZfoEm9UQTVXKOfVTzobnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:12.106565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6410","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e8baa2b2091e2d313df3bc6a9c30d365dd582b19b9811ffb0515c586f46767a","sha256:b84131a0ac33facc2de209446fd84f302da17bc48b8d3335732d93a61869f063"],"state_sha256":"f1fd685ada1df2405e745c5c0bc83cec823c6906af2fe125776c1a12d5d9020e"}