{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4D74DRNRGZLOCNTE5VQTFEAPMI","short_pith_number":"pith:4D74DRNR","schema_version":"1.0","canonical_sha256":"e0ffc1c5b13656e13664ed6132900f623a7184da508d67d3960ed120a6911732","source":{"kind":"arxiv","id":"1504.08070","version":2},"attestation_state":"computed","paper":{"title":"Universal Compression of Power-Law Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Alon Orlitsky, Ananda Theertha Suresh, Ashkan Jafarpour, Moein Falahatgar, Venkatadheeraj Pichapati","submitted_at":"2015-04-30T03:31:05Z","abstract_excerpt":"English words and the outputs of many other natural processes are well-known to follow a Zipf distribution. Yet this thoroughly-established property has never been shown to help compress or predict these important processes. We show that the expected redundancy of Zipf distributions of order $\\alpha>1$ is roughly the $1/\\alpha$ power of the expected redundancy of unrestricted distributions. Hence for these orders, Zipf distributions can be better compressed and predicted than was previously known. Unlike the expected case, we show that worst-case redundancy is roughly the same for Zipf and for"},"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":"1504.08070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-30T03:31:05Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"11ddbbcd72f72357495bcfe9a9959a91523d745f2b030ae91e9c7ba468a9678b","abstract_canon_sha256":"8dea56eb1d4dea1c6b3a754657615bb0ec48764f730423f1ada3546d7f61ab49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:13.961505Z","signature_b64":"N1NblkfPtfiejh7xRf+Q94dnAqDFil7AFdEqAB5Pj+ZcO/sKHLmvDdbHNRG0ypjj09ou1q0ZQzTZ0X3MbDXoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0ffc1c5b13656e13664ed6132900f623a7184da508d67d3960ed120a6911732","last_reissued_at":"2026-05-18T02:17:13.960914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:13.960914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Compression of Power-Law Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Alon Orlitsky, Ananda Theertha Suresh, Ashkan Jafarpour, Moein Falahatgar, Venkatadheeraj Pichapati","submitted_at":"2015-04-30T03:31:05Z","abstract_excerpt":"English words and the outputs of many other natural processes are well-known to follow a Zipf distribution. Yet this thoroughly-established property has never been shown to help compress or predict these important processes. We show that the expected redundancy of Zipf distributions of order $\\alpha>1$ is roughly the $1/\\alpha$ power of the expected redundancy of unrestricted distributions. Hence for these orders, Zipf distributions can be better compressed and predicted than was previously known. Unlike the expected case, we show that worst-case redundancy is roughly the same for Zipf and for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08070","kind":"arxiv","version":2},"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":"1504.08070","created_at":"2026-05-18T02:17:13.961016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.08070v2","created_at":"2026-05-18T02:17:13.961016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08070","created_at":"2026-05-18T02:17:13.961016+00:00"},{"alias_kind":"pith_short_12","alias_value":"4D74DRNRGZLO","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4D74DRNRGZLOCNTE","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4D74DRNR","created_at":"2026-05-18T12:29:05.191682+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/4D74DRNRGZLOCNTE5VQTFEAPMI","json":"https://pith.science/pith/4D74DRNRGZLOCNTE5VQTFEAPMI.json","graph_json":"https://pith.science/api/pith-number/4D74DRNRGZLOCNTE5VQTFEAPMI/graph.json","events_json":"https://pith.science/api/pith-number/4D74DRNRGZLOCNTE5VQTFEAPMI/events.json","paper":"https://pith.science/paper/4D74DRNR"},"agent_actions":{"view_html":"https://pith.science/pith/4D74DRNRGZLOCNTE5VQTFEAPMI","download_json":"https://pith.science/pith/4D74DRNRGZLOCNTE5VQTFEAPMI.json","view_paper":"https://pith.science/paper/4D74DRNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.08070&json=true","fetch_graph":"https://pith.science/api/pith-number/4D74DRNRGZLOCNTE5VQTFEAPMI/graph.json","fetch_events":"https://pith.science/api/pith-number/4D74DRNRGZLOCNTE5VQTFEAPMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4D74DRNRGZLOCNTE5VQTFEAPMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4D74DRNRGZLOCNTE5VQTFEAPMI/action/storage_attestation","attest_author":"https://pith.science/pith/4D74DRNRGZLOCNTE5VQTFEAPMI/action/author_attestation","sign_citation":"https://pith.science/pith/4D74DRNRGZLOCNTE5VQTFEAPMI/action/citation_signature","submit_replication":"https://pith.science/pith/4D74DRNRGZLOCNTE5VQTFEAPMI/action/replication_record"}},"created_at":"2026-05-18T02:17:13.961016+00:00","updated_at":"2026-05-18T02:17:13.961016+00:00"}