{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:26RHSQVYIZ6F6FSMBKOAZC6XLS","short_pith_number":"pith:26RHSQVY","schema_version":"1.0","canonical_sha256":"d7a27942b8467c5f164c0a9c0c8bd75c9df16d6af4f76b1e77055cdc91b1b53b","source":{"kind":"arxiv","id":"1412.4444","version":1},"attestation_state":"computed","paper":{"title":"Asymptotics and Non-asymptotics for Universal Fixed-to-Variable Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lalitha Sankar, Oliver Kosut","submitted_at":"2014-12-15T01:43:36Z","abstract_excerpt":"Universal fixed-to-variable lossless source coding for memoryless sources is studied in the finite blocklength and higher-order asymptotics regimes. Optimal third-order coding rates are derived for general fixed-to-variable codes and for prefix codes. It is shown that the non-prefix Type Size code, in which codeword lengths are chosen in ascending order of type class size, achieves the optimal third-order rate and outperforms classical Two-Stage codes. Converse results are proved making use of a result on the distribution of the empirical entropy and Laplace's approximation. Finally, the fixed"},"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":"1412.4444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-15T01:43:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"035446bfc05363bfc3a36566381321be496554c255b811e9d93a1f6658154b0d","abstract_canon_sha256":"3d1612a93441c8901682f68bc9413813fa2b3f949203d225e3382c65be50c7e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:19.183963Z","signature_b64":"cv/X7g/8jWQ2GrlSQnqLtSEhH+4rg5ErhhpgQw1/WFB0GJEG9aUg+my3+TzYuv+W2CSmSgVtoF6JpP7rVfvBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7a27942b8467c5f164c0a9c0c8bd75c9df16d6af4f76b1e77055cdc91b1b53b","last_reissued_at":"2026-05-18T02:31:19.183430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:19.183430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotics and Non-asymptotics for Universal Fixed-to-Variable Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lalitha Sankar, Oliver Kosut","submitted_at":"2014-12-15T01:43:36Z","abstract_excerpt":"Universal fixed-to-variable lossless source coding for memoryless sources is studied in the finite blocklength and higher-order asymptotics regimes. Optimal third-order coding rates are derived for general fixed-to-variable codes and for prefix codes. It is shown that the non-prefix Type Size code, in which codeword lengths are chosen in ascending order of type class size, achieves the optimal third-order rate and outperforms classical Two-Stage codes. Converse results are proved making use of a result on the distribution of the empirical entropy and Laplace's approximation. Finally, the fixed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4444","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":"1412.4444","created_at":"2026-05-18T02:31:19.183519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4444v1","created_at":"2026-05-18T02:31:19.183519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4444","created_at":"2026-05-18T02:31:19.183519+00:00"},{"alias_kind":"pith_short_12","alias_value":"26RHSQVYIZ6F","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"26RHSQVYIZ6F6FSM","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"26RHSQVY","created_at":"2026-05-18T12:28:09.283467+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/26RHSQVYIZ6F6FSMBKOAZC6XLS","json":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS.json","graph_json":"https://pith.science/api/pith-number/26RHSQVYIZ6F6FSMBKOAZC6XLS/graph.json","events_json":"https://pith.science/api/pith-number/26RHSQVYIZ6F6FSMBKOAZC6XLS/events.json","paper":"https://pith.science/paper/26RHSQVY"},"agent_actions":{"view_html":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS","download_json":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS.json","view_paper":"https://pith.science/paper/26RHSQVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4444&json=true","fetch_graph":"https://pith.science/api/pith-number/26RHSQVYIZ6F6FSMBKOAZC6XLS/graph.json","fetch_events":"https://pith.science/api/pith-number/26RHSQVYIZ6F6FSMBKOAZC6XLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/action/storage_attestation","attest_author":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/action/author_attestation","sign_citation":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/action/citation_signature","submit_replication":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/action/replication_record"}},"created_at":"2026-05-18T02:31:19.183519+00:00","updated_at":"2026-05-18T02:31:19.183519+00:00"}