{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EZM22BFCUKNEO3ECCZAU4W4E4J","short_pith_number":"pith:EZM22BFC","schema_version":"1.0","canonical_sha256":"2659ad04a2a29a476c8216414e5b84e26c4e1725539e25fdf98bb8ac62c550f3","source":{"kind":"arxiv","id":"1801.08172","version":2},"attestation_state":"computed","paper":{"title":"The strength of compactness in Computability Theory and Nonstandard Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Dag Normann, Sam Sanders","submitted_at":"2018-01-24T20:10:03Z","abstract_excerpt":"Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\\mathbb{N}}$ for uncountable covers. The most basic question is: how hard is it to compute a finite sub-cover from such a cover of $2^{\\mathbb{N}}$? Another natural question is: how hard is it to compute a sequence that covers $2^{\\mathbb{N}}$ minus a measure zero set from such a cover? The special and weak fan functionals respectively compute such finite sub-covers and sequences. In this pape"},"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":"1801.08172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-01-24T20:10:03Z","cross_cats_sorted":[],"title_canon_sha256":"e2941157e56e42107fa544aed70d678e4285789077c68639affe04b820ae8d6f","abstract_canon_sha256":"83619e6197132c8d3718674e8242e7c3bc7a96a4192cf0eb27120ed99043df6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.043525Z","signature_b64":"E7T21wX9Fwl6Y1MYrMLZHhpiv8PrCF5nWO5XPWlNaUg/yJ+hE2zan94eWoIX+hikzIaHdVA5JUIplmF43j/3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2659ad04a2a29a476c8216414e5b84e26c4e1725539e25fdf98bb8ac62c550f3","last_reissued_at":"2026-05-17T23:45:10.043028Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.043028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The strength of compactness in Computability Theory and Nonstandard Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Dag Normann, Sam Sanders","submitted_at":"2018-01-24T20:10:03Z","abstract_excerpt":"Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\\mathbb{N}}$ for uncountable covers. The most basic question is: how hard is it to compute a finite sub-cover from such a cover of $2^{\\mathbb{N}}$? Another natural question is: how hard is it to compute a sequence that covers $2^{\\mathbb{N}}$ minus a measure zero set from such a cover? The special and weak fan functionals respectively compute such finite sub-covers and sequences. In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08172","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":"1801.08172","created_at":"2026-05-17T23:45:10.043120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08172v2","created_at":"2026-05-17T23:45:10.043120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08172","created_at":"2026-05-17T23:45:10.043120+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZM22BFCUKNE","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZM22BFCUKNEO3EC","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZM22BFC","created_at":"2026-05-18T12:32:22.470017+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/EZM22BFCUKNEO3ECCZAU4W4E4J","json":"https://pith.science/pith/EZM22BFCUKNEO3ECCZAU4W4E4J.json","graph_json":"https://pith.science/api/pith-number/EZM22BFCUKNEO3ECCZAU4W4E4J/graph.json","events_json":"https://pith.science/api/pith-number/EZM22BFCUKNEO3ECCZAU4W4E4J/events.json","paper":"https://pith.science/paper/EZM22BFC"},"agent_actions":{"view_html":"https://pith.science/pith/EZM22BFCUKNEO3ECCZAU4W4E4J","download_json":"https://pith.science/pith/EZM22BFCUKNEO3ECCZAU4W4E4J.json","view_paper":"https://pith.science/paper/EZM22BFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08172&json=true","fetch_graph":"https://pith.science/api/pith-number/EZM22BFCUKNEO3ECCZAU4W4E4J/graph.json","fetch_events":"https://pith.science/api/pith-number/EZM22BFCUKNEO3ECCZAU4W4E4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZM22BFCUKNEO3ECCZAU4W4E4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZM22BFCUKNEO3ECCZAU4W4E4J/action/storage_attestation","attest_author":"https://pith.science/pith/EZM22BFCUKNEO3ECCZAU4W4E4J/action/author_attestation","sign_citation":"https://pith.science/pith/EZM22BFCUKNEO3ECCZAU4W4E4J/action/citation_signature","submit_replication":"https://pith.science/pith/EZM22BFCUKNEO3ECCZAU4W4E4J/action/replication_record"}},"created_at":"2026-05-17T23:45:10.043120+00:00","updated_at":"2026-05-17T23:45:10.043120+00:00"}