{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:IJ7BIQDBHG4MA7HT7PAKMK7ZHD","short_pith_number":"pith:IJ7BIQDB","canonical_record":{"source":{"id":"cs/0508039","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2005-08-04T19:29:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a45a796fd711243c3cb62fab02095cd75ed8d5789d31e826d71ed01919ee07d","abstract_canon_sha256":"755aacfac592cfab82dd2656a86571cb043b71fcb0f93c175354f03676959ea1"},"schema_version":"1.0"},"canonical_sha256":"427e14406139b8c07cf3fbc0a62bf938f4f7126d3968bd656e7743409840f9f6","source":{"kind":"arxiv","id":"cs/0508039","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508039","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508039v3","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508039","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"IJ7BIQDBHG4M","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"IJ7BIQDBHG4MA7HT","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"IJ7BIQDB","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:IJ7BIQDBHG4MA7HT7PAKMK7ZHD","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0508039","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2005-08-04T19:29:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a45a796fd711243c3cb62fab02095cd75ed8d5789d31e826d71ed01919ee07d","abstract_canon_sha256":"755aacfac592cfab82dd2656a86571cb043b71fcb0f93c175354f03676959ea1"},"schema_version":"1.0"},"canonical_sha256":"427e14406139b8c07cf3fbc0a62bf938f4f7126d3968bd656e7743409840f9f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.770423Z","signature_b64":"s3VsDGFgNfnA00VOFjfe4JL5ll/yHeMn5bIWPuzUyafrzvSgy0jyzBITLtIG7h4GalWIcznHIpIBDGJv3cLsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"427e14406139b8c07cf3fbc0a62bf938f4f7126d3968bd656e7743409840f9f6","last_reissued_at":"2026-05-18T00:58:26.769851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.769851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0508039","source_version":3,"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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8RzCUfK1CAMH+33CunTNU9YxZhRjxB8DC8awGgVbqAC9z5ioIbRHNstvQD+uQ+jH5jDKjd5lVlb6fK3LjEYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:52:05.044721Z"},"content_sha256":"eee9bb128590b1d52c7d8b580e32138c6b170282167fa12d9d8df325ccb7d7a0","schema_version":"1.0","event_id":"sha256:eee9bb128590b1d52c7d8b580e32138c6b170282167fa12d9d8df325ccb7d7a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:IJ7BIQDBHG4MA7HT7PAKMK7ZHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Bounds on the Redundancy of Huffman Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Kakhbod, Payam Pakzad, Soheil Mohajer","submitted_at":"2005-08-04T19:29:18Z","abstract_excerpt":"In this paper we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman codes, which yields in a tight upper bound. We also derive a tight lower bound for the redundancy under the same assumption.\n  We further apply the method introduced in this paper to other related problems. It is shown that several other previously known bounds with different constraints follow immediately from our results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508039","kind":"arxiv","version":3},"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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ziisG/X+1/cFIqoOveppc1QC5SicZnI4QwT4rN9L528rOOQS6V4ki3zbkN50mQQ49ENR04V0We9zL4fMZ3IAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:52:05.045063Z"},"content_sha256":"28cbb4fb8ef968b7d81049d8faec3e9a5820809cf7b1c34ec1f0432547612740","schema_version":"1.0","event_id":"sha256:28cbb4fb8ef968b7d81049d8faec3e9a5820809cf7b1c34ec1f0432547612740"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJ7BIQDBHG4MA7HT7PAKMK7ZHD/bundle.json","state_url":"https://pith.science/pith/IJ7BIQDBHG4MA7HT7PAKMK7ZHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJ7BIQDBHG4MA7HT7PAKMK7ZHD/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-06-25T11:52:05Z","links":{"resolver":"https://pith.science/pith/IJ7BIQDBHG4MA7HT7PAKMK7ZHD","bundle":"https://pith.science/pith/IJ7BIQDBHG4MA7HT7PAKMK7ZHD/bundle.json","state":"https://pith.science/pith/IJ7BIQDBHG4MA7HT7PAKMK7ZHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJ7BIQDBHG4MA7HT7PAKMK7ZHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:IJ7BIQDBHG4MA7HT7PAKMK7ZHD","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":"755aacfac592cfab82dd2656a86571cb043b71fcb0f93c175354f03676959ea1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2005-08-04T19:29:18Z","title_canon_sha256":"7a45a796fd711243c3cb62fab02095cd75ed8d5789d31e826d71ed01919ee07d"},"schema_version":"1.0","source":{"id":"cs/0508039","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508039","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508039v3","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508039","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"IJ7BIQDBHG4M","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"IJ7BIQDBHG4MA7HT","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"IJ7BIQDB","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:28cbb4fb8ef968b7d81049d8faec3e9a5820809cf7b1c34ec1f0432547612740","target":"graph","created_at":"2026-05-18T00:58:26Z","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":"In this paper we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman codes, which yields in a tight upper bound. We also derive a tight lower bound for the redundancy under the same assumption.\n  We further apply the method introduced in this paper to other related problems. It is shown that several other previously known bounds with different constraints follow immediately from our results.","authors_text":"Ali Kakhbod, Payam Pakzad, Soheil Mohajer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2005-08-04T19:29:18Z","title":"Tight Bounds on the Redundancy of Huffman Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508039","kind":"arxiv","version":3},"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:eee9bb128590b1d52c7d8b580e32138c6b170282167fa12d9d8df325ccb7d7a0","target":"record","created_at":"2026-05-18T00:58:26Z","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":"755aacfac592cfab82dd2656a86571cb043b71fcb0f93c175354f03676959ea1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2005-08-04T19:29:18Z","title_canon_sha256":"7a45a796fd711243c3cb62fab02095cd75ed8d5789d31e826d71ed01919ee07d"},"schema_version":"1.0","source":{"id":"cs/0508039","kind":"arxiv","version":3}},"canonical_sha256":"427e14406139b8c07cf3fbc0a62bf938f4f7126d3968bd656e7743409840f9f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"427e14406139b8c07cf3fbc0a62bf938f4f7126d3968bd656e7743409840f9f6","first_computed_at":"2026-05-18T00:58:26.769851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.769851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s3VsDGFgNfnA00VOFjfe4JL5ll/yHeMn5bIWPuzUyafrzvSgy0jyzBITLtIG7h4GalWIcznHIpIBDGJv3cLsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.770423Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0508039","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eee9bb128590b1d52c7d8b580e32138c6b170282167fa12d9d8df325ccb7d7a0","sha256:28cbb4fb8ef968b7d81049d8faec3e9a5820809cf7b1c34ec1f0432547612740"],"state_sha256":"55c1120ce4c793610d8914669e10ec202e94b91cba18aeda1eafc8bce1ebced8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sw/c/TS+90Xh//CRXGcV5v8CbYaWiim7pLZ7yW4itRrn+HkkUeTVlmE7EbbsNW3ngB99h2VBRPTdRcn9J91UBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:52:05.047029Z","bundle_sha256":"80d2621f3a1049202774257a6510c15ec8eb0ab955bfdd10a5860c02eff8951a"}}