{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B4OJDRAFQ3MD7NR57YP3LRUDTO","short_pith_number":"pith:B4OJDRAF","schema_version":"1.0","canonical_sha256":"0f1c91c40586d83fb63dfe1fb5c6839b957ae31bf81c9297fd28cbc8a5819396","source":{"kind":"arxiv","id":"1511.03602","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.03602","created_at":"2026-05-18T00:50:57.626400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03602v3","created_at":"2026-05-18T00:50:57.626400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03602","created_at":"2026-05-18T00:50:57.626400+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4OJDRAFQ3MD","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4OJDRAFQ3MD7NR5","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4OJDRAF","created_at":"2026-05-18T12:29:14.074870+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/B4OJDRAFQ3MD7NR57YP3LRUDTO","json":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO.json","graph_json":"https://pith.science/api/pith-number/B4OJDRAFQ3MD7NR57YP3LRUDTO/graph.json","events_json":"https://pith.science/api/pith-number/B4OJDRAFQ3MD7NR57YP3LRUDTO/events.json","paper":"https://pith.science/paper/B4OJDRAF"},"agent_actions":{"view_html":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO","download_json":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO.json","view_paper":"https://pith.science/paper/B4OJDRAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03602&json=true","fetch_graph":"https://pith.science/api/pith-number/B4OJDRAFQ3MD7NR57YP3LRUDTO/graph.json","fetch_events":"https://pith.science/api/pith-number/B4OJDRAFQ3MD7NR57YP3LRUDTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/action/storage_attestation","attest_author":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/action/author_attestation","sign_citation":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/action/citation_signature","submit_replication":"https://pith.science/pith/B4OJDRAFQ3MD7NR57YP3LRUDTO/action/replication_record"}},"created_at":"2026-05-18T00:50:57.626400+00:00","updated_at":"2026-05-18T00:50:57.626400+00:00"}