{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:26RHSQVYIZ6F6FSMBKOAZC6XLS","short_pith_number":"pith:26RHSQVY","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"},"canonical_sha256":"d7a27942b8467c5f164c0a9c0c8bd75c9df16d6af4f76b1e77055cdc91b1b53b","source":{"kind":"arxiv","id":"1412.4444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4444","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4444v1","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4444","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"26RHSQVYIZ6F","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"26RHSQVYIZ6F6FSM","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"26RHSQVY","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:26RHSQVYIZ6F6FSMBKOAZC6XLS","target":"record","payload":{"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"},"canonical_sha256":"d7a27942b8467c5f164c0a9c0c8bd75c9df16d6af4f76b1e77055cdc91b1b53b","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"},"source_kind":"arxiv","source_id":"1412.4444","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-18T02:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agRbFwMkkQ4cMOtLOVfdedm787BjFdl6atKOBOKab05YL0/L8mKamZ9NQzkEekR74x0BZPzZysgIHb+JBrDpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:13.445193Z"},"content_sha256":"0f3cd78fd0239f5a88481b11be90e060e20690228b045f652cdebb5578f709a2","schema_version":"1.0","event_id":"sha256:0f3cd78fd0239f5a88481b11be90e060e20690228b045f652cdebb5578f709a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:26RHSQVYIZ6F6FSMBKOAZC6XLS","target":"graph","payload":{"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"},"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-18T02:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m0v7thMps/Cr7Vftt31Aphv3avX3OdElKJyzrWtmsUh7W0oSGsRfVq+rNdJwg28ortzensLMM8rC4Bj6zs1UDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:43:13.445835Z"},"content_sha256":"4b41e5fa085c06ad7374346d3635e854932bee1d9297899bd127e1ef73a5595d","schema_version":"1.0","event_id":"sha256:4b41e5fa085c06ad7374346d3635e854932bee1d9297899bd127e1ef73a5595d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/bundle.json","state_url":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/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-05-27T19:43:13Z","links":{"resolver":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS","bundle":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/bundle.json","state":"https://pith.science/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26RHSQVYIZ6F6FSMBKOAZC6XLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:26RHSQVYIZ6F6FSMBKOAZC6XLS","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":"3d1612a93441c8901682f68bc9413813fa2b3f949203d225e3382c65be50c7e8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-15T01:43:36Z","title_canon_sha256":"035446bfc05363bfc3a36566381321be496554c255b811e9d93a1f6658154b0d"},"schema_version":"1.0","source":{"id":"1412.4444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4444","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4444v1","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4444","created_at":"2026-05-18T02:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"26RHSQVYIZ6F","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"26RHSQVYIZ6F6FSM","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"26RHSQVY","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:4b41e5fa085c06ad7374346d3635e854932bee1d9297899bd127e1ef73a5595d","target":"graph","created_at":"2026-05-18T02:31:19Z","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":"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","authors_text":"Lalitha Sankar, Oliver Kosut","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-15T01:43:36Z","title":"Asymptotics and Non-asymptotics for Universal Fixed-to-Variable Source Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4444","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:0f3cd78fd0239f5a88481b11be90e060e20690228b045f652cdebb5578f709a2","target":"record","created_at":"2026-05-18T02:31:19Z","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":"3d1612a93441c8901682f68bc9413813fa2b3f949203d225e3382c65be50c7e8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-15T01:43:36Z","title_canon_sha256":"035446bfc05363bfc3a36566381321be496554c255b811e9d93a1f6658154b0d"},"schema_version":"1.0","source":{"id":"1412.4444","kind":"arxiv","version":1}},"canonical_sha256":"d7a27942b8467c5f164c0a9c0c8bd75c9df16d6af4f76b1e77055cdc91b1b53b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7a27942b8467c5f164c0a9c0c8bd75c9df16d6af4f76b1e77055cdc91b1b53b","first_computed_at":"2026-05-18T02:31:19.183430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:19.183430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cv/X7g/8jWQ2GrlSQnqLtSEhH+4rg5ErhhpgQw1/WFB0GJEG9aUg+my3+TzYuv+W2CSmSgVtoF6JpP7rVfvBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:19.183963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f3cd78fd0239f5a88481b11be90e060e20690228b045f652cdebb5578f709a2","sha256:4b41e5fa085c06ad7374346d3635e854932bee1d9297899bd127e1ef73a5595d"],"state_sha256":"0e4e51998d72c674fb9c098ff3b5834e49c9e589eeb199632166e76a68f64e57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4rJdnx3r/YD0lrH+4ElT+q521JxwGuiZjQWOlxiaMbyytJyiCf2G1Sg/RJhWBxdQNpeAIy5NKTbmvfDxau2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:43:13.448915Z","bundle_sha256":"82da52e3fa1472849531a2a1be97081a1d463f19b846b2993ca1b8236b613ac7"}}