{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XBCFPFH2MNUGFUHOQAL2XQCT55","short_pith_number":"pith:XBCFPFH2","canonical_record":{"source":{"id":"1607.05237","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-18T18:46:14Z","cross_cats_sorted":[],"title_canon_sha256":"70aed797d65fcffcb01b6838a2d34b75d5129f55dad6f243101a5ed67572b194","abstract_canon_sha256":"9bd3312cb0df3b310374832e3785bf6550a60a6fd02afbdb3ef8b5a35e8b7fa2"},"schema_version":"1.0"},"canonical_sha256":"b8445794fa636862d0ee8017abc053ef52535a165705aeab75d9963b5f69116b","source":{"kind":"arxiv","id":"1607.05237","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05237","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05237v4","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05237","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"XBCFPFH2MNUG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XBCFPFH2MNUGFUHO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XBCFPFH2","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XBCFPFH2MNUGFUHOQAL2XQCT55","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05237","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-18T18:46:14Z","cross_cats_sorted":[],"title_canon_sha256":"70aed797d65fcffcb01b6838a2d34b75d5129f55dad6f243101a5ed67572b194","abstract_canon_sha256":"9bd3312cb0df3b310374832e3785bf6550a60a6fd02afbdb3ef8b5a35e8b7fa2"},"schema_version":"1.0"},"canonical_sha256":"b8445794fa636862d0ee8017abc053ef52535a165705aeab75d9963b5f69116b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:04.359440Z","signature_b64":"gHQ8+alxm5nJHSpe8CTbPyN5hMMtsO4i6nJ2zm49yKeLfvQoG+2TyuKuFU7NqCBBG427106zY9cyF4VY9ZCaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8445794fa636862d0ee8017abc053ef52535a165705aeab75d9963b5f69116b","last_reissued_at":"2026-05-18T00:38:04.358930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:04.358930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05237","source_version":4,"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:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QFVGqBDXOTePFxrNWZ3JbLZtUtqDAU9MiMGvvGfY5JxEh4NV+F25FP5mttEAAU7Op4EkOgynIU0irfC8JDrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:50:53.472107Z"},"content_sha256":"cffb42e8f1421e52f8a785f5798416831df6c751cc1b5eea143b0d7e775fd1ae","schema_version":"1.0","event_id":"sha256:cffb42e8f1421e52f8a785f5798416831df6c751cc1b5eea143b0d7e775fd1ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XBCFPFH2MNUGFUHOQAL2XQCT55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Paulo Oliva, Silvia Steila","submitted_at":"2016-07-18T18:46:14Z","abstract_excerpt":"In 1979 Schwichtenberg showed that the System $\\text{T}$ definable functionals are closed under a rule-like version Spector's bar recursion of lowest type levels $0$ and $1$. More precisely, if the functional $Y$ which controls the stopping condition of Spector's bar recursor is $\\text{T}$-definable, then the corresponding bar recursion of type levels $0$ and $1$ is already $\\text{T}$-definable. Schwichtenberg's original proof, however, relies on a detour through Tait's infinitary terms and the correspondence between ordinal recursion for $\\alpha < \\varepsilon_0$ and primitive recursion over f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05237","kind":"arxiv","version":4},"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:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1iXP8Zc+ZicKChrehq8cdYC8fIpkGz2BngNm1pVC1L5h1O/PYywRMDd6WgE4s0h7QJtqRLCM9/zLa1PeVEN6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:50:53.472767Z"},"content_sha256":"59ab7e34f23b8f04be0d08240d61b70a6d4287d2480a7f7f3b1517c6af51e592","schema_version":"1.0","event_id":"sha256:59ab7e34f23b8f04be0d08240d61b70a6d4287d2480a7f7f3b1517c6af51e592"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/bundle.json","state_url":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/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-05-31T07:50:53Z","links":{"resolver":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55","bundle":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/bundle.json","state":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XBCFPFH2MNUGFUHOQAL2XQCT55","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":"9bd3312cb0df3b310374832e3785bf6550a60a6fd02afbdb3ef8b5a35e8b7fa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-18T18:46:14Z","title_canon_sha256":"70aed797d65fcffcb01b6838a2d34b75d5129f55dad6f243101a5ed67572b194"},"schema_version":"1.0","source":{"id":"1607.05237","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05237","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05237v4","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05237","created_at":"2026-05-18T00:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"XBCFPFH2MNUG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XBCFPFH2MNUGFUHO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XBCFPFH2","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:59ab7e34f23b8f04be0d08240d61b70a6d4287d2480a7f7f3b1517c6af51e592","target":"graph","created_at":"2026-05-18T00:38:04Z","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 1979 Schwichtenberg showed that the System $\\text{T}$ definable functionals are closed under a rule-like version Spector's bar recursion of lowest type levels $0$ and $1$. More precisely, if the functional $Y$ which controls the stopping condition of Spector's bar recursor is $\\text{T}$-definable, then the corresponding bar recursion of type levels $0$ and $1$ is already $\\text{T}$-definable. Schwichtenberg's original proof, however, relies on a detour through Tait's infinitary terms and the correspondence between ordinal recursion for $\\alpha < \\varepsilon_0$ and primitive recursion over f","authors_text":"Paulo Oliva, Silvia Steila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-18T18:46:14Z","title":"A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05237","kind":"arxiv","version":4},"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:cffb42e8f1421e52f8a785f5798416831df6c751cc1b5eea143b0d7e775fd1ae","target":"record","created_at":"2026-05-18T00:38:04Z","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":"9bd3312cb0df3b310374832e3785bf6550a60a6fd02afbdb3ef8b5a35e8b7fa2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-07-18T18:46:14Z","title_canon_sha256":"70aed797d65fcffcb01b6838a2d34b75d5129f55dad6f243101a5ed67572b194"},"schema_version":"1.0","source":{"id":"1607.05237","kind":"arxiv","version":4}},"canonical_sha256":"b8445794fa636862d0ee8017abc053ef52535a165705aeab75d9963b5f69116b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8445794fa636862d0ee8017abc053ef52535a165705aeab75d9963b5f69116b","first_computed_at":"2026-05-18T00:38:04.358930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:04.358930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gHQ8+alxm5nJHSpe8CTbPyN5hMMtsO4i6nJ2zm49yKeLfvQoG+2TyuKuFU7NqCBBG427106zY9cyF4VY9ZCaBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:04.359440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05237","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cffb42e8f1421e52f8a785f5798416831df6c751cc1b5eea143b0d7e775fd1ae","sha256:59ab7e34f23b8f04be0d08240d61b70a6d4287d2480a7f7f3b1517c6af51e592"],"state_sha256":"45d497f01bd20beafc334dfd6fdcd8dbabc1a64aefc97b8ac146d12cedc2212d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvgohhBuXuVO8EFeKJGcUw4TyCkrTsqh1cJm4fu55+rTGTKEL1shWH9+NpOUZ7vFfDJiB00ZcrA/WzCtZThEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:50:53.476099Z","bundle_sha256":"4d76e5b809cb1c7c498155b1a1e3e38054e4c85e7e5bd24d071e02a049bf6476"}}