{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DMOESLWSDRFCKHCW6NLOU4TU2R","short_pith_number":"pith:DMOESLWS","canonical_record":{"source":{"id":"1612.05221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-15T20:15:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3ae7e8bb24e2f76b211e7173d1afe7305dd87049649f98f79ade18326a909d23","abstract_canon_sha256":"8da331b50e54e3bbbf11b89585f01d1c8ff37c00051135d1dac3c355395d301d"},"schema_version":"1.0"},"canonical_sha256":"1b1c492ed21c4a251c56f356ea7274d4690b56fbd134b03ff0dc4cea1d3d6e59","source":{"kind":"arxiv","id":"1612.05221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05221","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05221v1","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05221","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"DMOESLWSDRFC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMOESLWSDRFCKHCW","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMOESLWS","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DMOESLWSDRFCKHCW6NLOU4TU2R","target":"record","payload":{"canonical_record":{"source":{"id":"1612.05221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-15T20:15:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3ae7e8bb24e2f76b211e7173d1afe7305dd87049649f98f79ade18326a909d23","abstract_canon_sha256":"8da331b50e54e3bbbf11b89585f01d1c8ff37c00051135d1dac3c355395d301d"},"schema_version":"1.0"},"canonical_sha256":"1b1c492ed21c4a251c56f356ea7274d4690b56fbd134b03ff0dc4cea1d3d6e59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:53.229120Z","signature_b64":"j0/XCQ23zDbDoD0iVtBt4fejGhRErWJDCgHy2pCYePmCEfMSCY2HSKJZ+wsCeY4EejAEmXAaLpwyFnq5W3rGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b1c492ed21c4a251c56f356ea7274d4690b56fbd134b03ff0dc4cea1d3d6e59","last_reissued_at":"2026-05-18T00:54:53.228524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:53.228524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.05221","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:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9u62EHEYpIhZpth8MRtSBfbOdThVlD1cFXSHOiE5XTu3+704gM3/p378oeNejK70UgfX45Xfq2CbU6bbKVDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:13:41.170962Z"},"content_sha256":"a8c42e09bb2fea4760ff2949ea4ae72664ebceb974b64c52d0650d68fed84da9","schema_version":"1.0","event_id":"sha256:a8c42e09bb2fea4760ff2949ea4ae72664ebceb974b64c52d0650d68fed84da9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DMOESLWSDRFCKHCW6NLOU4TU2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relativizing an incompressible number and an incompressible function through subrecursive extensions of Turing machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Brazil), Felipe S. Abrah\\~ao (National Laboratory for Scientific Computing (LNCC)","submitted_at":"2016-12-15T20:15:58Z","abstract_excerpt":"We show in this article that uncomputability is also a relative property of subrecursive classes built on a recursive relative incompressible function, which acts as a higher-order \"yardstick\" of irreducible information for the respective subrecursive class. We define the concept of a Turing submachine, and a recursive relative version for the Busy Beaver function and for the halting probability (or Chaitin's constant) Omega; respectively the Busy Beaver Plus (BBP) function and a time-bounded halting probability. Therefore, we prove that the computable BBP function defined on any Turing submac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05221","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:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhId0y+tJdbGzOhHizrHlQqZGkNP3JLfURYWJ6BEkW308WxWLoeQC/oK85SknqDnrWiO8vhGxqXHLBmXV50KAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:13:41.171313Z"},"content_sha256":"ffa12b33c69a918e84d8529675001a3b25bc6fbdbe9fc5626d2ef11a9222d2d6","schema_version":"1.0","event_id":"sha256:ffa12b33c69a918e84d8529675001a3b25bc6fbdbe9fc5626d2ef11a9222d2d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMOESLWSDRFCKHCW6NLOU4TU2R/bundle.json","state_url":"https://pith.science/pith/DMOESLWSDRFCKHCW6NLOU4TU2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMOESLWSDRFCKHCW6NLOU4TU2R/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-09T13:13:41Z","links":{"resolver":"https://pith.science/pith/DMOESLWSDRFCKHCW6NLOU4TU2R","bundle":"https://pith.science/pith/DMOESLWSDRFCKHCW6NLOU4TU2R/bundle.json","state":"https://pith.science/pith/DMOESLWSDRFCKHCW6NLOU4TU2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMOESLWSDRFCKHCW6NLOU4TU2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DMOESLWSDRFCKHCW6NLOU4TU2R","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":"8da331b50e54e3bbbf11b89585f01d1c8ff37c00051135d1dac3c355395d301d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-15T20:15:58Z","title_canon_sha256":"3ae7e8bb24e2f76b211e7173d1afe7305dd87049649f98f79ade18326a909d23"},"schema_version":"1.0","source":{"id":"1612.05221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.05221","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.05221v1","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05221","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"DMOESLWSDRFC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMOESLWSDRFCKHCW","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMOESLWS","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:ffa12b33c69a918e84d8529675001a3b25bc6fbdbe9fc5626d2ef11a9222d2d6","target":"graph","created_at":"2026-05-18T00:54:53Z","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":"We show in this article that uncomputability is also a relative property of subrecursive classes built on a recursive relative incompressible function, which acts as a higher-order \"yardstick\" of irreducible information for the respective subrecursive class. We define the concept of a Turing submachine, and a recursive relative version for the Busy Beaver function and for the halting probability (or Chaitin's constant) Omega; respectively the Busy Beaver Plus (BBP) function and a time-bounded halting probability. Therefore, we prove that the computable BBP function defined on any Turing submac","authors_text":"Brazil), Felipe S. Abrah\\~ao (National Laboratory for Scientific Computing (LNCC)","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-15T20:15:58Z","title":"Relativizing an incompressible number and an incompressible function through subrecursive extensions of Turing machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05221","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:a8c42e09bb2fea4760ff2949ea4ae72664ebceb974b64c52d0650d68fed84da9","target":"record","created_at":"2026-05-18T00:54:53Z","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":"8da331b50e54e3bbbf11b89585f01d1c8ff37c00051135d1dac3c355395d301d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-15T20:15:58Z","title_canon_sha256":"3ae7e8bb24e2f76b211e7173d1afe7305dd87049649f98f79ade18326a909d23"},"schema_version":"1.0","source":{"id":"1612.05221","kind":"arxiv","version":1}},"canonical_sha256":"1b1c492ed21c4a251c56f356ea7274d4690b56fbd134b03ff0dc4cea1d3d6e59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b1c492ed21c4a251c56f356ea7274d4690b56fbd134b03ff0dc4cea1d3d6e59","first_computed_at":"2026-05-18T00:54:53.228524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:53.228524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j0/XCQ23zDbDoD0iVtBt4fejGhRErWJDCgHy2pCYePmCEfMSCY2HSKJZ+wsCeY4EejAEmXAaLpwyFnq5W3rGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:53.229120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.05221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8c42e09bb2fea4760ff2949ea4ae72664ebceb974b64c52d0650d68fed84da9","sha256:ffa12b33c69a918e84d8529675001a3b25bc6fbdbe9fc5626d2ef11a9222d2d6"],"state_sha256":"0b3856fd8c89a7b3a00b26ae814bbaab91b2bf917c14fd73bd1fc096efa0a65b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMdBD7vGzUA9gRWGnXZ6739MXD5Hah7VBOSY4+xw1WGAAtMB0ymR1O6KRgvaAbhsHPQbg2CrlkjIBMKiGRz8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:13:41.173551Z","bundle_sha256":"448afb54b5c8b0c7f0fe5737918439c3e002e3abb227ef8ecae4a9e78cc1f609"}}