{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YUGQCJ434KQ5OUGEVEO75B5EIT","short_pith_number":"pith:YUGQCJ43","canonical_record":{"source":{"id":"1612.07400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-22T00:28:59Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"a5e372637567b2c892d856ee007d4a8e535bad812a06b0b3cb8b66ee630c6382","abstract_canon_sha256":"d20ddcb814e7f832f689c20d407602f0036dc8512db6b084805412f0ce0598ae"},"schema_version":"1.0"},"canonical_sha256":"c50d01279be2a1d750c4a91dfe87a444c514bb3566fb58826c0c00d47f728730","source":{"kind":"arxiv","id":"1612.07400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07400","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07400v1","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07400","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"YUGQCJ434KQ5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YUGQCJ434KQ5OUGE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YUGQCJ43","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YUGQCJ434KQ5OUGEVEO75B5EIT","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-22T00:28:59Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"a5e372637567b2c892d856ee007d4a8e535bad812a06b0b3cb8b66ee630c6382","abstract_canon_sha256":"d20ddcb814e7f832f689c20d407602f0036dc8512db6b084805412f0ce0598ae"},"schema_version":"1.0"},"canonical_sha256":"c50d01279be2a1d750c4a91dfe87a444c514bb3566fb58826c0c00d47f728730","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:10.105923Z","signature_b64":"BJp2sw40Ia/lmTOLqIXqUtAE7qb89qkgCbv/DF6Wagdny0o1TRUInE8Kyb8m/X39yZudr5rXAT/uIqC1ytdoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c50d01279be2a1d750c4a91dfe87a444c514bb3566fb58826c0c00d47f728730","last_reissued_at":"2026-05-18T00:54:10.105455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:10.105455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07400","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-18T00:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DzDIuMuApp/CIdyKbsO7a3BkmzZq712W+XyaEE+Y5VAu0p8SR7KHF2VZEkA3yVjmp78tJ2bquhPl6ajv2QGJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:20:42.857620Z"},"content_sha256":"28d4699fc187626095e5f1a03eedafa96ad5fd96be6dec1306ed7816d2a2cc2f","schema_version":"1.0","event_id":"sha256:28d4699fc187626095e5f1a03eedafa96ad5fd96be6dec1306ed7816d2a2cc2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YUGQCJ434KQ5OUGEVEO75B5EIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The \"paradox\" of computability and a recursive relative version of the Busy Beaver function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Felipe S. Abrah\\~ao","submitted_at":"2016-12-22T00:28:59Z","abstract_excerpt":"In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy Beaver function which we will call Busy Beaver Plus function. Therefore, we will prove that the computable Busy Beaver Plus function defined on any Turing submachine is not computable by any program running on this submachine. We will thereby demonstrate the existence of a \"paradox\" of computability a la Skolem: a function is computable when \"seen from the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07400","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-18T00:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"szfVI8mQNxgJl/mDgHK1SzSNImXu0gmG/OKjgvAGGUoabrCPUpDRzZ8g+bO9XR1q9tBusQr4YzuVcYlf7wGTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:20:42.857976Z"},"content_sha256":"0f757f3aadc0c3ddfa6ef06f601ec56fa1420c8d5d33eafb401b8c78bc014c3f","schema_version":"1.0","event_id":"sha256:0f757f3aadc0c3ddfa6ef06f601ec56fa1420c8d5d33eafb401b8c78bc014c3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/bundle.json","state_url":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/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-05T10:20:42Z","links":{"resolver":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT","bundle":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/bundle.json","state":"https://pith.science/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YUGQCJ434KQ5OUGEVEO75B5EIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YUGQCJ434KQ5OUGEVEO75B5EIT","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":"d20ddcb814e7f832f689c20d407602f0036dc8512db6b084805412f0ce0598ae","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-22T00:28:59Z","title_canon_sha256":"a5e372637567b2c892d856ee007d4a8e535bad812a06b0b3cb8b66ee630c6382"},"schema_version":"1.0","source":{"id":"1612.07400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07400","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07400v1","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07400","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"YUGQCJ434KQ5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YUGQCJ434KQ5OUGE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YUGQCJ43","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:0f757f3aadc0c3ddfa6ef06f601ec56fa1420c8d5d33eafb401b8c78bc014c3f","target":"graph","created_at":"2026-05-18T00:54: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":"In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy Beaver function which we will call Busy Beaver Plus function. Therefore, we will prove that the computable Busy Beaver Plus function defined on any Turing submachine is not computable by any program running on this submachine. We will thereby demonstrate the existence of a \"paradox\" of computability a la Skolem: a function is computable when \"seen from the ","authors_text":"Felipe S. Abrah\\~ao","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-22T00:28:59Z","title":"The \"paradox\" of computability and a recursive relative version of the Busy Beaver function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07400","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:28d4699fc187626095e5f1a03eedafa96ad5fd96be6dec1306ed7816d2a2cc2f","target":"record","created_at":"2026-05-18T00:54: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":"d20ddcb814e7f832f689c20d407602f0036dc8512db6b084805412f0ce0598ae","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-22T00:28:59Z","title_canon_sha256":"a5e372637567b2c892d856ee007d4a8e535bad812a06b0b3cb8b66ee630c6382"},"schema_version":"1.0","source":{"id":"1612.07400","kind":"arxiv","version":1}},"canonical_sha256":"c50d01279be2a1d750c4a91dfe87a444c514bb3566fb58826c0c00d47f728730","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c50d01279be2a1d750c4a91dfe87a444c514bb3566fb58826c0c00d47f728730","first_computed_at":"2026-05-18T00:54:10.105455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:10.105455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BJp2sw40Ia/lmTOLqIXqUtAE7qb89qkgCbv/DF6Wagdny0o1TRUInE8Kyb8m/X39yZudr5rXAT/uIqC1ytdoDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:10.105923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28d4699fc187626095e5f1a03eedafa96ad5fd96be6dec1306ed7816d2a2cc2f","sha256:0f757f3aadc0c3ddfa6ef06f601ec56fa1420c8d5d33eafb401b8c78bc014c3f"],"state_sha256":"7be0e0c99444be876fcfc5ff3a1ab0c41a48d74c51a3d7ff22f4fadfa6bc1512"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZCGTFMhcT6CulBW44eLLo3WucWN6q5kz3M0MtVFj567J6wSn+fOQwqWZ8FR9e22FsHh52K6xGhyelRo74ybBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:20:42.859937Z","bundle_sha256":"e5c0d817d5ca74d5a65efcb64758134132a46ee6e34d21e127262b71a6c87b16"}}