{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:FFBLHUMLXEVY6E7LVVTETKYUHL","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":"e322a9d108f4feb9cb0be0a58145ac7a186d132d54363c62bcb2ba4dc6ff219b","cross_cats_sorted":["cs.DS","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-12-30T00:14:24Z","title_canon_sha256":"d7a8100a3a42d8fd42d468e73cd8849ba75f7148df382b7825feb3a7f9aa568b"},"schema_version":"1.0","source":{"id":"0801.0102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0801.0102","created_at":"2026-07-04T15:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"0801.0102v1","created_at":"2026-07-04T15:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.0102","created_at":"2026-07-04T15:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"FFBLHUMLXEVY","created_at":"2026-07-04T15:06:33Z"},{"alias_kind":"pith_short_16","alias_value":"FFBLHUMLXEVY6E7L","created_at":"2026-07-04T15:06:33Z"},{"alias_kind":"pith_short_8","alias_value":"FFBLHUML","created_at":"2026-07-04T15:06:33Z"}],"graph_snapshots":[{"event_id":"sha256:882abb053348713cb931ea47a27d914c0b1d2a579c604eb6520edf4e95084350","target":"graph","created_at":"2026-07-04T15:06:33Z","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/0801.0102/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all codewords have lengths that lie in a user-specified set of lengths (or, equivalently, no codewords have lengths that lie in a complementary set). This paper introduces a polynomial-time dynamic programming algorithm that finds optimal codes for this reserved-length prefix coding problem. This has applications to quickly encoding and decoding lossless codes. In addition, one modification of the approach solves any quasia","authors_text":"Michael B. Baer","cross_cats":["cs.DS","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-12-30T00:14:24Z","title":"Reserved-Length Prefix Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.0102","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:a0b542db1aa5fc45f5da7292035264a9743cf9775f5ed80ec62cffb6df6b7b6d","target":"record","created_at":"2026-07-04T15:06:33Z","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":"e322a9d108f4feb9cb0be0a58145ac7a186d132d54363c62bcb2ba4dc6ff219b","cross_cats_sorted":["cs.DS","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-12-30T00:14:24Z","title_canon_sha256":"d7a8100a3a42d8fd42d468e73cd8849ba75f7148df382b7825feb3a7f9aa568b"},"schema_version":"1.0","source":{"id":"0801.0102","kind":"arxiv","version":1}},"canonical_sha256":"2942b3d18bb92b8f13ebad6649ab143afccabd4dc2da18d6871fbce3e205342f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2942b3d18bb92b8f13ebad6649ab143afccabd4dc2da18d6871fbce3e205342f","first_computed_at":"2026-07-04T15:06:33.487218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:06:33.487218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YEHN7hLGvcnv7ppS7XNJFRK10zo2hiBuKlb2LgToARax6jVayvCzZIrpURdGFIaLMwYY0mIh7AT2k9TApKvoAg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:06:33.487616Z","signed_message":"canonical_sha256_bytes"},"source_id":"0801.0102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0b542db1aa5fc45f5da7292035264a9743cf9775f5ed80ec62cffb6df6b7b6d","sha256:882abb053348713cb931ea47a27d914c0b1d2a579c604eb6520edf4e95084350"],"state_sha256":"b7c485e9824473027334c937e9b15bb27b78ea76cbd6e5339becc174b5ddb8a3"}