{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7WPPT2AHQZZCCVXUEA42XPCUHO","short_pith_number":"pith:7WPPT2AH","schema_version":"1.0","canonical_sha256":"fd9ef9e80786722156f42039abbc543b826628f7892e92f0db1cd31583e6a8ba","source":{"kind":"arxiv","id":"1603.08351","version":1},"attestation_state":"computed","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_"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.08351","created_at":"2026-05-18T01:18:10.986957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08351v1","created_at":"2026-05-18T01:18:10.986957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08351","created_at":"2026-05-18T01:18:10.986957+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WPPT2AHQZZC","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WPPT2AHQZZCCVXU","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WPPT2AH","created_at":"2026-05-18T12:30:04.600751+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/7WPPT2AHQZZCCVXUEA42XPCUHO","json":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO.json","graph_json":"https://pith.science/api/pith-number/7WPPT2AHQZZCCVXUEA42XPCUHO/graph.json","events_json":"https://pith.science/api/pith-number/7WPPT2AHQZZCCVXUEA42XPCUHO/events.json","paper":"https://pith.science/paper/7WPPT2AH"},"agent_actions":{"view_html":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO","download_json":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO.json","view_paper":"https://pith.science/paper/7WPPT2AH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08351&json=true","fetch_graph":"https://pith.science/api/pith-number/7WPPT2AHQZZCCVXUEA42XPCUHO/graph.json","fetch_events":"https://pith.science/api/pith-number/7WPPT2AHQZZCCVXUEA42XPCUHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/action/storage_attestation","attest_author":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/action/author_attestation","sign_citation":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/action/citation_signature","submit_replication":"https://pith.science/pith/7WPPT2AHQZZCCVXUEA42XPCUHO/action/replication_record"}},"created_at":"2026-05-18T01:18:10.986957+00:00","updated_at":"2026-05-18T01:18:10.986957+00:00"}