{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4FNTI24EJE7DFCVC2R7ENOIU46","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":"e21ed434251d67bad48ba5fe997b8c791d7d3c891763c8e50f5154b65a304157","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-16T20:14:24Z","title_canon_sha256":"d85e9f968a7029e9443255800a7c78b43c450c745173572f4a15c1796aaeab75"},"schema_version":"1.0","source":{"id":"1710.05984","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05984","created_at":"2026-05-17T23:47:36Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05984v5","created_at":"2026-05-17T23:47:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05984","created_at":"2026-05-17T23:47:36Z"},{"alias_kind":"pith_short_12","alias_value":"4FNTI24EJE7D","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4FNTI24EJE7DFCVC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4FNTI24E","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:4da82990c2005975b7fb565f32384cd0aafbbba7babbf1ffa59c6e06cd0035f8","target":"graph","created_at":"2026-05-17T23:47:36Z","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":"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 ","authors_text":"Andrei Romashchenko, Marius Zimand","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-16T20:14:24Z","title":"An operational characterization of mutual information in algorithmic information theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05984","kind":"arxiv","version":5},"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:3ec93d33dab73b5248360b102cc5a822759ef87b32d3da8027b102e3dfaff5de","target":"record","created_at":"2026-05-17T23:47:36Z","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":"e21ed434251d67bad48ba5fe997b8c791d7d3c891763c8e50f5154b65a304157","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-16T20:14:24Z","title_canon_sha256":"d85e9f968a7029e9443255800a7c78b43c450c745173572f4a15c1796aaeab75"},"schema_version":"1.0","source":{"id":"1710.05984","kind":"arxiv","version":5}},"canonical_sha256":"e15b346b84493e328aa2d47e46b914e7b41512fcfb40c58dfff079b956e31ab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e15b346b84493e328aa2d47e46b914e7b41512fcfb40c58dfff079b956e31ab7","first_computed_at":"2026-05-17T23:47:36.445834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:36.445834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K7pTNPeccmLUngbzkp73Nb8jm2mgQKp3+bbdtl6FgC3ONtY+n86eO1d2wv35VHOq31n0NSaCnluqM6kNWUtmBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:36.446397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05984","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ec93d33dab73b5248360b102cc5a822759ef87b32d3da8027b102e3dfaff5de","sha256:4da82990c2005975b7fb565f32384cd0aafbbba7babbf1ffa59c6e06cd0035f8"],"state_sha256":"079830bf72fb75fa717e8e1ba9a94a6394c3ac8508a6168b5561cd7194ad7411"}