{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7WPPT2AHQZZCCVXUEA42XPCUHO","short_pith_number":"pith:7WPPT2AH","canonical_record":{"source":{"id":"1603.08351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-03-28T09:48:26Z","cross_cats_sorted":[],"title_canon_sha256":"9faac3fad6a8b8af16ebd791ad9d850fafa4bff6accca0d3437182add96165e6","abstract_canon_sha256":"7f842e90acd51e9598c2e97a42317d5cb423c8d2805c1eed37ed05341d194bcc"},"schema_version":"1.0"},"canonical_sha256":"fd9ef9e80786722156f42039abbc543b826628f7892e92f0db1cd31583e6a8ba","source":{"kind":"arxiv","id":"1603.08351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08351","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08351v1","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08351","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"7WPPT2AHQZZC","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7WPPT2AHQZZCCVXU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7WPPT2AH","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7WPPT2AHQZZCCVXUEA42XPCUHO","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-03-28T09:48:26Z","cross_cats_sorted":[],"title_canon_sha256":"9faac3fad6a8b8af16ebd791ad9d850fafa4bff6accca0d3437182add96165e6","abstract_canon_sha256":"7f842e90acd51e9598c2e97a42317d5cb423c8d2805c1eed37ed05341d194bcc"},"schema_version":"1.0"},"canonical_sha256":"fd9ef9e80786722156f42039abbc543b826628f7892e92f0db1cd31583e6a8ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:10.987363Z","signature_b64":"JJqOozBNv7N7J488NKD/5j5GipbAjn6VY5gZz1HD/JHWEAYmCAGJwVtn7W1eqim51n6IZKgN8R0KIoqHr6AADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd9ef9e80786722156f42039abbc543b826628f7892e92f0db1cd31583e6a8ba","last_reissued_at":"2026-05-18T01:18:10.986892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:10.986892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08351","source_version":1,"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-18T01:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVv7eKNC4VUf5kzyEbB2eGadn22vjBRWeD3j12bgPzqOXYN/keemxjiiuMBogR7Y9ZQ3Op7lbz0/22/mmPU0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:01:05.989119Z"},"content_sha256":"ee08b234ee62bded3e7b48ede4d10fff4facbaaa2230885da7844ff10249d294","schema_version":"1.0","event_id":"sha256:ee08b234ee62bded3e7b48ede4d10fff4facbaaa2230885da7844ff10249d294"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7WPPT2AHQZZCCVXUEA42XPCUHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solovay functions and their applications in algorithmic randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Andr\\'e Nies, Laurent Bienvenu, Rod Downey, Wolfgang Merkle","submitted_at":"2016-03-28T09:48:26Z","abstract_excerpt":"Classical versions of Kolmogorov complexity are incomputable. Nevertheless, in 1975 Solovay showed that there are computable functions $f > K+O(1)$ such that for infinitely many strings $\\sigma$, $f(\\sigma)=K(\\sigma)+O(1)$, where $K$ denotes prefix-free Kolmogorov complexity (while $C$ denotes plain Kolmogorov complexity). Such an $f$ is now called a Solovay function. We prove that many classical results about $K$ can be obtained by replacing $K$ by a Solovay function. For example, the three following properties of a function $g$ all hold for the function $K$.\n  (i) The sum of the terms $\\sum_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08351","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"},"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-18T01:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AkOF7OviPEHLwg12wiphBRI+Cnw/IMCMPm38tLFcV/AZdEcy27yI61u2EX4lPBh5LYdxu46ahRx92U+l+CJNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:01:05.989804Z"},"content_sha256":"bea9bb406f0ee11b82110e6eb0bce8cbed2204ac82a5c2676432ffee25ded74b","schema_version":"1.0","event_id":"sha256:bea9bb406f0ee11b82110e6eb0bce8cbed2204ac82a5c2676432ffee25ded74b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/bundle.json","state_url":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/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-05-25T08:01:05Z","links":{"resolver":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO","bundle":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/bundle.json","state":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7WPPT2AHQZZCCVXUEA42XPCUHO","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":"7f842e90acd51e9598c2e97a42317d5cb423c8d2805c1eed37ed05341d194bcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-03-28T09:48:26Z","title_canon_sha256":"9faac3fad6a8b8af16ebd791ad9d850fafa4bff6accca0d3437182add96165e6"},"schema_version":"1.0","source":{"id":"1603.08351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08351","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08351v1","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08351","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"7WPPT2AHQZZC","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7WPPT2AHQZZCCVXU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7WPPT2AH","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:bea9bb406f0ee11b82110e6eb0bce8cbed2204ac82a5c2676432ffee25ded74b","target":"graph","created_at":"2026-05-18T01:18:10Z","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":"Classical versions of Kolmogorov complexity are incomputable. Nevertheless, in 1975 Solovay showed that there are computable functions $f > K+O(1)$ such that for infinitely many strings $\\sigma$, $f(\\sigma)=K(\\sigma)+O(1)$, where $K$ denotes prefix-free Kolmogorov complexity (while $C$ denotes plain Kolmogorov complexity). Such an $f$ is now called a Solovay function. We prove that many classical results about $K$ can be obtained by replacing $K$ by a Solovay function. For example, the three following properties of a function $g$ all hold for the function $K$.\n  (i) The sum of the terms $\\sum_","authors_text":"Andr\\'e Nies, Laurent Bienvenu, Rod Downey, Wolfgang Merkle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-03-28T09:48:26Z","title":"Solovay functions and their applications in algorithmic randomness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08351","kind":"arxiv","version":1},"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:ee08b234ee62bded3e7b48ede4d10fff4facbaaa2230885da7844ff10249d294","target":"record","created_at":"2026-05-18T01:18:10Z","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":"7f842e90acd51e9598c2e97a42317d5cb423c8d2805c1eed37ed05341d194bcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-03-28T09:48:26Z","title_canon_sha256":"9faac3fad6a8b8af16ebd791ad9d850fafa4bff6accca0d3437182add96165e6"},"schema_version":"1.0","source":{"id":"1603.08351","kind":"arxiv","version":1}},"canonical_sha256":"fd9ef9e80786722156f42039abbc543b826628f7892e92f0db1cd31583e6a8ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd9ef9e80786722156f42039abbc543b826628f7892e92f0db1cd31583e6a8ba","first_computed_at":"2026-05-18T01:18:10.986892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:10.986892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JJqOozBNv7N7J488NKD/5j5GipbAjn6VY5gZz1HD/JHWEAYmCAGJwVtn7W1eqim51n6IZKgN8R0KIoqHr6AADg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:10.987363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee08b234ee62bded3e7b48ede4d10fff4facbaaa2230885da7844ff10249d294","sha256:bea9bb406f0ee11b82110e6eb0bce8cbed2204ac82a5c2676432ffee25ded74b"],"state_sha256":"53d79298a686087ef78a5e2e062380725f8977cdde6aff4066e21047a0107b01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xt8mY27GzLkFwWdoYa88GMMSF3BF8wOcaplB6ux8UhIMyElmi2If3X+lDYeCXDb2JOzl4Ye8rLnaGphdskDpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:01:05.993851Z","bundle_sha256":"9b8cabac9d3de92dc49c4b08cffd5f078192c4e09817cbe9015a74f7fc3a5665"}}