{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4FNTI24EJE7DFCVC2R7ENOIU46","short_pith_number":"pith:4FNTI24E","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"},"canonical_sha256":"e15b346b84493e328aa2d47e46b914e7b41512fcfb40c58dfff079b956e31ab7","source":{"kind":"arxiv","id":"1710.05984","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4FNTI24EJE7DFCVC2R7ENOIU46","target":"record","payload":{"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"},"canonical_sha256":"e15b346b84493e328aa2d47e46b914e7b41512fcfb40c58dfff079b956e31ab7","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"},"source_kind":"arxiv","source_id":"1710.05984","source_version":5,"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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zd2G6QSDcOBwhrVzvjq/J2l/Y657F2L7SXM7TCyyzFAChovHX+3S6OncaS+G/lhlW0pmY15YWCLgsX6pUsACBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:08:03.960511Z"},"content_sha256":"3ec93d33dab73b5248360b102cc5a822759ef87b32d3da8027b102e3dfaff5de","schema_version":"1.0","event_id":"sha256:3ec93d33dab73b5248360b102cc5a822759ef87b32d3da8027b102e3dfaff5de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4FNTI24EJE7DFCVC2R7ENOIU46","target":"graph","payload":{"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"},"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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kh6JKeiLBAi/Dg36XULIaVhq51u611HmU75ggMbFwIypO4jNV/bL3k8nz6+Y7pKVa2b9zzbiBUouQIJA0K3tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:08:03.960844Z"},"content_sha256":"4da82990c2005975b7fb565f32384cd0aafbbba7babbf1ffa59c6e06cd0035f8","schema_version":"1.0","event_id":"sha256:4da82990c2005975b7fb565f32384cd0aafbbba7babbf1ffa59c6e06cd0035f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46/bundle.json","state_url":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FNTI24EJE7DFCVC2R7ENOIU46/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-20T07:08:03Z","links":{"resolver":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46","bundle":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46/bundle.json","state":"https://pith.science/pith/4FNTI24EJE7DFCVC2R7ENOIU46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FNTI24EJE7DFCVC2R7ENOIU46/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yqlYTJR0Ig2Do8/qZwULC5RDIjnsiQfBYlR+ofINAlIY1VDTLGNSYQlCTUos/x4MbX6f1i0FV4roHeHkxsnyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:08:03.962754Z","bundle_sha256":"b1dc41187c1cd03b23a74617eb88e5026187bca907ca32e09f9821e757b61d01"}}