{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RQXLZVICWQ7XPMH6XENYGBJ43H","short_pith_number":"pith:RQXLZVIC","canonical_record":{"source":{"id":"1102.2678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T05:51:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9d9eb1e841174acedab0ea55c2c003a10f6c028c9e2d0e93d88ecb1142f3e241","abstract_canon_sha256":"7263ab9249204381b971bce525910f574b13c5fa70af44a914bf552f8a9593b7"},"schema_version":"1.0"},"canonical_sha256":"8c2ebcd502b43f77b0feb91b83053cd9cf4669bc9bf311bbb7570a05523d6d8e","source":{"kind":"arxiv","id":"1102.2678","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2678","created_at":"2026-05-18T04:23:12Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2678v2","created_at":"2026-05-18T04:23:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2678","created_at":"2026-05-18T04:23:12Z"},{"alias_kind":"pith_short_12","alias_value":"RQXLZVICWQ7X","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQXLZVICWQ7XPMH6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQXLZVIC","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RQXLZVICWQ7XPMH6XENYGBJ43H","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T05:51:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9d9eb1e841174acedab0ea55c2c003a10f6c028c9e2d0e93d88ecb1142f3e241","abstract_canon_sha256":"7263ab9249204381b971bce525910f574b13c5fa70af44a914bf552f8a9593b7"},"schema_version":"1.0"},"canonical_sha256":"8c2ebcd502b43f77b0feb91b83053cd9cf4669bc9bf311bbb7570a05523d6d8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:12.846554Z","signature_b64":"rcI90dM07ZlqdT5MAASypGzlLLE8dDN3iZbWWjBEJUdpbNmsJUuDEwjeyd/O/U3eaQ+LIOP2Jzlom5e2lHgFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c2ebcd502b43f77b0feb91b83053cd9cf4669bc9bf311bbb7570a05523d6d8e","last_reissued_at":"2026-05-18T04:23:12.845729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:12.845729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2678","source_version":2,"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:23:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWO1evT9e/9sTMmFE3xkbmXfVShl2I6/KZe/3PHqbiYNicMiRgMe8/mp1mZeG6UCZMiGCZW4q15AHCPL2ZN0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T02:10:53.068053Z"},"content_sha256":"9191e9ae2ee2ddc1a79a0632b088f0ddc211e98cf05a07accdcb1ff070243b1b","schema_version":"1.0","event_id":"sha256:9191e9ae2ee2ddc1a79a0632b088f0ddc211e98cf05a07accdcb1ff070243b1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RQXLZVICWQ7XPMH6XENYGBJ43H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Redundancy Coding for Uncertain Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Farzad Rezaei, Michael B. Baer","submitted_at":"2011-02-14T05:51:52Z","abstract_excerpt":"Consider the set of source distributions within a fixed maximum relative entropy with respect to a given nominal distribution. Lossless source coding over this relative entropy ball can be approached in more than one way. A problem previously considered is finding a minimax average length source code. The minimizing players are the codeword lengths --- real numbers for arithmetic codes, integers for prefix codes --- while the maximizing players are the uncertain source distributions. Another traditional minimizing objective is the first one considered here, maximum (average) redundancy. This p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2678","kind":"arxiv","version":2},"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:23:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Egwe2gMqXxnbIB1vW8ra3do33lUctXYh0VbPTDDoCEuHnN2XIoC4ylJHIP23m6Hyk5mNRHFPviTEoV2P5JqgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T02:10:53.068540Z"},"content_sha256":"76630e495694404d2ab85834b55998e77c359ece8ab559174ccbe7f2fc30f2d1","schema_version":"1.0","event_id":"sha256:76630e495694404d2ab85834b55998e77c359ece8ab559174ccbe7f2fc30f2d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQXLZVICWQ7XPMH6XENYGBJ43H/bundle.json","state_url":"https://pith.science/pith/RQXLZVICWQ7XPMH6XENYGBJ43H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQXLZVICWQ7XPMH6XENYGBJ43H/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-28T02:10:53Z","links":{"resolver":"https://pith.science/pith/RQXLZVICWQ7XPMH6XENYGBJ43H","bundle":"https://pith.science/pith/RQXLZVICWQ7XPMH6XENYGBJ43H/bundle.json","state":"https://pith.science/pith/RQXLZVICWQ7XPMH6XENYGBJ43H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQXLZVICWQ7XPMH6XENYGBJ43H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RQXLZVICWQ7XPMH6XENYGBJ43H","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":"7263ab9249204381b971bce525910f574b13c5fa70af44a914bf552f8a9593b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T05:51:52Z","title_canon_sha256":"9d9eb1e841174acedab0ea55c2c003a10f6c028c9e2d0e93d88ecb1142f3e241"},"schema_version":"1.0","source":{"id":"1102.2678","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2678","created_at":"2026-05-18T04:23:12Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2678v2","created_at":"2026-05-18T04:23:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2678","created_at":"2026-05-18T04:23:12Z"},{"alias_kind":"pith_short_12","alias_value":"RQXLZVICWQ7X","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQXLZVICWQ7XPMH6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQXLZVIC","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:76630e495694404d2ab85834b55998e77c359ece8ab559174ccbe7f2fc30f2d1","target":"graph","created_at":"2026-05-18T04:23:12Z","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":"Consider the set of source distributions within a fixed maximum relative entropy with respect to a given nominal distribution. Lossless source coding over this relative entropy ball can be approached in more than one way. A problem previously considered is finding a minimax average length source code. The minimizing players are the codeword lengths --- real numbers for arithmetic codes, integers for prefix codes --- while the maximizing players are the uncertain source distributions. Another traditional minimizing objective is the first one considered here, maximum (average) redundancy. This p","authors_text":"Charalambos D. Charalambous, Farzad Rezaei, Michael B. Baer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T05:51:52Z","title":"Minimum Redundancy Coding for Uncertain Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2678","kind":"arxiv","version":2},"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:9191e9ae2ee2ddc1a79a0632b088f0ddc211e98cf05a07accdcb1ff070243b1b","target":"record","created_at":"2026-05-18T04:23:12Z","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":"7263ab9249204381b971bce525910f574b13c5fa70af44a914bf552f8a9593b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T05:51:52Z","title_canon_sha256":"9d9eb1e841174acedab0ea55c2c003a10f6c028c9e2d0e93d88ecb1142f3e241"},"schema_version":"1.0","source":{"id":"1102.2678","kind":"arxiv","version":2}},"canonical_sha256":"8c2ebcd502b43f77b0feb91b83053cd9cf4669bc9bf311bbb7570a05523d6d8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c2ebcd502b43f77b0feb91b83053cd9cf4669bc9bf311bbb7570a05523d6d8e","first_computed_at":"2026-05-18T04:23:12.845729Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:12.845729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rcI90dM07ZlqdT5MAASypGzlLLE8dDN3iZbWWjBEJUdpbNmsJUuDEwjeyd/O/U3eaQ+LIOP2Jzlom5e2lHgFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:12.846554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2678","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9191e9ae2ee2ddc1a79a0632b088f0ddc211e98cf05a07accdcb1ff070243b1b","sha256:76630e495694404d2ab85834b55998e77c359ece8ab559174ccbe7f2fc30f2d1"],"state_sha256":"a37f926fe89aed12f1b46b35e26ef2b2c04028e296ae9080ad004e8ae6dab195"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqZ2ofSkJyQDPmGeeexNsjpinLrVwLb2EFeoIoKgqe18QxBuue7Dsn9kb3mfU/LkWapk7buXhJG/MGw16d/ICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T02:10:53.070701Z","bundle_sha256":"dfa5e51136926bd13033af396cf75a68241924fc9ab5ec6b1034c2cf6be7fab4"}}