{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EK2CKNRDWVWN5YM3UGKQILJMUO","short_pith_number":"pith:EK2CKNRD","canonical_record":{"source":{"id":"1905.00164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-01T02:25:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3720029e198280af9fd31dd512dfa8b8d8e4c0a8b2d2986136cc3257223a18e8","abstract_canon_sha256":"21b639b592739372644ad4d936a6102afe24160da03711323eeba3d4e0646872"},"schema_version":"1.0"},"canonical_sha256":"22b4253623b56cdee19ba195042d2ca3b29e6cd129174ef31f560045828d4a73","source":{"kind":"arxiv","id":"1905.00164","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00164","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00164v1","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00164","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"EK2CKNRDWVWN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EK2CKNRDWVWN5YM3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EK2CKNRD","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EK2CKNRDWVWN5YM3UGKQILJMUO","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-01T02:25:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3720029e198280af9fd31dd512dfa8b8d8e4c0a8b2d2986136cc3257223a18e8","abstract_canon_sha256":"21b639b592739372644ad4d936a6102afe24160da03711323eeba3d4e0646872"},"schema_version":"1.0"},"canonical_sha256":"22b4253623b56cdee19ba195042d2ca3b29e6cd129174ef31f560045828d4a73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:13.529357Z","signature_b64":"qP7fC9tVHnz/u3lURIjMaZIPZKMbE5+vh3tE9w65tIixbCnVMEPTTodi2Bt5BIHlkI45oXp5NDJiNM2c13kwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22b4253623b56cdee19ba195042d2ca3b29e6cd129174ef31f560045828d4a73","last_reissued_at":"2026-05-17T23:47:13.528959Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:13.528959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00164","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-17T23:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDES9CqOPITCU8BNfNOH2iozXup4x0QGiEl7shtit1g0s7HCbRk89IWQ8SeHm45Y29XsxUw8VIR5KfKlw2uODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:56:47.828623Z"},"content_sha256":"c425154a1fa14b5b0650bf9804d7604d7c72aeeea3ef32a87a6799a6824c62b1","schema_version":"1.0","event_id":"sha256:c425154a1fa14b5b0650bf9804d7604d7c72aeeea3ef32a87a6799a6824c62b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EK2CKNRDWVWN5YM3UGKQILJMUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a conditional inequality in Kolmogorov complexity and its applications in communication complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Andrei Romashchenko, Marius Zimand","submitted_at":"2019-05-01T02:25:32Z","abstract_excerpt":"Romashchenko and Zimand~\\cite{rom-zim:c:mutualinfo} have shown that if we partition the set of pairs $(x,y)$ of $n$-bit strings into combinatorial rectangles, then $I(x:y) \\geq I(x:y \\mid t(x,y)) - O(\\log n)$, where $I$ denotes mutual information in the Kolmogorov complexity sense, and $t(x,y)$ is the rectangle containing $(x,y)$. We observe that this inequality can be extended to coverings with rectangles which may overlap. The new inequality essentially states that in case of a covering with combinatorial rectangles,\n  $I(x:y) \\geq I(x:y \\mid t(x,y)) - \\log \\rho - O(\\log n)$, where $t(x,y)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00164","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-17T23:47:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmeAjNjskqIaUJHb6s8qWZegyHPdhxmXjWANgsAszPrOGobPPj7hI7yH+rIUpIQawafCqw42GX2Wf7OeSVb0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:56:47.829004Z"},"content_sha256":"feb658d7640bd5f2423a1748cd22b5fa6c3fc82f88b74bd9af12e40cb4be7f56","schema_version":"1.0","event_id":"sha256:feb658d7640bd5f2423a1748cd22b5fa6c3fc82f88b74bd9af12e40cb4be7f56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/bundle.json","state_url":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/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-20T04:56:47Z","links":{"resolver":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO","bundle":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/bundle.json","state":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EK2CKNRDWVWN5YM3UGKQILJMUO","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":"21b639b592739372644ad4d936a6102afe24160da03711323eeba3d4e0646872","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-01T02:25:32Z","title_canon_sha256":"3720029e198280af9fd31dd512dfa8b8d8e4c0a8b2d2986136cc3257223a18e8"},"schema_version":"1.0","source":{"id":"1905.00164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00164","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00164v1","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00164","created_at":"2026-05-17T23:47:13Z"},{"alias_kind":"pith_short_12","alias_value":"EK2CKNRDWVWN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EK2CKNRDWVWN5YM3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EK2CKNRD","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:feb658d7640bd5f2423a1748cd22b5fa6c3fc82f88b74bd9af12e40cb4be7f56","target":"graph","created_at":"2026-05-17T23:47:13Z","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":"Romashchenko and Zimand~\\cite{rom-zim:c:mutualinfo} have shown that if we partition the set of pairs $(x,y)$ of $n$-bit strings into combinatorial rectangles, then $I(x:y) \\geq I(x:y \\mid t(x,y)) - O(\\log n)$, where $I$ denotes mutual information in the Kolmogorov complexity sense, and $t(x,y)$ is the rectangle containing $(x,y)$. We observe that this inequality can be extended to coverings with rectangles which may overlap. The new inequality essentially states that in case of a covering with combinatorial rectangles,\n  $I(x:y) \\geq I(x:y \\mid t(x,y)) - \\log \\rho - O(\\log n)$, where $t(x,y)$ ","authors_text":"Andrei Romashchenko, Marius Zimand","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-01T02:25:32Z","title":"On a conditional inequality in Kolmogorov complexity and its applications in communication complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00164","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:c425154a1fa14b5b0650bf9804d7604d7c72aeeea3ef32a87a6799a6824c62b1","target":"record","created_at":"2026-05-17T23:47:13Z","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":"21b639b592739372644ad4d936a6102afe24160da03711323eeba3d4e0646872","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-01T02:25:32Z","title_canon_sha256":"3720029e198280af9fd31dd512dfa8b8d8e4c0a8b2d2986136cc3257223a18e8"},"schema_version":"1.0","source":{"id":"1905.00164","kind":"arxiv","version":1}},"canonical_sha256":"22b4253623b56cdee19ba195042d2ca3b29e6cd129174ef31f560045828d4a73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22b4253623b56cdee19ba195042d2ca3b29e6cd129174ef31f560045828d4a73","first_computed_at":"2026-05-17T23:47:13.528959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:13.528959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qP7fC9tVHnz/u3lURIjMaZIPZKMbE5+vh3tE9w65tIixbCnVMEPTTodi2Bt5BIHlkI45oXp5NDJiNM2c13kwDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:13.529357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c425154a1fa14b5b0650bf9804d7604d7c72aeeea3ef32a87a6799a6824c62b1","sha256:feb658d7640bd5f2423a1748cd22b5fa6c3fc82f88b74bd9af12e40cb4be7f56"],"state_sha256":"51859060d34b26122a67656a0d9ecaf5f051d73aa212a582f5bfc4ee3454b9f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFMn951cMA/MtCz9tvH0qPxMUYBEV4HuyUhtNUyMhNdJw//rr7Xysmhu5sR/Afa+23jECkgvQw2km/tJK19oBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:56:47.831077Z","bundle_sha256":"d293ff44babe132ee7e4bb6166e742444405a3bbbcf860dd4f75ac97e9558f8c"}}