{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4QJ4QB5L3TCGWDSHT4BV4ILGDN","short_pith_number":"pith:4QJ4QB5L","canonical_record":{"source":{"id":"1311.2092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-08T21:55:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a9070da019e26ee189645091aceed914a0dfc696a40219e1fee6298fac44f200","abstract_canon_sha256":"31432614e32b43597223c64459fd6715eaf5eb504c22204696ec977c61395f88"},"schema_version":"1.0"},"canonical_sha256":"e413c807abdcc46b0e479f035e21661b62a6a9c2bfb395ce7b58c8be4df2c95f","source":{"kind":"arxiv","id":"1311.2092","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2092","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2092v2","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2092","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"4QJ4QB5L3TCG","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4QJ4QB5L3TCGWDSH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4QJ4QB5L","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4QJ4QB5L3TCGWDSHT4BV4ILGDN","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-08T21:55:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a9070da019e26ee189645091aceed914a0dfc696a40219e1fee6298fac44f200","abstract_canon_sha256":"31432614e32b43597223c64459fd6715eaf5eb504c22204696ec977c61395f88"},"schema_version":"1.0"},"canonical_sha256":"e413c807abdcc46b0e479f035e21661b62a6a9c2bfb395ce7b58c8be4df2c95f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:32.157252Z","signature_b64":"2lOIysz8UjUMcTVDX4jN+bdmTxWvWzC6jkI31WoOHP9euOYmxqSh0j7wGJWvgNWBqMl3KIlbAY3kz/eqPP/ICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e413c807abdcc46b0e479f035e21661b62a6a9c2bfb395ce7b58c8be4df2c95f","last_reissued_at":"2026-05-18T02:52:32.156656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:32.156656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2092","source_version":2,"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-18T02:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upIPHChHwsnCVCGGNa6L9GF5p/HcJEEVesv1Of66dkcv8L6WmszW83Gb5TLJhkGLmU/8vhDZN9OZhgcLJU4oAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:38:09.082506Z"},"content_sha256":"558b1729964a5306a191c0d55a4ebf3aabaf29ce56187af9a834a37d1dc4e978","schema_version":"1.0","event_id":"sha256:558b1729964a5306a191c0d55a4ebf3aabaf29ce56187af9a834a37d1dc4e978"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4QJ4QB5L3TCGWDSHT4BV4ILGDN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relating and contrasting plain and prefix Kolmogorov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Bruno Bauwens","submitted_at":"2013-11-08T21:55:06Z","abstract_excerpt":"In [3] a short proof is given that some strings have maximal plain Kolmogorov complexity but not maximal prefix-free complexity. The proof uses Levin's symmetry of information, Levin's formula relating plain and prefix complexity and Gacs' theorem that complexity of complexity given the string can be high. We argue that the proof technique and results mentioned above are useful to simplify existing proofs and to solve open questions.\n  We present a short proof of Solovay's result [21] relating plain and prefix complexity: $K (x) = C (x) + CC (x) + O(CCC (x))$ and $C (x) = K (x) - KK (x) + O(KK"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2092","kind":"arxiv","version":2},"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-18T02:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0kK2IezSxmZ8BGXkbAWgCtgglzIPcGH6fIYT9g77h+Z17uMjF/3chL9jWcgDEVUqnteUjA/g1RZ/JsLN/mpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:38:09.083237Z"},"content_sha256":"4b8c98280735e801dc1047892618081fe4ad9d4d969ffa169a841f7577a7e0de","schema_version":"1.0","event_id":"sha256:4b8c98280735e801dc1047892618081fe4ad9d4d969ffa169a841f7577a7e0de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QJ4QB5L3TCGWDSHT4BV4ILGDN/bundle.json","state_url":"https://pith.science/pith/4QJ4QB5L3TCGWDSHT4BV4ILGDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QJ4QB5L3TCGWDSHT4BV4ILGDN/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-07T16:38:09Z","links":{"resolver":"https://pith.science/pith/4QJ4QB5L3TCGWDSHT4BV4ILGDN","bundle":"https://pith.science/pith/4QJ4QB5L3TCGWDSHT4BV4ILGDN/bundle.json","state":"https://pith.science/pith/4QJ4QB5L3TCGWDSHT4BV4ILGDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QJ4QB5L3TCGWDSHT4BV4ILGDN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4QJ4QB5L3TCGWDSHT4BV4ILGDN","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":"31432614e32b43597223c64459fd6715eaf5eb504c22204696ec977c61395f88","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-08T21:55:06Z","title_canon_sha256":"a9070da019e26ee189645091aceed914a0dfc696a40219e1fee6298fac44f200"},"schema_version":"1.0","source":{"id":"1311.2092","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2092","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2092v2","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2092","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"4QJ4QB5L3TCG","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4QJ4QB5L3TCGWDSH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4QJ4QB5L","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:4b8c98280735e801dc1047892618081fe4ad9d4d969ffa169a841f7577a7e0de","target":"graph","created_at":"2026-05-18T02:52:32Z","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":"In [3] a short proof is given that some strings have maximal plain Kolmogorov complexity but not maximal prefix-free complexity. The proof uses Levin's symmetry of information, Levin's formula relating plain and prefix complexity and Gacs' theorem that complexity of complexity given the string can be high. We argue that the proof technique and results mentioned above are useful to simplify existing proofs and to solve open questions.\n  We present a short proof of Solovay's result [21] relating plain and prefix complexity: $K (x) = C (x) + CC (x) + O(CCC (x))$ and $C (x) = K (x) - KK (x) + O(KK","authors_text":"Bruno Bauwens","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-08T21:55:06Z","title":"Relating and contrasting plain and prefix Kolmogorov complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2092","kind":"arxiv","version":2},"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:558b1729964a5306a191c0d55a4ebf3aabaf29ce56187af9a834a37d1dc4e978","target":"record","created_at":"2026-05-18T02:52:32Z","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":"31432614e32b43597223c64459fd6715eaf5eb504c22204696ec977c61395f88","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-08T21:55:06Z","title_canon_sha256":"a9070da019e26ee189645091aceed914a0dfc696a40219e1fee6298fac44f200"},"schema_version":"1.0","source":{"id":"1311.2092","kind":"arxiv","version":2}},"canonical_sha256":"e413c807abdcc46b0e479f035e21661b62a6a9c2bfb395ce7b58c8be4df2c95f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e413c807abdcc46b0e479f035e21661b62a6a9c2bfb395ce7b58c8be4df2c95f","first_computed_at":"2026-05-18T02:52:32.156656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:32.156656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2lOIysz8UjUMcTVDX4jN+bdmTxWvWzC6jkI31WoOHP9euOYmxqSh0j7wGJWvgNWBqMl3KIlbAY3kz/eqPP/ICw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:32.157252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2092","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:558b1729964a5306a191c0d55a4ebf3aabaf29ce56187af9a834a37d1dc4e978","sha256:4b8c98280735e801dc1047892618081fe4ad9d4d969ffa169a841f7577a7e0de"],"state_sha256":"f4a1e72e5b239c2779f32a7a5f471db45639c11fdfee47426be975bc602a4ad1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sijWJcWPoI8EjBax37jMXqdGiEfhNYGdJ6dfJi/sP/wargGUylYHTBsO57dzacyAYYzP9kJm0nWRtymj3ge4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:38:09.087806Z","bundle_sha256":"8aca2a279a4dea9ac6a1260a5696ede40f3a59da4d7d38f0cc63ba1823ff2bdb"}}