{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:65HNOEZNAUSVREPNL4OTA3GYLW","short_pith_number":"pith:65HNOEZN","schema_version":"1.0","canonical_sha256":"f74ed7132d05255891ed5f1d306cd85dacca03ca2689a33b743622bd72843e33","source":{"kind":"arxiv","id":"1110.5710","version":1},"attestation_state":"computed","paper":{"title":"Results on the Redundancy of Universal Compression for Finite-Length Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Faramarz Fekri","submitted_at":"2011-10-26T06:38:39Z","abstract_excerpt":"In this paper, we investigate the redundancy of universal coding schemes on smooth parametric sources in the finite-length regime. We derive an upper bound on the probability of the event that a sequence of length $n$, chosen using Jeffreys' prior from the family of parametric sources with $d$ unknown parameters, is compressed with a redundancy smaller than $(1-\\epsilon)\\frac{d}{2}\\log n$ for any $\\epsilon>0$. Our results also confirm that for large enough $n$ and $d$, the average minimax redundancy provides a good estimate for the redundancy of most sources. Our result may be used to evaluate"},"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":"1110.5710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-26T06:38:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0660d379c3033dd5c2fa18418b8454178b56a97ad32150ed6e09ff454c912e2f","abstract_canon_sha256":"1136a94de8d117ca07104a5ed6f9ced565d6c8499536049796578b4c8b838c52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:11.554735Z","signature_b64":"HeDoDxRG6Z+1qYHMqINyP/oWrRUxLTBCRvm4TTKmpDxzIxtiawNEr5vkqXQzPUxlad9VDQcntKbj2W0F3NIuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f74ed7132d05255891ed5f1d306cd85dacca03ca2689a33b743622bd72843e33","last_reissued_at":"2026-05-18T04:10:11.553967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:11.553967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Results on the Redundancy of Universal Compression for Finite-Length Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Faramarz Fekri","submitted_at":"2011-10-26T06:38:39Z","abstract_excerpt":"In this paper, we investigate the redundancy of universal coding schemes on smooth parametric sources in the finite-length regime. We derive an upper bound on the probability of the event that a sequence of length $n$, chosen using Jeffreys' prior from the family of parametric sources with $d$ unknown parameters, is compressed with a redundancy smaller than $(1-\\epsilon)\\frac{d}{2}\\log n$ for any $\\epsilon>0$. Our results also confirm that for large enough $n$ and $d$, the average minimax redundancy provides a good estimate for the redundancy of most sources. Our result may be used to evaluate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5710","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":"1110.5710","created_at":"2026-05-18T04:10:11.554076+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5710v1","created_at":"2026-05-18T04:10:11.554076+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5710","created_at":"2026-05-18T04:10:11.554076+00:00"},{"alias_kind":"pith_short_12","alias_value":"65HNOEZNAUSV","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"65HNOEZNAUSVREPN","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"65HNOEZN","created_at":"2026-05-18T12:26:22.705136+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/65HNOEZNAUSVREPNL4OTA3GYLW","json":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW.json","graph_json":"https://pith.science/api/pith-number/65HNOEZNAUSVREPNL4OTA3GYLW/graph.json","events_json":"https://pith.science/api/pith-number/65HNOEZNAUSVREPNL4OTA3GYLW/events.json","paper":"https://pith.science/paper/65HNOEZN"},"agent_actions":{"view_html":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW","download_json":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW.json","view_paper":"https://pith.science/paper/65HNOEZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5710&json=true","fetch_graph":"https://pith.science/api/pith-number/65HNOEZNAUSVREPNL4OTA3GYLW/graph.json","fetch_events":"https://pith.science/api/pith-number/65HNOEZNAUSVREPNL4OTA3GYLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW/action/storage_attestation","attest_author":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW/action/author_attestation","sign_citation":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW/action/citation_signature","submit_replication":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW/action/replication_record"}},"created_at":"2026-05-18T04:10:11.554076+00:00","updated_at":"2026-05-18T04:10:11.554076+00:00"}