{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D2KVJH4VAH5JEP5RU7VMRUL6FC","short_pith_number":"pith:D2KVJH4V","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"},"canonical_sha256":"1e95549f9501fa923fb1a7eac8d17e28bf703b9866e88c0babe6d89b44845a64","source":{"kind":"arxiv","id":"1602.03208","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03208","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03208v2","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03208","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"D2KVJH4VAH5J","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D2KVJH4VAH5JEP5R","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D2KVJH4V","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D2KVJH4VAH5JEP5RU7VMRUL6FC","target":"record","payload":{"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"},"canonical_sha256":"1e95549f9501fa923fb1a7eac8d17e28bf703b9866e88c0babe6d89b44845a64","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"},"source_kind":"arxiv","source_id":"1602.03208","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-18T01:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkadSm7REj+1z3hdOrRF8L36wPL9H103LX4EWN0VDTCCqwEDiS38aZhoD/2fsJtZMNa26HdpfguEncRNpQ+mBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:05:12.488206Z"},"content_sha256":"b4775fc89d866af2af45129fdddb6be97992d4998a9e62a00d19d9b4767222b7","schema_version":"1.0","event_id":"sha256:b4775fc89d866af2af45129fdddb6be97992d4998a9e62a00d19d9b4767222b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D2KVJH4VAH5JEP5RU7VMRUL6FC","target":"graph","payload":{"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"},"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:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYlZhHh+xvAtt6KE4MSPjmmMBYR92ezEvUQl/Hqd74h9Hxa2OooaD8ok94/TvSBdE/QXwbr7NxznqEdEwqtnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:05:12.488575Z"},"content_sha256":"20ff12a22c9e4cc1c4ee10100857acd519245c83146552fced26672ba11c8014","schema_version":"1.0","event_id":"sha256:20ff12a22c9e4cc1c4ee10100857acd519245c83146552fced26672ba11c8014"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/bundle.json","state_url":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/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-04T13:05:12Z","links":{"resolver":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC","bundle":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/bundle.json","state":"https://pith.science/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2KVJH4VAH5JEP5RU7VMRUL6FC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D2KVJH4VAH5JEP5RU7VMRUL6FC","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":"b0d276338c1c456202640a5ee2115bb97f3c0c8d1c05a33968107a75743b0c54","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-02-05T08:59:56Z","title_canon_sha256":"80901a76c2bfcbd55e84f073a6263acb45468c789123b587ee359bc854404cc2"},"schema_version":"1.0","source":{"id":"1602.03208","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03208","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03208v2","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03208","created_at":"2026-05-18T01:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"D2KVJH4VAH5J","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D2KVJH4VAH5JEP5R","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D2KVJH4V","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:20ff12a22c9e4cc1c4ee10100857acd519245c83146552fced26672ba11c8014","target":"graph","created_at":"2026-05-18T01:15:49Z","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":"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","authors_text":"Andrew Lewis-Pye, George Barmpalias, Nan Fang","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-02-05T08:59:56Z","title":"Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03208","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:b4775fc89d866af2af45129fdddb6be97992d4998a9e62a00d19d9b4767222b7","target":"record","created_at":"2026-05-18T01:15:49Z","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":"b0d276338c1c456202640a5ee2115bb97f3c0c8d1c05a33968107a75743b0c54","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-02-05T08:59:56Z","title_canon_sha256":"80901a76c2bfcbd55e84f073a6263acb45468c789123b587ee359bc854404cc2"},"schema_version":"1.0","source":{"id":"1602.03208","kind":"arxiv","version":2}},"canonical_sha256":"1e95549f9501fa923fb1a7eac8d17e28bf703b9866e88c0babe6d89b44845a64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e95549f9501fa923fb1a7eac8d17e28bf703b9866e88c0babe6d89b44845a64","first_computed_at":"2026-05-18T01:15:49.691298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:49.691298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CRRQUJPsYT5kgkDDKAJO7e5c1jq57l8zOAmYrd1dCZ8uziB1NcRoArs+LodF0GFZCH/p6ifeK86QMN6CUsbtDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:49.691985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03208","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4775fc89d866af2af45129fdddb6be97992d4998a9e62a00d19d9b4767222b7","sha256:20ff12a22c9e4cc1c4ee10100857acd519245c83146552fced26672ba11c8014"],"state_sha256":"611212c660643f571f91a5f7164430596f0bcbabe609b7617265c9b24f2d3677"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bl9xLvjFJCX0pm4t9S+3/0XMc8i77/VRmSSg2ieS948SRAy2g+4FelOz12Hz6yaKgkofUCSZVytYk3bf2xWMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:05:12.490668Z","bundle_sha256":"96e1840877bfc57ceadf5a49c62e14a6f4389dd51c7c6e3132b394c2b1757099"}}