{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6KWWG3K3E7ISKS7O54Q7HR4OCD","short_pith_number":"pith:6KWWG3K3","schema_version":"1.0","canonical_sha256":"f2ad636d5b27d1254beeef21f3c78e10d63b7ad229d223540861da29421ce447","source":{"kind":"arxiv","id":"1704.02884","version":1},"attestation_state":"computed","paper":{"title":"Towards computable analysis on the generalised real line","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Hugo Nobrega, Lorenzo Galeotti","submitted_at":"2017-04-10T14:40:57Z","abstract_excerpt":"In this paper we use infinitary Turing machines with tapes of length $\\kappa$ and which run for time $\\kappa$ as presented, e.g., by Koepke \\& Seyfferth, to generalise the notion of type two computability to $2^{\\kappa}$, where $\\kappa$ is an uncountable cardinal with $\\kappa^{<\\kappa}=\\kappa$. Then we start the study of the computational properties of $\\mathbb{R}_\\kappa$, a real closed field extension of $\\mathbb{R}$ of cardinality $2^{\\kappa}$, defined by the first author using surreal numbers and proposed as the candidate for generalising real analysis. In particular we introduce representa"},"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":"1704.02884","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.LO","submitted_at":"2017-04-10T14:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"fe4894e96adc97d499d4316be905b82892b5c23f1e00b28621f9fa3b17ba3416","abstract_canon_sha256":"ccc35d43c4375188e896c367c90a7ef811e397f0df2bdb390a0a4722f3e945ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:43.780547Z","signature_b64":"Yi2Zj6/+FfJiAUL5lhLUpriIOMDW7GM9efo1IjliaVKCyU51Im/KLh7TrN6ZIE+LxaDiAy9VuRRWoL2Bt/TqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2ad636d5b27d1254beeef21f3c78e10d63b7ad229d223540861da29421ce447","last_reissued_at":"2026-05-18T00:46:43.779969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:43.779969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards computable analysis on the generalised real line","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Hugo Nobrega, Lorenzo Galeotti","submitted_at":"2017-04-10T14:40:57Z","abstract_excerpt":"In this paper we use infinitary Turing machines with tapes of length $\\kappa$ and which run for time $\\kappa$ as presented, e.g., by Koepke \\& Seyfferth, to generalise the notion of type two computability to $2^{\\kappa}$, where $\\kappa$ is an uncountable cardinal with $\\kappa^{<\\kappa}=\\kappa$. Then we start the study of the computational properties of $\\mathbb{R}_\\kappa$, a real closed field extension of $\\mathbb{R}$ of cardinality $2^{\\kappa}$, defined by the first author using surreal numbers and proposed as the candidate for generalising real analysis. In particular we introduce representa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02884","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.02884","created_at":"2026-05-18T00:46:43.780059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02884v1","created_at":"2026-05-18T00:46:43.780059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02884","created_at":"2026-05-18T00:46:43.780059+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KWWG3K3E7IS","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KWWG3K3E7ISKS7O","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KWWG3K3","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04412","citing_title":"On Conway's Numbers and Games, the Von Neumann Universe, and Pure Set Theory","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6KWWG3K3E7ISKS7O54Q7HR4OCD","json":"https://pith.science/pith/6KWWG3K3E7ISKS7O54Q7HR4OCD.json","graph_json":"https://pith.science/api/pith-number/6KWWG3K3E7ISKS7O54Q7HR4OCD/graph.json","events_json":"https://pith.science/api/pith-number/6KWWG3K3E7ISKS7O54Q7HR4OCD/events.json","paper":"https://pith.science/paper/6KWWG3K3"},"agent_actions":{"view_html":"https://pith.science/pith/6KWWG3K3E7ISKS7O54Q7HR4OCD","download_json":"https://pith.science/pith/6KWWG3K3E7ISKS7O54Q7HR4OCD.json","view_paper":"https://pith.science/paper/6KWWG3K3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02884&json=true","fetch_graph":"https://pith.science/api/pith-number/6KWWG3K3E7ISKS7O54Q7HR4OCD/graph.json","fetch_events":"https://pith.science/api/pith-number/6KWWG3K3E7ISKS7O54Q7HR4OCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KWWG3K3E7ISKS7O54Q7HR4OCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KWWG3K3E7ISKS7O54Q7HR4OCD/action/storage_attestation","attest_author":"https://pith.science/pith/6KWWG3K3E7ISKS7O54Q7HR4OCD/action/author_attestation","sign_citation":"https://pith.science/pith/6KWWG3K3E7ISKS7O54Q7HR4OCD/action/citation_signature","submit_replication":"https://pith.science/pith/6KWWG3K3E7ISKS7O54Q7HR4OCD/action/replication_record"}},"created_at":"2026-05-18T00:46:43.780059+00:00","updated_at":"2026-05-18T00:46:43.780059+00:00"}