{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:KD65UWXQKKMTPV64LRB6FWLBVP","short_pith_number":"pith:KD65UWXQ","canonical_record":{"source":{"id":"cs/0702059","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-02-10T03:31:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc7cf5eac7a569608d4a05e7225b31b7c5a3af0f3f26b7f88a955914a07a4621","abstract_canon_sha256":"6b23fc43302791c776d4108a1cdd98e3d75c3d9b04119653e840c129b17d3263"},"schema_version":"1.0"},"canonical_sha256":"50fdda5af0529937d7dc5c43e2d961abec1c104590e7d37585d666055df3f2d4","source":{"kind":"arxiv","id":"cs/0702059","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702059","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702059v3","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702059","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"KD65UWXQKKMT","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"KD65UWXQKKMTPV64","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"KD65UWXQ","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:KD65UWXQKKMTPV64LRB6FWLBVP","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0702059","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-02-10T03:31:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc7cf5eac7a569608d4a05e7225b31b7c5a3af0f3f26b7f88a955914a07a4621","abstract_canon_sha256":"6b23fc43302791c776d4108a1cdd98e3d75c3d9b04119653e840c129b17d3263"},"schema_version":"1.0"},"canonical_sha256":"50fdda5af0529937d7dc5c43e2d961abec1c104590e7d37585d666055df3f2d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:40.878870Z","signature_b64":"fNgE6CBif5gVtjmFkwtshfdhEAgWCvMa99UijdUqxqYR4mcnYhavlL3B1R47te7iH/eCkZ8p0KV2nbyI9s5CAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50fdda5af0529937d7dc5c43e2d961abec1c104590e7d37585d666055df3f2d4","last_reissued_at":"2026-05-18T04:39:40.878364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:40.878364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0702059","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-18T04:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5rE6E+j2Y0v/l79ta4RAvLH1PcvujVL+rc23UZK4HOtL5aIqZYR/94uABjZDUyoKqwk6/wqwfRHKcaiHWCiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:15:17.906279Z"},"content_sha256":"ddef57e97034f3dfd3763f9d3e0351dfae3d48bc50c3f3e981915c064ce4e559","schema_version":"1.0","event_id":"sha256:ddef57e97034f3dfd3763f9d3e0351dfae3d48bc50c3f3e981915c064ce4e559"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:KD65UWXQKKMTPV64LRB6FWLBVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Redundancy-Related Bounds on Generalized Huffman Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michael B. Baer","submitted_at":"2007-02-10T03:31:42Z","abstract_excerpt":"This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for minimum average redundancy coding - Huffman coding - these are in terms of a form of entropy and/or the probability of an input symbol, often the most probable one. The bounds here, some of which are tight, improve on known bounds of the form L in [H,H+1), where H is some form of entropy in bits (or, in the case of redundancy objectives, 0) and L is the length ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702059","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-18T04:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RB9Hdnib2UgaoGM1jTyGihifOjDKuHkepgm8RE8EALKbU9aKUf+9jpC7+cCjxjdRgI1XeFhbeHJZF0owfGRfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:15:17.906642Z"},"content_sha256":"2b3033aa6180b95a7397a2afc264917d0c7b9c4f54354d5a54b155301300cd49","schema_version":"1.0","event_id":"sha256:2b3033aa6180b95a7397a2afc264917d0c7b9c4f54354d5a54b155301300cd49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KD65UWXQKKMTPV64LRB6FWLBVP/bundle.json","state_url":"https://pith.science/pith/KD65UWXQKKMTPV64LRB6FWLBVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KD65UWXQKKMTPV64LRB6FWLBVP/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-04T23:15:17Z","links":{"resolver":"https://pith.science/pith/KD65UWXQKKMTPV64LRB6FWLBVP","bundle":"https://pith.science/pith/KD65UWXQKKMTPV64LRB6FWLBVP/bundle.json","state":"https://pith.science/pith/KD65UWXQKKMTPV64LRB6FWLBVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KD65UWXQKKMTPV64LRB6FWLBVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:KD65UWXQKKMTPV64LRB6FWLBVP","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":"6b23fc43302791c776d4108a1cdd98e3d75c3d9b04119653e840c129b17d3263","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-02-10T03:31:42Z","title_canon_sha256":"bc7cf5eac7a569608d4a05e7225b31b7c5a3af0f3f26b7f88a955914a07a4621"},"schema_version":"1.0","source":{"id":"cs/0702059","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0702059","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0702059v3","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0702059","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"KD65UWXQKKMT","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"KD65UWXQKKMTPV64","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"KD65UWXQ","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:2b3033aa6180b95a7397a2afc264917d0c7b9c4f54354d5a54b155301300cd49","target":"graph","created_at":"2026-05-18T04:39:40Z","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":"This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for minimum average redundancy coding - Huffman coding - these are in terms of a form of entropy and/or the probability of an input symbol, often the most probable one. The bounds here, some of which are tight, improve on known bounds of the form L in [H,H+1), where H is some form of entropy in bits (or, in the case of redundancy objectives, 0) and L is the length ob","authors_text":"Michael B. Baer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-02-10T03:31:42Z","title":"Redundancy-Related Bounds on Generalized Huffman Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0702059","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:ddef57e97034f3dfd3763f9d3e0351dfae3d48bc50c3f3e981915c064ce4e559","target":"record","created_at":"2026-05-18T04:39:40Z","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":"6b23fc43302791c776d4108a1cdd98e3d75c3d9b04119653e840c129b17d3263","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-02-10T03:31:42Z","title_canon_sha256":"bc7cf5eac7a569608d4a05e7225b31b7c5a3af0f3f26b7f88a955914a07a4621"},"schema_version":"1.0","source":{"id":"cs/0702059","kind":"arxiv","version":3}},"canonical_sha256":"50fdda5af0529937d7dc5c43e2d961abec1c104590e7d37585d666055df3f2d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50fdda5af0529937d7dc5c43e2d961abec1c104590e7d37585d666055df3f2d4","first_computed_at":"2026-05-18T04:39:40.878364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:40.878364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fNgE6CBif5gVtjmFkwtshfdhEAgWCvMa99UijdUqxqYR4mcnYhavlL3B1R47te7iH/eCkZ8p0KV2nbyI9s5CAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:40.878870Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0702059","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddef57e97034f3dfd3763f9d3e0351dfae3d48bc50c3f3e981915c064ce4e559","sha256:2b3033aa6180b95a7397a2afc264917d0c7b9c4f54354d5a54b155301300cd49"],"state_sha256":"835156202ce992e7eba4ddea9583aac3f177cff8841b08a349018cab0de5ef24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PzFjjnlespLvtUiXL+ZpTCmUNZc/NkCi8sJSKLc1IHEX5kGM42Yf3D7NENJFzxm7GgtUdNhtVDNYvh31hHFhAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T23:15:17.908680Z","bundle_sha256":"e051ba89421d230af80e3741ede39b1023ca585820213fff2ef2f9e553334de3"}}