{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B4OJDRAFQ3MD7NR57YP3LRUDTO","short_pith_number":"pith:B4OJDRAF","canonical_record":{"source":{"id":"1511.03602","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-11T18:48:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9e2eafa3e08a08a678afeca7417b429cdd9894a6f6052562c364ae3c3aa53b52","abstract_canon_sha256":"812fb8bf81b719ed48691219b27c2da4aed0d10d446a05dccec4e0cb3bc65c8b"},"schema_version":"1.0"},"canonical_sha256":"0f1c91c40586d83fb63dfe1fb5c6839b957ae31bf81c9297fd28cbc8a5819396","source":{"kind":"arxiv","id":"1511.03602","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03602","created_at":"2026-05-18T00:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03602v3","created_at":"2026-05-18T00:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03602","created_at":"2026-05-18T00:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"B4OJDRAFQ3MD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B4OJDRAFQ3MD7NR5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B4OJDRAF","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B4OJDRAFQ3MD7NR57YP3LRUDTO","target":"record","payload":{"canonical_record":{"source":{"id":"1511.03602","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-11T18:48:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9e2eafa3e08a08a678afeca7417b429cdd9894a6f6052562c364ae3c3aa53b52","abstract_canon_sha256":"812fb8bf81b719ed48691219b27c2da4aed0d10d446a05dccec4e0cb3bc65c8b"},"schema_version":"1.0"},"canonical_sha256":"0f1c91c40586d83fb63dfe1fb5c6839b957ae31bf81c9297fd28cbc8a5819396","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:57.626964Z","signature_b64":"SV0GQYxsveYTuQcTN+OT9eShO/ZxYCsf/LPwhrWnNd5Ir6Ky8HCmUUeuOqZVeKe71o7xMvh7duVdQyppbWL0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f1c91c40586d83fb63dfe1fb5c6839b957ae31bf81c9297fd28cbc8a5819396","last_reissued_at":"2026-05-18T00:50:57.626272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:57.626272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.03602","source_version":3,"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:50:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQ479D9Ta6Q3AY5+Z6NQK5N+NqcE2GRdRirycTZjj3OmMLqqk+kaza2qx9WfE7pZxf5kkwtfqj3aGmED7EoJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:51:05.056686Z"},"content_sha256":"96ef03ba6a09c2aa9e0b18a13c6454ea016499e2aa3412c8190d3b6d601815e6","schema_version":"1.0","event_id":"sha256:96ef03ba6a09c2aa9e0b18a13c6454ea016499e2aa3412c8190d3b6d601815e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B4OJDRAFQ3MD7NR57YP3LRUDTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kolmogorov complexity version of Slepian-Wolf coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marius Zimand","submitted_at":"2015-11-11T18:48:44Z","abstract_excerpt":"Alice and Bob are given two correlated n-bit strings x_1 and, respectively, x_2, which they want to losslessly compress and send to Zack. They can either collaborate by sharing their strings, or work separately. We show that there is no disadvantage in the second scenario: Alice and Bob, without knowing the other party's string, can achieve almost optimal compression in the sense of Kolmogorov complexity. Furthermore, compression takes polynomial time and can be made at any combination of lengths that satisfy some necessary conditions (modulo additive polylog terms). More precisely, there exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03602","kind":"arxiv","version":3},"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:50:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uanL+sjKhCdhYPaketR19M+TKO/qdiOdHDZJnuuFWs+Vh+Gzs4cMNBjqyAPN1m82ZqrOmFaPf12im4WRkp9xBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:51:05.057034Z"},"content_sha256":"8780a719ad4835c6dbab082bdfb24cd29efac0c3e031040e6232f0c3eb430a0f","schema_version":"1.0","event_id":"sha256:8780a719ad4835c6dbab082bdfb24cd29efac0c3e031040e6232f0c3eb430a0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/bundle.json","state_url":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/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:51:05Z","links":{"resolver":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO","bundle":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/bundle.json","state":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B4OJDRAFQ3MD7NR57YP3LRUDTO","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":"812fb8bf81b719ed48691219b27c2da4aed0d10d446a05dccec4e0cb3bc65c8b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-11T18:48:44Z","title_canon_sha256":"9e2eafa3e08a08a678afeca7417b429cdd9894a6f6052562c364ae3c3aa53b52"},"schema_version":"1.0","source":{"id":"1511.03602","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03602","created_at":"2026-05-18T00:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03602v3","created_at":"2026-05-18T00:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03602","created_at":"2026-05-18T00:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"B4OJDRAFQ3MD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B4OJDRAFQ3MD7NR5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B4OJDRAF","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:8780a719ad4835c6dbab082bdfb24cd29efac0c3e031040e6232f0c3eb430a0f","target":"graph","created_at":"2026-05-18T00:50:57Z","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":"Alice and Bob are given two correlated n-bit strings x_1 and, respectively, x_2, which they want to losslessly compress and send to Zack. They can either collaborate by sharing their strings, or work separately. We show that there is no disadvantage in the second scenario: Alice and Bob, without knowing the other party's string, can achieve almost optimal compression in the sense of Kolmogorov complexity. Furthermore, compression takes polynomial time and can be made at any combination of lengths that satisfy some necessary conditions (modulo additive polylog terms). More precisely, there exis","authors_text":"Marius Zimand","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-11T18:48:44Z","title":"Kolmogorov complexity version of Slepian-Wolf coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03602","kind":"arxiv","version":3},"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:96ef03ba6a09c2aa9e0b18a13c6454ea016499e2aa3412c8190d3b6d601815e6","target":"record","created_at":"2026-05-18T00:50:57Z","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":"812fb8bf81b719ed48691219b27c2da4aed0d10d446a05dccec4e0cb3bc65c8b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-11T18:48:44Z","title_canon_sha256":"9e2eafa3e08a08a678afeca7417b429cdd9894a6f6052562c364ae3c3aa53b52"},"schema_version":"1.0","source":{"id":"1511.03602","kind":"arxiv","version":3}},"canonical_sha256":"0f1c91c40586d83fb63dfe1fb5c6839b957ae31bf81c9297fd28cbc8a5819396","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f1c91c40586d83fb63dfe1fb5c6839b957ae31bf81c9297fd28cbc8a5819396","first_computed_at":"2026-05-18T00:50:57.626272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:57.626272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SV0GQYxsveYTuQcTN+OT9eShO/ZxYCsf/LPwhrWnNd5Ir6Ky8HCmUUeuOqZVeKe71o7xMvh7duVdQyppbWL0AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:57.626964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.03602","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96ef03ba6a09c2aa9e0b18a13c6454ea016499e2aa3412c8190d3b6d601815e6","sha256:8780a719ad4835c6dbab082bdfb24cd29efac0c3e031040e6232f0c3eb430a0f"],"state_sha256":"d7c47be5f004f205fe56d22c1170d13a7d49a4a69569561afba6e1f17640607f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDr/Crbc3+pyInC/mR/kUi/dZPmb1/ZQfftHs4henDzguwlcFcWyzQNeYiGcymsR/6Z61n4mTojIj1tkiUV5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:51:05.059006Z","bundle_sha256":"9ec882286bcc98836769d5c6dacc16a9d5f8b664449449745e61f4af69ef3cd9"}}