{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2R6TGRQUDUFIFCF46WLFF4CBI5","short_pith_number":"pith:2R6TGRQU","schema_version":"1.0","canonical_sha256":"d47d3346141d0a8288bcf59652f04147743a11e1242e7f922d945eb05d5aec84","source":{"kind":"arxiv","id":"1706.08468","version":1},"attestation_state":"computed","paper":{"title":"Distributed compression through the lens of algorithmic information theory: a primer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2017-06-26T16:41:04Z","abstract_excerpt":"Distributed compression is the task of compressing correlated data by several parties, each one possessing one piece of data and acting separately. The classical Slepian-Wolf theorem (D. Slepian, J. K. Wolf, IEEE Transactions on Inf. Theory, 1973) shows that if data is generated by independent draws from a joint distribution, that is by a memoryless stochastic process, then distributed compression can achieve the same compression rates as centralized compression when the parties act together. Recently, the author (M. Zimand, STOC 2017) has obtained an analogue version of the Slepian-Wolf theor"},"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":"1706.08468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-26T16:41:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e388211718d1939e9080adc15242c395053d5b8d345ec4cab7ae69c019781a47","abstract_canon_sha256":"0efeb9e83f29f0548ee360f916d45f4ca931d1e1fff69cbce02d5b6c26de27d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:42.526456Z","signature_b64":"Xp7Yd0Ni1z7ti7X6KvTDfK7SQmRyVRZblSXSWZKhraIfioWyZxKfjXv+mDQjp6rF3VINUyO47hLqNCj0XOy1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d47d3346141d0a8288bcf59652f04147743a11e1242e7f922d945eb05d5aec84","last_reissued_at":"2026-05-18T00:41:42.525838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:42.525838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed compression through the lens of algorithmic information theory: a primer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2017-06-26T16:41:04Z","abstract_excerpt":"Distributed compression is the task of compressing correlated data by several parties, each one possessing one piece of data and acting separately. The classical Slepian-Wolf theorem (D. Slepian, J. K. Wolf, IEEE Transactions on Inf. Theory, 1973) shows that if data is generated by independent draws from a joint distribution, that is by a memoryless stochastic process, then distributed compression can achieve the same compression rates as centralized compression when the parties act together. Recently, the author (M. Zimand, STOC 2017) has obtained an analogue version of the Slepian-Wolf theor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08468","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":"1706.08468","created_at":"2026-05-18T00:41:42.525939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08468v1","created_at":"2026-05-18T00:41:42.525939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08468","created_at":"2026-05-18T00:41:42.525939+00:00"},{"alias_kind":"pith_short_12","alias_value":"2R6TGRQUDUFI","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2R6TGRQUDUFIFCF4","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2R6TGRQU","created_at":"2026-05-18T12:30:55.937587+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/2R6TGRQUDUFIFCF46WLFF4CBI5","json":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5.json","graph_json":"https://pith.science/api/pith-number/2R6TGRQUDUFIFCF46WLFF4CBI5/graph.json","events_json":"https://pith.science/api/pith-number/2R6TGRQUDUFIFCF46WLFF4CBI5/events.json","paper":"https://pith.science/paper/2R6TGRQU"},"agent_actions":{"view_html":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5","download_json":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5.json","view_paper":"https://pith.science/paper/2R6TGRQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08468&json=true","fetch_graph":"https://pith.science/api/pith-number/2R6TGRQUDUFIFCF46WLFF4CBI5/graph.json","fetch_events":"https://pith.science/api/pith-number/2R6TGRQUDUFIFCF46WLFF4CBI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/action/storage_attestation","attest_author":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/action/author_attestation","sign_citation":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/action/citation_signature","submit_replication":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/action/replication_record"}},"created_at":"2026-05-18T00:41:42.525939+00:00","updated_at":"2026-05-18T00:41:42.525939+00:00"}