{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K7FNJ75L6XFNE6GJZ42DXDARH5","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":"147fd8fd085b773a7dc68221e435869c85686666ad0732a33ac360f9eb3248ca","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-24T01:46:37Z","title_canon_sha256":"4d33ce95db3f53c11f7d124fac0ce0da7c39854835a7d2bf7b82c3ce222b8ebe"},"schema_version":"1.0","source":{"id":"1604.06971","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06971","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06971v1","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06971","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"K7FNJ75L6XFN","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K7FNJ75L6XFNE6GJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K7FNJ75L","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:559bd284ae9644c9bfbfb07d4b07deff6ee35f932205a226e35471ef15265868","target":"graph","created_at":"2026-05-18T01:16:23Z","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":"The Shannon Noiseless coding theorem (the data-compression principle) asserts that for an information source with an alphabet $\\mathcal X=\\{0,\\ldots ,\\ell -1\\}$ and an asymptotic equipartition property, one can reduce the number of stored strings $(x_0,\\ldots ,x_{n-1})\\in {\\mathcal X}^n$ to $\\ell^{nh}$ with an arbitrary small error-probability. Here $h$ is the entropy rate of the source (calculated to the base $\\ell$). We consider further reduction based on the concept of utility of a string measured in terms of a rate of a weight function. The novelty of the work is that the distribution of m","authors_text":"Izabella Stuhl, Yuri Suhov","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-24T01:46:37Z","title":"On principles of large deviation and selected data compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06971","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:9179077f30419caec152b44ccbb7f5019e36ccd7e886a4dbbcc1339b093c7387","target":"record","created_at":"2026-05-18T01:16:23Z","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":"147fd8fd085b773a7dc68221e435869c85686666ad0732a33ac360f9eb3248ca","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-24T01:46:37Z","title_canon_sha256":"4d33ce95db3f53c11f7d124fac0ce0da7c39854835a7d2bf7b82c3ce222b8ebe"},"schema_version":"1.0","source":{"id":"1604.06971","kind":"arxiv","version":1}},"canonical_sha256":"57cad4ffabf5cad278c9cf343b8c113f6485ccbb1ee1a4715cdb96d45ce4b8dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57cad4ffabf5cad278c9cf343b8c113f6485ccbb1ee1a4715cdb96d45ce4b8dc","first_computed_at":"2026-05-18T01:16:23.464691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:23.464691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dFJpMzRnnGcHX3iaNt9COg6nilSj0h2JmhQGHzrA++4jQCPe9BY/PcXFfl44N6GJJ5l2upi3DZ7U25c5UsRsDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:23.465498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06971","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9179077f30419caec152b44ccbb7f5019e36ccd7e886a4dbbcc1339b093c7387","sha256:559bd284ae9644c9bfbfb07d4b07deff6ee35f932205a226e35471ef15265868"],"state_sha256":"1937a0261e0b9b7ae3904dae03e1cb2e3d23ebceaf96eba827af2e87e409583e"}