{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D2KVJH4VAH5JEP5RU7VMRUL6FC","short_pith_number":"pith:D2KVJH4V","schema_version":"1.0","canonical_sha256":"1e95549f9501fa923fb1a7eac8d17e28bf703b9866e88c0babe6d89b44845a64","source":{"kind":"arxiv","id":"1602.03208","version":2},"attestation_state":"computed","paper":{"title":"Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"math.LO","authors_text":"Andrew Lewis-Pye, George Barmpalias, Nan Fang","submitted_at":"2016-02-05T08:59:56Z","abstract_excerpt":"Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Turing-complete. It can be observed, in fact, that for every computably enumerable (c.e.) real, there exists a Turing functional via which Omega computes it, and such that the number of bits of omega that are needed for the computation of the first n bits of the given number (i.e. the use on argument n) is bounded above by a computable function h(n) = n+o(n). We characterise the asymptotic upper bounds on the use of Ch"},"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":"1602.03208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-02-05T08:59:56Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"80901a76c2bfcbd55e84f073a6263acb45468c789123b587ee359bc854404cc2","abstract_canon_sha256":"b0d276338c1c456202640a5ee2115bb97f3c0c8d1c05a33968107a75743b0c54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:49.691985Z","signature_b64":"CRRQUJPsYT5kgkDDKAJO7e5c1jq57l8zOAmYrd1dCZ8uziB1NcRoArs+LodF0GFZCH/p6ifeK86QMN6CUsbtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e95549f9501fa923fb1a7eac8d17e28bf703b9866e88c0babe6d89b44845a64","last_reissued_at":"2026-05-18T01:15:49.691298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:49.691298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"math.LO","authors_text":"Andrew Lewis-Pye, George Barmpalias, Nan Fang","submitted_at":"2016-02-05T08:59:56Z","abstract_excerpt":"Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Turing-complete. It can be observed, in fact, that for every computably enumerable (c.e.) real, there exists a Turing functional via which Omega computes it, and such that the number of bits of omega that are needed for the computation of the first n bits of the given number (i.e. the use on argument n) is bounded above by a computable function h(n) = n+o(n). We characterise the asymptotic upper bounds on the use of Ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03208","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.03208","created_at":"2026-05-18T01:15:49.691420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03208v2","created_at":"2026-05-18T01:15:49.691420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03208","created_at":"2026-05-18T01:15:49.691420+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2KVJH4VAH5J","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2KVJH4VAH5JEP5R","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2KVJH4V","created_at":"2026-05-18T12:30:09.641336+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/D2KVJH4VAH5JEP5RU7VMRUL6FC","json":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC.json","graph_json":"https://pith.science/api/pith-number/D2KVJH4VAH5JEP5RU7VMRUL6FC/graph.json","events_json":"https://pith.science/api/pith-number/D2KVJH4VAH5JEP5RU7VMRUL6FC/events.json","paper":"https://pith.science/paper/D2KVJH4V"},"agent_actions":{"view_html":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC","download_json":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC.json","view_paper":"https://pith.science/paper/D2KVJH4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03208&json=true","fetch_graph":"https://pith.science/api/pith-number/D2KVJH4VAH5JEP5RU7VMRUL6FC/graph.json","fetch_events":"https://pith.science/api/pith-number/D2KVJH4VAH5JEP5RU7VMRUL6FC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/action/storage_attestation","attest_author":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/action/author_attestation","sign_citation":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/action/citation_signature","submit_replication":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/action/replication_record"}},"created_at":"2026-05-18T01:15:49.691420+00:00","updated_at":"2026-05-18T01:15:49.691420+00:00"}