{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TLWBEQCXEZYFOXT3W2EEKBTQJO","short_pith_number":"pith:TLWBEQCX","schema_version":"1.0","canonical_sha256":"9aec1240572670575e7bb6884506704bbb0feb3f378e81a971d821eb6049caf3","source":{"kind":"arxiv","id":"2605.16261","version":1},"attestation_state":"computed","paper":{"title":"Limit on the computational power of $\\mathrm{C}$-random strings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexey Milovanov","submitted_at":"2026-02-23T12:13:57Z","abstract_excerpt":"We construct a universal decompressor $U$ for plain Kolmogorov complexity $\\mathrm{C}_U$ such that the Halting Problem cannot be decided by any polynomial-time oracle machine with access to the set of random strings $R_{\\mathrm{C}_U} = \\{x : \\mathrm{C}_U(x) \\ge |x|\\}$. This result resolves a problem posed by Eric Allender regarding the computational power of Kolmogorov complexity-based oracles."},"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":"2605.16261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-02-23T12:13:57Z","cross_cats_sorted":[],"title_canon_sha256":"0aa4f8e45cf3ddaf000bd79f417820bfdf26e27b19e949d3ed6531a415b1854c","abstract_canon_sha256":"8f593ac2bc48108c300092809c45c23abbfe3dd1883885f0ddfe5ecc54dddc1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:13.960227Z","signature_b64":"MsMg8sJzp04pq2B6Q1bnZBgNDB3O0hx8gSf7fgAqrVQb8/o5gbxmVFAJG8j3v8eJoNpX7FRVVCb2jMuMnr6/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9aec1240572670575e7bb6884506704bbb0feb3f378e81a971d821eb6049caf3","last_reissued_at":"2026-05-20T00:02:13.959414Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:13.959414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limit on the computational power of $\\mathrm{C}$-random strings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexey Milovanov","submitted_at":"2026-02-23T12:13:57Z","abstract_excerpt":"We construct a universal decompressor $U$ for plain Kolmogorov complexity $\\mathrm{C}_U$ such that the Halting Problem cannot be decided by any polynomial-time oracle machine with access to the set of random strings $R_{\\mathrm{C}_U} = \\{x : \\mathrm{C}_U(x) \\ge |x|\\}$. This result resolves a problem posed by Eric Allender regarding the computational power of Kolmogorov complexity-based oracles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16261","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16261/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.16261","created_at":"2026-05-20T00:02:13.959554+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16261v1","created_at":"2026-05-20T00:02:13.959554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16261","created_at":"2026-05-20T00:02:13.959554+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLWBEQCXEZYF","created_at":"2026-05-20T00:02:13.959554+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLWBEQCXEZYFOXT3","created_at":"2026-05-20T00:02:13.959554+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLWBEQCX","created_at":"2026-05-20T00:02:13.959554+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/TLWBEQCXEZYFOXT3W2EEKBTQJO","json":"https://pith.science/pith/TLWBEQCXEZYFOXT3W2EEKBTQJO.json","graph_json":"https://pith.science/api/pith-number/TLWBEQCXEZYFOXT3W2EEKBTQJO/graph.json","events_json":"https://pith.science/api/pith-number/TLWBEQCXEZYFOXT3W2EEKBTQJO/events.json","paper":"https://pith.science/paper/TLWBEQCX"},"agent_actions":{"view_html":"https://pith.science/pith/TLWBEQCXEZYFOXT3W2EEKBTQJO","download_json":"https://pith.science/pith/TLWBEQCXEZYFOXT3W2EEKBTQJO.json","view_paper":"https://pith.science/paper/TLWBEQCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16261&json=true","fetch_graph":"https://pith.science/api/pith-number/TLWBEQCXEZYFOXT3W2EEKBTQJO/graph.json","fetch_events":"https://pith.science/api/pith-number/TLWBEQCXEZYFOXT3W2EEKBTQJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLWBEQCXEZYFOXT3W2EEKBTQJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLWBEQCXEZYFOXT3W2EEKBTQJO/action/storage_attestation","attest_author":"https://pith.science/pith/TLWBEQCXEZYFOXT3W2EEKBTQJO/action/author_attestation","sign_citation":"https://pith.science/pith/TLWBEQCXEZYFOXT3W2EEKBTQJO/action/citation_signature","submit_replication":"https://pith.science/pith/TLWBEQCXEZYFOXT3W2EEKBTQJO/action/replication_record"}},"created_at":"2026-05-20T00:02:13.959554+00:00","updated_at":"2026-05-20T00:02:13.959554+00:00"}