{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2R6TGRQUDUFIFCF46WLFF4CBI5","short_pith_number":"pith:2R6TGRQU","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"},"canonical_sha256":"d47d3346141d0a8288bcf59652f04147743a11e1242e7f922d945eb05d5aec84","source":{"kind":"arxiv","id":"1706.08468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08468","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08468v1","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08468","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"2R6TGRQUDUFI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2R6TGRQUDUFIFCF4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2R6TGRQU","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2R6TGRQUDUFIFCF46WLFF4CBI5","target":"record","payload":{"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"},"canonical_sha256":"d47d3346141d0a8288bcf59652f04147743a11e1242e7f922d945eb05d5aec84","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"},"source_kind":"arxiv","source_id":"1706.08468","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-18T00:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8lpzeDAdjrdve+hybeeReJLh9BpswqoKpY4uRYBsbWa/CrAywUSe615dlElqTiF96iL4Gsnf6tTmWmSZa+rBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:59:04.586156Z"},"content_sha256":"904253a01fc1bce27e9518b88477a0a41416f672321fa393256333c939da1fb1","schema_version":"1.0","event_id":"sha256:904253a01fc1bce27e9518b88477a0a41416f672321fa393256333c939da1fb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2R6TGRQUDUFIFCF46WLFF4CBI5","target":"graph","payload":{"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"},"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-18T00:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAn8CUEgPEaxNoslzGaE9mpW1q54UwU1t0ho7pmduTY26hBZMFQ9t6TRO11DU1QcysR2Rt/DGNOjDDZPZfWZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:59:04.586521Z"},"content_sha256":"59401b4e7e8117d5cc6ca7f55d99925dde723d518ac9f817e1d1fb9cfeacc00d","schema_version":"1.0","event_id":"sha256:59401b4e7e8117d5cc6ca7f55d99925dde723d518ac9f817e1d1fb9cfeacc00d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/bundle.json","state_url":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/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-21T21:59:04Z","links":{"resolver":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5","bundle":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/bundle.json","state":"https://pith.science/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2R6TGRQUDUFIFCF46WLFF4CBI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2R6TGRQUDUFIFCF46WLFF4CBI5","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":"0efeb9e83f29f0548ee360f916d45f4ca931d1e1fff69cbce02d5b6c26de27d0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-26T16:41:04Z","title_canon_sha256":"e388211718d1939e9080adc15242c395053d5b8d345ec4cab7ae69c019781a47"},"schema_version":"1.0","source":{"id":"1706.08468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08468","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08468v1","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08468","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"2R6TGRQUDUFI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2R6TGRQUDUFIFCF4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2R6TGRQU","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:59401b4e7e8117d5cc6ca7f55d99925dde723d518ac9f817e1d1fb9cfeacc00d","target":"graph","created_at":"2026-05-18T00:41:42Z","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":"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","authors_text":"Marius Zimand","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-26T16:41:04Z","title":"Distributed compression through the lens of algorithmic information theory: a primer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08468","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:904253a01fc1bce27e9518b88477a0a41416f672321fa393256333c939da1fb1","target":"record","created_at":"2026-05-18T00:41:42Z","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":"0efeb9e83f29f0548ee360f916d45f4ca931d1e1fff69cbce02d5b6c26de27d0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-26T16:41:04Z","title_canon_sha256":"e388211718d1939e9080adc15242c395053d5b8d345ec4cab7ae69c019781a47"},"schema_version":"1.0","source":{"id":"1706.08468","kind":"arxiv","version":1}},"canonical_sha256":"d47d3346141d0a8288bcf59652f04147743a11e1242e7f922d945eb05d5aec84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d47d3346141d0a8288bcf59652f04147743a11e1242e7f922d945eb05d5aec84","first_computed_at":"2026-05-18T00:41:42.525838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:42.525838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xp7Yd0Ni1z7ti7X6KvTDfK7SQmRyVRZblSXSWZKhraIfioWyZxKfjXv+mDQjp6rF3VINUyO47hLqNCj0XOy1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:42.526456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:904253a01fc1bce27e9518b88477a0a41416f672321fa393256333c939da1fb1","sha256:59401b4e7e8117d5cc6ca7f55d99925dde723d518ac9f817e1d1fb9cfeacc00d"],"state_sha256":"0ee7da20fbf4fe8b83b3b0af2ee1001572113c55aef7b376f0ab1c44ed002e1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HmUq2HNve+cWV4m3dSnUMBaSJbRh46mR7m2LzGUn44wmzgBOKHMgsN2W05Ru9nyBIUZug1KHZ22SJpUuNOjNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:59:04.588493Z","bundle_sha256":"a0693dda8a51d3f685c87091316bba9c85749e89731c8a8467cdfeb6cf2a992c"}}