{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:BZAKWMTJKK7XCP6SZ4V63IT6OT","short_pith_number":"pith:BZAKWMTJ","schema_version":"1.0","canonical_sha256":"0e40ab326952bf713fd2cf2beda27e74eff8b29225fbb0ee51ceddfd46705ddf","source":{"kind":"arxiv","id":"cs/0602085","version":4},"attestation_state":"computed","paper":{"title":"Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2006-02-25T19:09:11Z","abstract_excerpt":"Efficient optimal prefix coding has long been accomplished via the Huffman algorithm. However, there is still room for improvement and exploration regarding variants of the Huffman problem. Length-limited Huffman coding, useful for many practical applications, is one such variant, for which codes are restricted to the set of codes in which none of the $n$ codewords is longer than a given length, $l_{\\max}$. Binary length-limited coding can be done in $O(n l_{\\max})$ time and O(n) space via the widely used Package-Merge algorithm and with even smaller asymptotic complexity using a lesser-known "},"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":"cs/0602085","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-02-25T19:09:11Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"8d9bd8f468fcf66b2aaf6141a7d0e69dd2684ac89810580488d25f6a34422d7a","abstract_canon_sha256":"0ae3af4a5eefcb0d5f93c8c9a593ebca646a01625f302e9cf490a7ed3df9d517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:51.259081Z","signature_b64":"pkgpXuo7I4A18jCAsXOdpGYFUUzoM8idpYwWt2zb/LWm+Hac/JSSVrmS0LOoQrJrdcklK0NbidHfv/een+/ZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e40ab326952bf713fd2cf2beda27e74eff8b29225fbb0ee51ceddfd46705ddf","last_reissued_at":"2026-07-04T15:02:51.258721Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:51.258721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding","license":"","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2006-02-25T19:09:11Z","abstract_excerpt":"Efficient optimal prefix coding has long been accomplished via the Huffman algorithm. However, there is still room for improvement and exploration regarding variants of the Huffman problem. Length-limited Huffman coding, useful for many practical applications, is one such variant, for which codes are restricted to the set of codes in which none of the $n$ codewords is longer than a given length, $l_{\\max}$. Binary length-limited coding can be done in $O(n l_{\\max})$ time and O(n) space via the widely used Package-Merge algorithm and with even smaller asymptotic complexity using a lesser-known "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602085","kind":"arxiv","version":4},"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/cs/0602085/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":"cs/0602085","created_at":"2026-07-04T15:02:51.258776+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0602085v4","created_at":"2026-07-04T15:02:51.258776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602085","created_at":"2026-07-04T15:02:51.258776+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZAKWMTJKK7X","created_at":"2026-07-04T15:02:51.258776+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZAKWMTJKK7XCP6S","created_at":"2026-07-04T15:02:51.258776+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZAKWMTJ","created_at":"2026-07-04T15:02:51.258776+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/BZAKWMTJKK7XCP6SZ4V63IT6OT","json":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT.json","graph_json":"https://pith.science/api/pith-number/BZAKWMTJKK7XCP6SZ4V63IT6OT/graph.json","events_json":"https://pith.science/api/pith-number/BZAKWMTJKK7XCP6SZ4V63IT6OT/events.json","paper":"https://pith.science/paper/BZAKWMTJ"},"agent_actions":{"view_html":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT","download_json":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT.json","view_paper":"https://pith.science/paper/BZAKWMTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0602085&json=true","fetch_graph":"https://pith.science/api/pith-number/BZAKWMTJKK7XCP6SZ4V63IT6OT/graph.json","fetch_events":"https://pith.science/api/pith-number/BZAKWMTJKK7XCP6SZ4V63IT6OT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/action/storage_attestation","attest_author":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/action/author_attestation","sign_citation":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/action/citation_signature","submit_replication":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/action/replication_record"}},"created_at":"2026-07-04T15:02:51.258776+00:00","updated_at":"2026-07-04T15:02:51.258776+00:00"}