{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ASFKH55JUOTB2WMH4SWKQ4OOGW","short_pith_number":"pith:ASFKH55J","schema_version":"1.0","canonical_sha256":"048aa3f7a9a3a61d5987e4aca871ce359953e0ce717992f1a679a6a7242be4af","source":{"kind":"arxiv","id":"1510.01913","version":2},"attestation_state":"computed","paper":{"title":"On the Uniform Computational Content of the Baire Category Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Alexander P. Kreuzer, Matthew Hendtlass, Vasco Brattka","submitted_at":"2015-10-07T12:12:50Z","abstract_excerpt":"We study the uniform computational content of different versions of the Baire Category Theorem in the Weihrauch lattice. The Baire Category Theorem can be seen as a pigeonhole principle that states that a complete (i.e., \"large\") metric space cannot be decomposed into countably many nowhere dense (i.e., \"small\") pieces. The Baire Category Theorem is an illuminating example of a theorem that can be used to demonstrate that one classical theorem can have several different computational interpretations. For one, we distinguish two different logical versions of the theorem, where one can be seen a"},"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":"1510.01913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-10-07T12:12:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f70c03a9dcdb6725e8ce1c55f8a7568a05a58aae9e7d3af9536bacb2a7aec3a6","abstract_canon_sha256":"85e88c9ae6e06d69e758c21a71083e60a208267130990c6b1027280756f43f90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:46.055461Z","signature_b64":"MLWeP0x2REscY+h0Eyvh6MRpvwh7r6Rmj+jLtMrFwmDQEGBAIKtrM8ACo4yYgjn2H9aBRrEu3RuHu1/bJbDvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"048aa3f7a9a3a61d5987e4aca871ce359953e0ce717992f1a679a6a7242be4af","last_reissued_at":"2026-05-18T00:00:46.055081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:46.055081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Uniform Computational Content of the Baire Category Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Alexander P. Kreuzer, Matthew Hendtlass, Vasco Brattka","submitted_at":"2015-10-07T12:12:50Z","abstract_excerpt":"We study the uniform computational content of different versions of the Baire Category Theorem in the Weihrauch lattice. The Baire Category Theorem can be seen as a pigeonhole principle that states that a complete (i.e., \"large\") metric space cannot be decomposed into countably many nowhere dense (i.e., \"small\") pieces. The Baire Category Theorem is an illuminating example of a theorem that can be used to demonstrate that one classical theorem can have several different computational interpretations. For one, we distinguish two different logical versions of the theorem, where one can be seen a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01913","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.01913","created_at":"2026-05-18T00:00:46.055141+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01913v2","created_at":"2026-05-18T00:00:46.055141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01913","created_at":"2026-05-18T00:00:46.055141+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASFKH55JUOTB","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASFKH55JUOTB2WMH","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASFKH55J","created_at":"2026-05-18T12:29:10.953037+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/ASFKH55JUOTB2WMH4SWKQ4OOGW","json":"https://pith.science/pith/ASFKH55JUOTB2WMH4SWKQ4OOGW.json","graph_json":"https://pith.science/api/pith-number/ASFKH55JUOTB2WMH4SWKQ4OOGW/graph.json","events_json":"https://pith.science/api/pith-number/ASFKH55JUOTB2WMH4SWKQ4OOGW/events.json","paper":"https://pith.science/paper/ASFKH55J"},"agent_actions":{"view_html":"https://pith.science/pith/ASFKH55JUOTB2WMH4SWKQ4OOGW","download_json":"https://pith.science/pith/ASFKH55JUOTB2WMH4SWKQ4OOGW.json","view_paper":"https://pith.science/paper/ASFKH55J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01913&json=true","fetch_graph":"https://pith.science/api/pith-number/ASFKH55JUOTB2WMH4SWKQ4OOGW/graph.json","fetch_events":"https://pith.science/api/pith-number/ASFKH55JUOTB2WMH4SWKQ4OOGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASFKH55JUOTB2WMH4SWKQ4OOGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASFKH55JUOTB2WMH4SWKQ4OOGW/action/storage_attestation","attest_author":"https://pith.science/pith/ASFKH55JUOTB2WMH4SWKQ4OOGW/action/author_attestation","sign_citation":"https://pith.science/pith/ASFKH55JUOTB2WMH4SWKQ4OOGW/action/citation_signature","submit_replication":"https://pith.science/pith/ASFKH55JUOTB2WMH4SWKQ4OOGW/action/replication_record"}},"created_at":"2026-05-18T00:00:46.055141+00:00","updated_at":"2026-05-18T00:00:46.055141+00:00"}