{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EK2CKNRDWVWN5YM3UGKQILJMUO","short_pith_number":"pith:EK2CKNRD","schema_version":"1.0","canonical_sha256":"22b4253623b56cdee19ba195042d2ca3b29e6cd129174ef31f560045828d4a73","source":{"kind":"arxiv","id":"1905.00164","version":1},"attestation_state":"computed","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)$ "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.00164","created_at":"2026-05-17T23:47:13.529022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.00164v1","created_at":"2026-05-17T23:47:13.529022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00164","created_at":"2026-05-17T23:47:13.529022+00:00"},{"alias_kind":"pith_short_12","alias_value":"EK2CKNRDWVWN","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EK2CKNRDWVWN5YM3","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EK2CKNRD","created_at":"2026-05-18T12:33:15.570797+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/EK2CKNRDWVWN5YM3UGKQILJMUO","json":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO.json","graph_json":"https://pith.science/api/pith-number/EK2CKNRDWVWN5YM3UGKQILJMUO/graph.json","events_json":"https://pith.science/api/pith-number/EK2CKNRDWVWN5YM3UGKQILJMUO/events.json","paper":"https://pith.science/paper/EK2CKNRD"},"agent_actions":{"view_html":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO","download_json":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO.json","view_paper":"https://pith.science/paper/EK2CKNRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.00164&json=true","fetch_graph":"https://pith.science/api/pith-number/EK2CKNRDWVWN5YM3UGKQILJMUO/graph.json","fetch_events":"https://pith.science/api/pith-number/EK2CKNRDWVWN5YM3UGKQILJMUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/action/storage_attestation","attest_author":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/action/author_attestation","sign_citation":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/action/citation_signature","submit_replication":"https://pith.science/pith/EK2CKNRDWVWN5YM3UGKQILJMUO/action/replication_record"}},"created_at":"2026-05-17T23:47:13.529022+00:00","updated_at":"2026-05-17T23:47:13.529022+00:00"}