{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HPJUADJ2AWTT2CISLBWR2H3Q6V","short_pith_number":"pith:HPJUADJ2","canonical_record":{"source":{"id":"1410.3438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-13T19:02:40Z","cross_cats_sorted":[],"title_canon_sha256":"42d84e27010b1f03ae37e3cd569b63986fb598a88485deeaf2f36029b25ae919","abstract_canon_sha256":"4467f7bf6264a75ac1cd499ebfcbab1581842069e7605f4be9817d6af9ccc2c8"},"schema_version":"1.0"},"canonical_sha256":"3bd3400d3a05a73d0912586d1d1f70f556abbe80a4e37dddd195f4ed528b94b3","source":{"kind":"arxiv","id":"1410.3438","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3438","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3438v2","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3438","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"HPJUADJ2AWTT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HPJUADJ2AWTT2CIS","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HPJUADJ2","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HPJUADJ2AWTT2CISLBWR2H3Q6V","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-13T19:02:40Z","cross_cats_sorted":[],"title_canon_sha256":"42d84e27010b1f03ae37e3cd569b63986fb598a88485deeaf2f36029b25ae919","abstract_canon_sha256":"4467f7bf6264a75ac1cd499ebfcbab1581842069e7605f4be9817d6af9ccc2c8"},"schema_version":"1.0"},"canonical_sha256":"3bd3400d3a05a73d0912586d1d1f70f556abbe80a4e37dddd195f4ed528b94b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:44.691460Z","signature_b64":"6deGKPgI190C+JMUr/NOBuBq4urhiGEGtXVNegRXWKILMsD2iT2GDJRi8DtFZubcCJnrsyKaXE7dSRgy48AqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bd3400d3a05a73d0912586d1d1f70f556abbe80a4e37dddd195f4ed528b94b3","last_reissued_at":"2026-05-18T01:37:44.690744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:44.690744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3438","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dY0ba2+OWhaRvrBKtcYGdzSSQpH2CKzlgdHeOY1FclB36Sud3fuNqkDsu7SkZC4p/gB3grREuzGN7YP8LtfGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:12:40.540326Z"},"content_sha256":"3930cf6cbdd8387ef706b1af98c933d17db066f4bfb911e6784b42eb54aa7c8d","schema_version":"1.0","event_id":"sha256:3930cf6cbdd8387ef706b1af98c933d17db066f4bfb911e6784b42eb54aa7c8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HPJUADJ2AWTT2CISLBWR2H3Q6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Compact Representations of Prefix Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alberto Ord\\'o\\~nez, Gonzalo Navarro, Travis Gagie, Yakov Nekrich","submitted_at":"2014-10-13T19:02:40Z","abstract_excerpt":"Most of the attention in statistical compression is given to the space used by the compressed sequence, a problem completely solved with optimal prefix codes. However, in many applications, the storage space used to represent the prefix code itself can be an issue. In this paper we introduce and compare several techniques to store prefix codes. Let $N$ be the sequence length and $n$ be the alphabet size. Then a naive storage of an optimal prefix code uses $O(n\\log n)$ bits. Our first technique shows how to use $O(n\\log\\log(N/n))$ bits to store the optimal prefix code. Then we introduce an appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3438","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BenvJrJVparwmeAJdJVQHIEmfDGVv5pOD/vvO5vsqw1N/OECM6oQR+wS7zEizShDyYn1OFwrz1cXBLvCRwFUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:12:40.540974Z"},"content_sha256":"5661d4905ff95c338aea893ccf4deab27109ead6e3723954a9638447fc00570d","schema_version":"1.0","event_id":"sha256:5661d4905ff95c338aea893ccf4deab27109ead6e3723954a9638447fc00570d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPJUADJ2AWTT2CISLBWR2H3Q6V/bundle.json","state_url":"https://pith.science/pith/HPJUADJ2AWTT2CISLBWR2H3Q6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPJUADJ2AWTT2CISLBWR2H3Q6V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T01:12:40Z","links":{"resolver":"https://pith.science/pith/HPJUADJ2AWTT2CISLBWR2H3Q6V","bundle":"https://pith.science/pith/HPJUADJ2AWTT2CISLBWR2H3Q6V/bundle.json","state":"https://pith.science/pith/HPJUADJ2AWTT2CISLBWR2H3Q6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPJUADJ2AWTT2CISLBWR2H3Q6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HPJUADJ2AWTT2CISLBWR2H3Q6V","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":"4467f7bf6264a75ac1cd499ebfcbab1581842069e7605f4be9817d6af9ccc2c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-13T19:02:40Z","title_canon_sha256":"42d84e27010b1f03ae37e3cd569b63986fb598a88485deeaf2f36029b25ae919"},"schema_version":"1.0","source":{"id":"1410.3438","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3438","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3438v2","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3438","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"HPJUADJ2AWTT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HPJUADJ2AWTT2CIS","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HPJUADJ2","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:5661d4905ff95c338aea893ccf4deab27109ead6e3723954a9638447fc00570d","target":"graph","created_at":"2026-05-18T01:37:44Z","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":"Most of the attention in statistical compression is given to the space used by the compressed sequence, a problem completely solved with optimal prefix codes. However, in many applications, the storage space used to represent the prefix code itself can be an issue. In this paper we introduce and compare several techniques to store prefix codes. Let $N$ be the sequence length and $n$ be the alphabet size. Then a naive storage of an optimal prefix code uses $O(n\\log n)$ bits. Our first technique shows how to use $O(n\\log\\log(N/n))$ bits to store the optimal prefix code. Then we introduce an appr","authors_text":"Alberto Ord\\'o\\~nez, Gonzalo Navarro, Travis Gagie, Yakov Nekrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-13T19:02:40Z","title":"Efficient and Compact Representations of Prefix Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3438","kind":"arxiv","version":2},"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:3930cf6cbdd8387ef706b1af98c933d17db066f4bfb911e6784b42eb54aa7c8d","target":"record","created_at":"2026-05-18T01:37:44Z","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":"4467f7bf6264a75ac1cd499ebfcbab1581842069e7605f4be9817d6af9ccc2c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-13T19:02:40Z","title_canon_sha256":"42d84e27010b1f03ae37e3cd569b63986fb598a88485deeaf2f36029b25ae919"},"schema_version":"1.0","source":{"id":"1410.3438","kind":"arxiv","version":2}},"canonical_sha256":"3bd3400d3a05a73d0912586d1d1f70f556abbe80a4e37dddd195f4ed528b94b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bd3400d3a05a73d0912586d1d1f70f556abbe80a4e37dddd195f4ed528b94b3","first_computed_at":"2026-05-18T01:37:44.690744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:44.690744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6deGKPgI190C+JMUr/NOBuBq4urhiGEGtXVNegRXWKILMsD2iT2GDJRi8DtFZubcCJnrsyKaXE7dSRgy48AqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:44.691460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3438","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3930cf6cbdd8387ef706b1af98c933d17db066f4bfb911e6784b42eb54aa7c8d","sha256:5661d4905ff95c338aea893ccf4deab27109ead6e3723954a9638447fc00570d"],"state_sha256":"69f103a2e580804002dc44f0573bdf3dd810efc194c92d9f91f662222931e4be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xxd2kkasC5sgo5XslOgHefXbhS6NoBqrFNtd2S0Uci3swD1FYENc7XJKC1FVjOO/ZZbIITkSTBb7/6cL8RTqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:12:40.543533Z","bundle_sha256":"0d3c9e8a5a8874c80a80fc848dd5b4e331bfacf5b2675cdda841730165c19f5c"}}