{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:FFBLHUMLXEVY6E7LVVTETKYUHL","short_pith_number":"pith:FFBLHUML","schema_version":"1.0","canonical_sha256":"2942b3d18bb92b8f13ebad6649ab143afccabd4dc2da18d6871fbce3e205342f","source":{"kind":"arxiv","id":"0801.0102","version":1},"attestation_state":"computed","paper":{"title":"Reserved-Length Prefix Coding","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2007-12-30T00:14:24Z","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"},"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":"0801.0102","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-12-30T00:14:24Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"d7a8100a3a42d8fd42d468e73cd8849ba75f7148df382b7825feb3a7f9aa568b","abstract_canon_sha256":"e322a9d108f4feb9cb0be0a58145ac7a186d132d54363c62bcb2ba4dc6ff219b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:06:33.487616Z","signature_b64":"YEHN7hLGvcnv7ppS7XNJFRK10zo2hiBuKlb2LgToARax6jVayvCzZIrpURdGFIaLMwYY0mIh7AT2k9TApKvoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2942b3d18bb92b8f13ebad6649ab143afccabd4dc2da18d6871fbce3e205342f","last_reissued_at":"2026-07-04T15:06:33.487218Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:06:33.487218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reserved-Length Prefix Coding","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2007-12-30T00:14:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.0102","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/0801.0102/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":"0801.0102","created_at":"2026-07-04T15:06:33.487280+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.0102v1","created_at":"2026-07-04T15:06:33.487280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.0102","created_at":"2026-07-04T15:06:33.487280+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFBLHUMLXEVY","created_at":"2026-07-04T15:06:33.487280+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFBLHUMLXEVY6E7L","created_at":"2026-07-04T15:06:33.487280+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFBLHUML","created_at":"2026-07-04T15:06:33.487280+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/FFBLHUMLXEVY6E7LVVTETKYUHL","json":"https://pith.science/pith/FFBLHUMLXEVY6E7LVVTETKYUHL.json","graph_json":"https://pith.science/api/pith-number/FFBLHUMLXEVY6E7LVVTETKYUHL/graph.json","events_json":"https://pith.science/api/pith-number/FFBLHUMLXEVY6E7LVVTETKYUHL/events.json","paper":"https://pith.science/paper/FFBLHUML"},"agent_actions":{"view_html":"https://pith.science/pith/FFBLHUMLXEVY6E7LVVTETKYUHL","download_json":"https://pith.science/pith/FFBLHUMLXEVY6E7LVVTETKYUHL.json","view_paper":"https://pith.science/paper/FFBLHUML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.0102&json=true","fetch_graph":"https://pith.science/api/pith-number/FFBLHUMLXEVY6E7LVVTETKYUHL/graph.json","fetch_events":"https://pith.science/api/pith-number/FFBLHUMLXEVY6E7LVVTETKYUHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFBLHUMLXEVY6E7LVVTETKYUHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFBLHUMLXEVY6E7LVVTETKYUHL/action/storage_attestation","attest_author":"https://pith.science/pith/FFBLHUMLXEVY6E7LVVTETKYUHL/action/author_attestation","sign_citation":"https://pith.science/pith/FFBLHUMLXEVY6E7LVVTETKYUHL/action/citation_signature","submit_replication":"https://pith.science/pith/FFBLHUMLXEVY6E7LVVTETKYUHL/action/replication_record"}},"created_at":"2026-07-04T15:06:33.487280+00:00","updated_at":"2026-07-04T15:06:33.487280+00:00"}