{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:K7FNJ75L6XFNE6GJZ42DXDARH5","short_pith_number":"pith:K7FNJ75L","schema_version":"1.0","canonical_sha256":"57cad4ffabf5cad278c9cf343b8c113f6485ccbb1ee1a4715cdb96d45ce4b8dc","source":{"kind":"arxiv","id":"1604.06971","version":1},"attestation_state":"computed","paper":{"title":"On principles of large deviation and selected data compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Izabella Stuhl, Yuri Suhov","submitted_at":"2016-04-24T01:46:37Z","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"},"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":"1604.06971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-24T01:46:37Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"4d33ce95db3f53c11f7d124fac0ce0da7c39854835a7d2bf7b82c3ce222b8ebe","abstract_canon_sha256":"147fd8fd085b773a7dc68221e435869c85686666ad0732a33ac360f9eb3248ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.465498Z","signature_b64":"dFJpMzRnnGcHX3iaNt9COg6nilSj0h2JmhQGHzrA++4jQCPe9BY/PcXFfl44N6GJJ5l2upi3DZ7U25c5UsRsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57cad4ffabf5cad278c9cf343b8c113f6485ccbb1ee1a4715cdb96d45ce4b8dc","last_reissued_at":"2026-05-18T01:16:23.464691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.464691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On principles of large deviation and selected data compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Izabella Stuhl, Yuri Suhov","submitted_at":"2016-04-24T01:46:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06971","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":"1604.06971","created_at":"2026-05-18T01:16:23.464830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06971v1","created_at":"2026-05-18T01:16:23.464830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06971","created_at":"2026-05-18T01:16:23.464830+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7FNJ75L6XFN","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7FNJ75L6XFNE6GJ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7FNJ75L","created_at":"2026-05-18T12:30:25.849896+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/K7FNJ75L6XFNE6GJZ42DXDARH5","json":"https://pith.science/pith/K7FNJ75L6XFNE6GJZ42DXDARH5.json","graph_json":"https://pith.science/api/pith-number/K7FNJ75L6XFNE6GJZ42DXDARH5/graph.json","events_json":"https://pith.science/api/pith-number/K7FNJ75L6XFNE6GJZ42DXDARH5/events.json","paper":"https://pith.science/paper/K7FNJ75L"},"agent_actions":{"view_html":"https://pith.science/pith/K7FNJ75L6XFNE6GJZ42DXDARH5","download_json":"https://pith.science/pith/K7FNJ75L6XFNE6GJZ42DXDARH5.json","view_paper":"https://pith.science/paper/K7FNJ75L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06971&json=true","fetch_graph":"https://pith.science/api/pith-number/K7FNJ75L6XFNE6GJZ42DXDARH5/graph.json","fetch_events":"https://pith.science/api/pith-number/K7FNJ75L6XFNE6GJZ42DXDARH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7FNJ75L6XFNE6GJZ42DXDARH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7FNJ75L6XFNE6GJZ42DXDARH5/action/storage_attestation","attest_author":"https://pith.science/pith/K7FNJ75L6XFNE6GJZ42DXDARH5/action/author_attestation","sign_citation":"https://pith.science/pith/K7FNJ75L6XFNE6GJZ42DXDARH5/action/citation_signature","submit_replication":"https://pith.science/pith/K7FNJ75L6XFNE6GJZ42DXDARH5/action/replication_record"}},"created_at":"2026-05-18T01:16:23.464830+00:00","updated_at":"2026-05-18T01:16:23.464830+00:00"}