{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:BAKHX4YBIBA4VHPEBD2PMMP3NF","short_pith_number":"pith:BAKHX4YB","canonical_record":{"source":{"id":"0809.1043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T15:06:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a4b6a4cd289c9dbb0be979e1ad098ebb432aa422cff5b79a52044028f41cd964","abstract_canon_sha256":"9c0d5df61902fbcc0029844aa11d3dfa46f2534e4501102aade25bfb4cae4a8e"},"schema_version":"1.0"},"canonical_sha256":"08147bf3014041ca9de408f4f631fb6972c5796dbbba6076cad863cbfb171bb6","source":{"kind":"arxiv","id":"0809.1043","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.1043","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0809.1043v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.1043","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"BAKHX4YBIBA4","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"BAKHX4YBIBA4VHPE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"BAKHX4YB","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:BAKHX4YBIBA4VHPEBD2PMMP3NF","target":"record","payload":{"canonical_record":{"source":{"id":"0809.1043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T15:06:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a4b6a4cd289c9dbb0be979e1ad098ebb432aa422cff5b79a52044028f41cd964","abstract_canon_sha256":"9c0d5df61902fbcc0029844aa11d3dfa46f2534e4501102aade25bfb4cae4a8e"},"schema_version":"1.0"},"canonical_sha256":"08147bf3014041ca9de408f4f631fb6972c5796dbbba6076cad863cbfb171bb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.387268Z","signature_b64":"eRa3nE6qxoE8OaV2mFIBJYxOvbFj2MzjLytWGSIyojO9144BEsTxWco8lU6P3mkn+5Z7oe9yzGcHSMnNysfEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08147bf3014041ca9de408f4f631fb6972c5796dbbba6076cad863cbfb171bb6","last_reissued_at":"2026-05-18T00:58:25.386518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.386518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0809.1043","source_version":1,"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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvkN8Af42GB+iTO3RFX7sNHpLWq8IYN0fiyQRaASScbfAIDEM8tmiZHhKgq8e26xpRlW1xWfAztP/chGR1K6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:00:18.366028Z"},"content_sha256":"e8a71154a3963dbd585740c24d97d04e0f7865520db65ca63f4308667c242e81","schema_version":"1.0","event_id":"sha256:e8a71154a3963dbd585740c24d97d04e0f7865520db65ca63f4308667c242e81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:BAKHX4YBIBA4VHPEBD2PMMP3NF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Unique Decodability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Dalai, Riccardo Leonardi","submitted_at":"2008-09-05T15:06:37Z","abstract_excerpt":"In this paper we propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete source X, every \"uniquely decodable\" block code satisfies E[l(X_1 X_2 ... X_n)]>= H(X_1,X_2,...,X_n), where X_1, X_2,...,X_n are the first n symbols of the source, E[l(X_1 X_2 ... X_n)] is the expected length of the code for those symbols and H(X_1,X_2,...,X_n) is their joint entropy. We show that, for certain sources with memory, the above inequality only holds when a limiting definition of \"uniquely decodable code\" is co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.1043","kind":"arxiv","version":1},"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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2XyhFLo4HFcYoLxIt76/xALX1Tb2x+9L9PNIwsQq2tPsky5bhMLu9XTbtAn0UdNGKxXgqYUyoRccvKAeq8YDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:00:18.366391Z"},"content_sha256":"b805dcfb0f5fb1ef78d4aca66ea0e115bd09aa053a1269a946e8020263ae83f7","schema_version":"1.0","event_id":"sha256:b805dcfb0f5fb1ef78d4aca66ea0e115bd09aa053a1269a946e8020263ae83f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/bundle.json","state_url":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/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-05T10:00:18Z","links":{"resolver":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF","bundle":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/bundle.json","state":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:BAKHX4YBIBA4VHPEBD2PMMP3NF","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":"9c0d5df61902fbcc0029844aa11d3dfa46f2534e4501102aade25bfb4cae4a8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T15:06:37Z","title_canon_sha256":"a4b6a4cd289c9dbb0be979e1ad098ebb432aa422cff5b79a52044028f41cd964"},"schema_version":"1.0","source":{"id":"0809.1043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.1043","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0809.1043v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.1043","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"BAKHX4YBIBA4","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"BAKHX4YBIBA4VHPE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"BAKHX4YB","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:b805dcfb0f5fb1ef78d4aca66ea0e115bd09aa053a1269a946e8020263ae83f7","target":"graph","created_at":"2026-05-18T00:58:25Z","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 propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete source X, every \"uniquely decodable\" block code satisfies E[l(X_1 X_2 ... X_n)]>= H(X_1,X_2,...,X_n), where X_1, X_2,...,X_n are the first n symbols of the source, E[l(X_1 X_2 ... X_n)] is the expected length of the code for those symbols and H(X_1,X_2,...,X_n) is their joint entropy. We show that, for certain sources with memory, the above inequality only holds when a limiting definition of \"uniquely decodable code\" is co","authors_text":"Marco Dalai, Riccardo Leonardi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T15:06:37Z","title":"On Unique Decodability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.1043","kind":"arxiv","version":1},"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:e8a71154a3963dbd585740c24d97d04e0f7865520db65ca63f4308667c242e81","target":"record","created_at":"2026-05-18T00:58:25Z","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":"9c0d5df61902fbcc0029844aa11d3dfa46f2534e4501102aade25bfb4cae4a8e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-09-05T15:06:37Z","title_canon_sha256":"a4b6a4cd289c9dbb0be979e1ad098ebb432aa422cff5b79a52044028f41cd964"},"schema_version":"1.0","source":{"id":"0809.1043","kind":"arxiv","version":1}},"canonical_sha256":"08147bf3014041ca9de408f4f631fb6972c5796dbbba6076cad863cbfb171bb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08147bf3014041ca9de408f4f631fb6972c5796dbbba6076cad863cbfb171bb6","first_computed_at":"2026-05-18T00:58:25.386518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.386518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eRa3nE6qxoE8OaV2mFIBJYxOvbFj2MzjLytWGSIyojO9144BEsTxWco8lU6P3mkn+5Z7oe9yzGcHSMnNysfEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.387268Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.1043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8a71154a3963dbd585740c24d97d04e0f7865520db65ca63f4308667c242e81","sha256:b805dcfb0f5fb1ef78d4aca66ea0e115bd09aa053a1269a946e8020263ae83f7"],"state_sha256":"6818bc7cad26f3db4e8aa0e52482957b80eae5607b705eb90dcdd4432cc1fe24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yexM3SjLePkbJWBKSFyViaZsUlSsKAoN1poIagt5lUmsEMLH013+AS2Ek7dwbUSOyY+TPcmLxoQQfuNtHiL6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:00:18.368362Z","bundle_sha256":"a6c19957e97e848ca1b89e9d64ab4307ec0e9191afed7814a1ecac06ce0f6008"}}