{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:65HNOEZNAUSVREPNL4OTA3GYLW","short_pith_number":"pith:65HNOEZN","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"},"canonical_sha256":"f74ed7132d05255891ed5f1d306cd85dacca03ca2689a33b743622bd72843e33","source":{"kind":"arxiv","id":"1110.5710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5710","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5710v1","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5710","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"65HNOEZNAUSV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"65HNOEZNAUSVREPN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"65HNOEZN","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:65HNOEZNAUSVREPNL4OTA3GYLW","target":"record","payload":{"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"},"canonical_sha256":"f74ed7132d05255891ed5f1d306cd85dacca03ca2689a33b743622bd72843e33","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"},"source_kind":"arxiv","source_id":"1110.5710","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-18T04:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nE21uJDci7ofBYtOdxA1fYEZ5n8kOt73dhmQpfsMM5dw9hWfjgDmMVFyjKhY4uNSHMxpB2bYCK9xNhcAnFvHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:38:51.874890Z"},"content_sha256":"1e1cc4d7880d18cd6eb85f3afd6590655d79b017e15b514956d628cd89df411e","schema_version":"1.0","event_id":"sha256:1e1cc4d7880d18cd6eb85f3afd6590655d79b017e15b514956d628cd89df411e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:65HNOEZNAUSVREPNL4OTA3GYLW","target":"graph","payload":{"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"},"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-18T04:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gL55SxVnhuQMt+Ec9bT0XIFBOVE8YtYV98dcBGic4ABMIj2Oj2xUS8qKTh+VOMh8JtLA+6vC4UWv7r0TR5XeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T14:38:51.875236Z"},"content_sha256":"11a1b07f0516289f9bf70e5317c0ffb4ec0b37d9b6b9be1216c94dd641cc98ff","schema_version":"1.0","event_id":"sha256:11a1b07f0516289f9bf70e5317c0ffb4ec0b37d9b6b9be1216c94dd641cc98ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW/bundle.json","state_url":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65HNOEZNAUSVREPNL4OTA3GYLW/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-28T14:38:51Z","links":{"resolver":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW","bundle":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW/bundle.json","state":"https://pith.science/pith/65HNOEZNAUSVREPNL4OTA3GYLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65HNOEZNAUSVREPNL4OTA3GYLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:65HNOEZNAUSVREPNL4OTA3GYLW","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":"1136a94de8d117ca07104a5ed6f9ced565d6c8499536049796578b4c8b838c52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-26T06:38:39Z","title_canon_sha256":"0660d379c3033dd5c2fa18418b8454178b56a97ad32150ed6e09ff454c912e2f"},"schema_version":"1.0","source":{"id":"1110.5710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5710","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5710v1","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5710","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"65HNOEZNAUSV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"65HNOEZNAUSVREPN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"65HNOEZN","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:11a1b07f0516289f9bf70e5317c0ffb4ec0b37d9b6b9be1216c94dd641cc98ff","target":"graph","created_at":"2026-05-18T04:10:11Z","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 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","authors_text":"Ahmad Beirami, Faramarz Fekri","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-26T06:38:39Z","title":"Results on the Redundancy of Universal Compression for Finite-Length Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5710","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:1e1cc4d7880d18cd6eb85f3afd6590655d79b017e15b514956d628cd89df411e","target":"record","created_at":"2026-05-18T04:10:11Z","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":"1136a94de8d117ca07104a5ed6f9ced565d6c8499536049796578b4c8b838c52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-26T06:38:39Z","title_canon_sha256":"0660d379c3033dd5c2fa18418b8454178b56a97ad32150ed6e09ff454c912e2f"},"schema_version":"1.0","source":{"id":"1110.5710","kind":"arxiv","version":1}},"canonical_sha256":"f74ed7132d05255891ed5f1d306cd85dacca03ca2689a33b743622bd72843e33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f74ed7132d05255891ed5f1d306cd85dacca03ca2689a33b743622bd72843e33","first_computed_at":"2026-05-18T04:10:11.553967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:11.553967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HeDoDxRG6Z+1qYHMqINyP/oWrRUxLTBCRvm4TTKmpDxzIxtiawNEr5vkqXQzPUxlad9VDQcntKbj2W0F3NIuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:11.554735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e1cc4d7880d18cd6eb85f3afd6590655d79b017e15b514956d628cd89df411e","sha256:11a1b07f0516289f9bf70e5317c0ffb4ec0b37d9b6b9be1216c94dd641cc98ff"],"state_sha256":"e1336f88903a918c46bcb82ed22d9e09bed1ed7bf18a374b6d109d4a977bced4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cA4H5UnQE+IogPjhk37dfX9ks5re0pQiJtgsR+lAqxHrshDaFtV5KoFNnjqgmo0YYZ7UK+XdzMjUWM5VghEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T14:38:51.877804Z","bundle_sha256":"0bfec0080a9d747dea0e29758078907608575cebd25b7fceb955b88d1ec081b4"}}