{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:BAKHX4YBIBA4VHPEBD2PMMP3NF","short_pith_number":"pith:BAKHX4YB","schema_version":"1.0","canonical_sha256":"08147bf3014041ca9de408f4f631fb6972c5796dbbba6076cad863cbfb171bb6","source":{"kind":"arxiv","id":"0809.1043","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0809.1043","created_at":"2026-05-18T00:58:25.386643+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.1043v1","created_at":"2026-05-18T00:58:25.386643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.1043","created_at":"2026-05-18T00:58:25.386643+00:00"},{"alias_kind":"pith_short_12","alias_value":"BAKHX4YBIBA4","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"BAKHX4YBIBA4VHPE","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"BAKHX4YB","created_at":"2026-05-18T12:25:56.245647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF","json":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF.json","graph_json":"https://pith.science/api/pith-number/BAKHX4YBIBA4VHPEBD2PMMP3NF/graph.json","events_json":"https://pith.science/api/pith-number/BAKHX4YBIBA4VHPEBD2PMMP3NF/events.json","paper":"https://pith.science/paper/BAKHX4YB"},"agent_actions":{"view_html":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF","download_json":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF.json","view_paper":"https://pith.science/paper/BAKHX4YB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.1043&json=true","fetch_graph":"https://pith.science/api/pith-number/BAKHX4YBIBA4VHPEBD2PMMP3NF/graph.json","fetch_events":"https://pith.science/api/pith-number/BAKHX4YBIBA4VHPEBD2PMMP3NF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/action/storage_attestation","attest_author":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/action/author_attestation","sign_citation":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/action/citation_signature","submit_replication":"https://pith.science/pith/BAKHX4YBIBA4VHPEBD2PMMP3NF/action/replication_record"}},"created_at":"2026-05-18T00:58:25.386643+00:00","updated_at":"2026-05-18T00:58:25.386643+00:00"}