{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4FNTI24EJE7DFCVC2R7ENOIU46","short_pith_number":"pith:4FNTI24E","schema_version":"1.0","canonical_sha256":"e15b346b84493e328aa2d47e46b914e7b41512fcfb40c58dfff079b956e31ab7","source":{"kind":"arxiv","id":"1710.05984","version":5},"attestation_state":"computed","paper":{"title":"An operational characterization of mutual information in algorithmic information theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrei Romashchenko, Marius Zimand","submitted_at":"2017-10-16T20:14:24Z","abstract_excerpt":"We show that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings $x$ and $y$ is equal, up to logarithmic precision, to the length of the longest shared secret key that two parties, one having $x$ and the complexity profile of the pair and the other one having $y$ and the complexity profile of the pair, can establish via a probabilistic protocol with interaction on a public channel. For $\\ell > 2$, the longest shared secret that can be established from a tuple of strings $(x_1, \\ldots , x_\\ell)$ by $\\ell$ parties, each one having one component of the tuple and "},"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":"1710.05984","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-16T20:14:24Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"d85e9f968a7029e9443255800a7c78b43c450c745173572f4a15c1796aaeab75","abstract_canon_sha256":"e21ed434251d67bad48ba5fe997b8c791d7d3c891763c8e50f5154b65a304157"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:36.446397Z","signature_b64":"K7pTNPeccmLUngbzkp73Nb8jm2mgQKp3+bbdtl6FgC3ONtY+n86eO1d2wv35VHOq31n0NSaCnluqM6kNWUtmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e15b346b84493e328aa2d47e46b914e7b41512fcfb40c58dfff079b956e31ab7","last_reissued_at":"2026-05-17T23:47:36.445834Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:36.445834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An operational characterization of mutual information in algorithmic information theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrei Romashchenko, Marius Zimand","submitted_at":"2017-10-16T20:14:24Z","abstract_excerpt":"We show that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings $x$ and $y$ is equal, up to logarithmic precision, to the length of the longest shared secret key that two parties, one having $x$ and the complexity profile of the pair and the other one having $y$ and the complexity profile of the pair, can establish via a probabilistic protocol with interaction on a public channel. For $\\ell > 2$, the longest shared secret that can be established from a tuple of strings $(x_1, \\ldots , x_\\ell)$ by $\\ell$ parties, each one having one component of the tuple and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05984","kind":"arxiv","version":5},"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":"1710.05984","created_at":"2026-05-17T23:47:36.445919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05984v5","created_at":"2026-05-17T23:47:36.445919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05984","created_at":"2026-05-17T23:47:36.445919+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FNTI24EJE7D","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FNTI24EJE7DFCVC","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FNTI24E","created_at":"2026-05-18T12:30:58.224056+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/4FNTI24EJE7DFCVC2R7ENOIU46","json":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46.json","graph_json":"https://pith.science/api/pith-number/4FNTI24EJE7DFCVC2R7ENOIU46/graph.json","events_json":"https://pith.science/api/pith-number/4FNTI24EJE7DFCVC2R7ENOIU46/events.json","paper":"https://pith.science/paper/4FNTI24E"},"agent_actions":{"view_html":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46","download_json":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46.json","view_paper":"https://pith.science/paper/4FNTI24E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05984&json=true","fetch_graph":"https://pith.science/api/pith-number/4FNTI24EJE7DFCVC2R7ENOIU46/graph.json","fetch_events":"https://pith.science/api/pith-number/4FNTI24EJE7DFCVC2R7ENOIU46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46/action/storage_attestation","attest_author":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46/action/author_attestation","sign_citation":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46/action/citation_signature","submit_replication":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46/action/replication_record"}},"created_at":"2026-05-17T23:47:36.445919+00:00","updated_at":"2026-05-17T23:47:36.445919+00:00"}