{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:BZAKWMTJKK7XCP6SZ4V63IT6OT","short_pith_number":"pith:BZAKWMTJ","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"},"canonical_sha256":"0e40ab326952bf713fd2cf2beda27e74eff8b29225fbb0ee51ceddfd46705ddf","source":{"kind":"arxiv","id":"cs/0602085","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602085","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602085v4","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602085","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"BZAKWMTJKK7X","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"pith_short_16","alias_value":"BZAKWMTJKK7XCP6S","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"pith_short_8","alias_value":"BZAKWMTJ","created_at":"2026-07-04T15:02:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:BZAKWMTJKK7XCP6SZ4V63IT6OT","target":"record","payload":{"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"},"canonical_sha256":"0e40ab326952bf713fd2cf2beda27e74eff8b29225fbb0ee51ceddfd46705ddf","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"},"source_kind":"arxiv","source_id":"cs/0602085","source_version":4,"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-07-04T15:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0pIdBxbszab+4O+pUd5rXb5+MGG/hZAAD+6tq8JL6ft3NthkCkgJ0lFLPit6VYWFscOc/jE8UKvXCnshh/FBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:52:37.117345Z"},"content_sha256":"4a832ea2db173a9130104605b060ecd294ad0df693dc6946292a0596d9c41268","schema_version":"1.0","event_id":"sha256:4a832ea2db173a9130104605b060ecd294ad0df693dc6946292a0596d9c41268"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:BZAKWMTJKK7XCP6SZ4V63IT6OT","target":"graph","payload":{"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"},"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-07-04T15:02:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZaA4/KH/XkbBmz6GupMMY1Zr0tCuvUCgzikl0Iv3LVfWXoOATUJHd37GN4Yz2sIs8piK3qzmR/HrxfJBU9KADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:52:37.117723Z"},"content_sha256":"35232724a9cac8c3c64c2c44a7a413e4d71c70fc8c7d2ad1895cf1b51b9db20b","schema_version":"1.0","event_id":"sha256:35232724a9cac8c3c64c2c44a7a413e4d71c70fc8c7d2ad1895cf1b51b9db20b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/bundle.json","state_url":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/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-07-05T00:52:37Z","links":{"resolver":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT","bundle":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/bundle.json","state":"https://pith.science/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZAKWMTJKK7XCP6SZ4V63IT6OT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:BZAKWMTJKK7XCP6SZ4V63IT6OT","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":"0ae3af4a5eefcb0d5f93c8c9a593ebca646a01625f302e9cf490a7ed3df9d517","cross_cats_sorted":["cs.DS","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-02-25T19:09:11Z","title_canon_sha256":"8d9bd8f468fcf66b2aaf6141a7d0e69dd2684ac89810580488d25f6a34422d7a"},"schema_version":"1.0","source":{"id":"cs/0602085","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602085","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602085v4","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602085","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"pith_short_12","alias_value":"BZAKWMTJKK7X","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"pith_short_16","alias_value":"BZAKWMTJKK7XCP6S","created_at":"2026-07-04T15:02:51Z"},{"alias_kind":"pith_short_8","alias_value":"BZAKWMTJ","created_at":"2026-07-04T15:02:51Z"}],"graph_snapshots":[{"event_id":"sha256:35232724a9cac8c3c64c2c44a7a413e4d71c70fc8c7d2ad1895cf1b51b9db20b","target":"graph","created_at":"2026-07-04T15:02:51Z","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/cs/0602085/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Michael B. Baer","cross_cats":["cs.DS","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2006-02-25T19:09:11Z","title":"Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602085","kind":"arxiv","version":4},"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:4a832ea2db173a9130104605b060ecd294ad0df693dc6946292a0596d9c41268","target":"record","created_at":"2026-07-04T15:02:51Z","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":"0ae3af4a5eefcb0d5f93c8c9a593ebca646a01625f302e9cf490a7ed3df9d517","cross_cats_sorted":["cs.DS","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-02-25T19:09:11Z","title_canon_sha256":"8d9bd8f468fcf66b2aaf6141a7d0e69dd2684ac89810580488d25f6a34422d7a"},"schema_version":"1.0","source":{"id":"cs/0602085","kind":"arxiv","version":4}},"canonical_sha256":"0e40ab326952bf713fd2cf2beda27e74eff8b29225fbb0ee51ceddfd46705ddf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e40ab326952bf713fd2cf2beda27e74eff8b29225fbb0ee51ceddfd46705ddf","first_computed_at":"2026-07-04T15:02:51.258721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:51.258721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pkgpXuo7I4A18jCAsXOdpGYFUUzoM8idpYwWt2zb/LWm+Hac/JSSVrmS0LOoQrJrdcklK0NbidHfv/een+/ZCg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:51.259081Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0602085","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a832ea2db173a9130104605b060ecd294ad0df693dc6946292a0596d9c41268","sha256:35232724a9cac8c3c64c2c44a7a413e4d71c70fc8c7d2ad1895cf1b51b9db20b"],"state_sha256":"ce7e5d7c79be4b1eaf93e18397118b12f224083270536fd1f96f32da77933622"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buT2OWBxivg8dECYvcuihRnUCn04A96j0qbqlV5sVFbEZ4/pBDJGkEI+KnvjMIoeuJWbmMiW0KduZAoWW/SLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T00:52:37.119748Z","bundle_sha256":"5d3b777b436761d84d2965769e50ef8224d259163d713efb73e2643cbb7b0b6e"}}