{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XBCFPFH2MNUGFUHOQAL2XQCT55","short_pith_number":"pith:XBCFPFH2","schema_version":"1.0","canonical_sha256":"b8445794fa636862d0ee8017abc053ef52535a165705aeab75d9963b5f69116b","source":{"kind":"arxiv","id":"1607.05237","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.05237","created_at":"2026-05-18T00:38:04.359010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05237v4","created_at":"2026-05-18T00:38:04.359010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05237","created_at":"2026-05-18T00:38:04.359010+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBCFPFH2MNUG","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBCFPFH2MNUGFUHO","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBCFPFH2","created_at":"2026-05-18T12:30:51.357362+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/XBCFPFH2MNUGFUHOQAL2XQCT55","json":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55.json","graph_json":"https://pith.science/api/pith-number/XBCFPFH2MNUGFUHOQAL2XQCT55/graph.json","events_json":"https://pith.science/api/pith-number/XBCFPFH2MNUGFUHOQAL2XQCT55/events.json","paper":"https://pith.science/paper/XBCFPFH2"},"agent_actions":{"view_html":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55","download_json":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55.json","view_paper":"https://pith.science/paper/XBCFPFH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05237&json=true","fetch_graph":"https://pith.science/api/pith-number/XBCFPFH2MNUGFUHOQAL2XQCT55/graph.json","fetch_events":"https://pith.science/api/pith-number/XBCFPFH2MNUGFUHOQAL2XQCT55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/action/storage_attestation","attest_author":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/action/author_attestation","sign_citation":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/action/citation_signature","submit_replication":"https://pith.science/pith/XBCFPFH2MNUGFUHOQAL2XQCT55/action/replication_record"}},"created_at":"2026-05-18T00:38:04.359010+00:00","updated_at":"2026-05-18T00:38:04.359010+00:00"}