{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IWQWPI3U4NLIJZ5RBXKZWGE6CU","short_pith_number":"pith:IWQWPI3U","canonical_record":{"source":{"id":"1409.5052","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-17T16:21:39Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"998f9dd23f79b914196a0f3dfe60723cd244132bf0577e5e8613389e00aceb4b","abstract_canon_sha256":"53be9a778f0cafed509315b0dde77ab4ee58ee8992808eea6aed4734c1f87d8e"},"schema_version":"1.0"},"canonical_sha256":"45a167a374e35684e7b10dd59b189e153166a59e2991799793670b8a09ea2312","source":{"kind":"arxiv","id":"1409.5052","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5052","created_at":"2026-05-18T02:42:36Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5052v2","created_at":"2026-05-18T02:42:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5052","created_at":"2026-05-18T02:42:36Z"},{"alias_kind":"pith_short_12","alias_value":"IWQWPI3U4NLI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IWQWPI3U4NLIJZ5R","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IWQWPI3U","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IWQWPI3U4NLIJZ5RBXKZWGE6CU","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5052","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-17T16:21:39Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"998f9dd23f79b914196a0f3dfe60723cd244132bf0577e5e8613389e00aceb4b","abstract_canon_sha256":"53be9a778f0cafed509315b0dde77ab4ee58ee8992808eea6aed4734c1f87d8e"},"schema_version":"1.0"},"canonical_sha256":"45a167a374e35684e7b10dd59b189e153166a59e2991799793670b8a09ea2312","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:36.683360Z","signature_b64":"qtDk2pPrHVyOVTLMn1ms1CGwX/A6hgTJ8QT4Ud1NmpdTnX0K98jYJAMm0zEp5bN7kErddXeCxOYAPsqVM/6zDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45a167a374e35684e7b10dd59b189e153166a59e2991799793670b8a09ea2312","last_reissued_at":"2026-05-18T02:42:36.682807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:36.682807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5052","source_version":2,"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-18T02:42:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TniRL2VRWqo8p7MpAhklL3goDytw0ds+rkjMU3Gg5GyENOYXQHUqKB91jx6cRwBzzTG+Xc3/YaAF650DHxveBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:09:16.063070Z"},"content_sha256":"85acea67e184194bf28a48eff80593861730678011b6396b1d6bdf59f73378f2","schema_version":"1.0","event_id":"sha256:85acea67e184194bf28a48eff80593861730678011b6396b1d6bdf59f73378f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IWQWPI3U4NLIJZ5RBXKZWGE6CU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrete Transfinite Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Philip Welch","submitted_at":"2014-09-17T16:21:39Z","abstract_excerpt":"We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have longer tapes than the standard model, or that work on ordinals rather than numbers. We outline the connections between such models and the older theories of recursion in higher types, generalized recursion theory, and recursion on ordinals such as $\\alpha$-recursion. We conclude that, in particular, polynomial time computation on $\\omega$-strings is well modelled"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5052","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"},"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-18T02:42:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dr9LTllRaqBjb50nU+FjO2tN7jN5bJxxf5q6iPu3koJUY7aMMkKWbDxOwXTKlnoxtNNPLtfSuSEuSOU9WHGSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:09:16.063751Z"},"content_sha256":"c85e848c16dd7f039ed740436a65f768a5cb137faeaaf0d614ec987eea8b88b8","schema_version":"1.0","event_id":"sha256:c85e848c16dd7f039ed740436a65f768a5cb137faeaaf0d614ec987eea8b88b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWQWPI3U4NLIJZ5RBXKZWGE6CU/bundle.json","state_url":"https://pith.science/pith/IWQWPI3U4NLIJZ5RBXKZWGE6CU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWQWPI3U4NLIJZ5RBXKZWGE6CU/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-06-05T03:09:16Z","links":{"resolver":"https://pith.science/pith/IWQWPI3U4NLIJZ5RBXKZWGE6CU","bundle":"https://pith.science/pith/IWQWPI3U4NLIJZ5RBXKZWGE6CU/bundle.json","state":"https://pith.science/pith/IWQWPI3U4NLIJZ5RBXKZWGE6CU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWQWPI3U4NLIJZ5RBXKZWGE6CU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IWQWPI3U4NLIJZ5RBXKZWGE6CU","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":"53be9a778f0cafed509315b0dde77ab4ee58ee8992808eea6aed4734c1f87d8e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-17T16:21:39Z","title_canon_sha256":"998f9dd23f79b914196a0f3dfe60723cd244132bf0577e5e8613389e00aceb4b"},"schema_version":"1.0","source":{"id":"1409.5052","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5052","created_at":"2026-05-18T02:42:36Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5052v2","created_at":"2026-05-18T02:42:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5052","created_at":"2026-05-18T02:42:36Z"},{"alias_kind":"pith_short_12","alias_value":"IWQWPI3U4NLI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IWQWPI3U4NLIJZ5R","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IWQWPI3U","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:c85e848c16dd7f039ed740436a65f768a5cb137faeaaf0d614ec987eea8b88b8","target":"graph","created_at":"2026-05-18T02:42:36Z","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":"We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have longer tapes than the standard model, or that work on ordinals rather than numbers. We outline the connections between such models and the older theories of recursion in higher types, generalized recursion theory, and recursion on ordinals such as $\\alpha$-recursion. We conclude that, in particular, polynomial time computation on $\\omega$-strings is well modelled","authors_text":"Philip Welch","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-17T16:21:39Z","title":"Discrete Transfinite Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5052","kind":"arxiv","version":2},"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:85acea67e184194bf28a48eff80593861730678011b6396b1d6bdf59f73378f2","target":"record","created_at":"2026-05-18T02:42:36Z","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":"53be9a778f0cafed509315b0dde77ab4ee58ee8992808eea6aed4734c1f87d8e","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-09-17T16:21:39Z","title_canon_sha256":"998f9dd23f79b914196a0f3dfe60723cd244132bf0577e5e8613389e00aceb4b"},"schema_version":"1.0","source":{"id":"1409.5052","kind":"arxiv","version":2}},"canonical_sha256":"45a167a374e35684e7b10dd59b189e153166a59e2991799793670b8a09ea2312","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45a167a374e35684e7b10dd59b189e153166a59e2991799793670b8a09ea2312","first_computed_at":"2026-05-18T02:42:36.682807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:36.682807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qtDk2pPrHVyOVTLMn1ms1CGwX/A6hgTJ8QT4Ud1NmpdTnX0K98jYJAMm0zEp5bN7kErddXeCxOYAPsqVM/6zDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:36.683360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5052","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85acea67e184194bf28a48eff80593861730678011b6396b1d6bdf59f73378f2","sha256:c85e848c16dd7f039ed740436a65f768a5cb137faeaaf0d614ec987eea8b88b8"],"state_sha256":"d8047eb57541bad0232bbc46a539a57ea9c071cf746065ef64636b9cb647b0ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qk8kmrvqrWSGzJcBLXGc5s6Tw7G5/EC/Uso/8ynyf48ZYZhg+t39zmC7G6C9DRgJ3cOMUfX4dspFSrYyBUzwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:09:16.066704Z","bundle_sha256":"8e4080986e4233d452e406c5cc99e6358f45981e772f40917bf808ab36df0016"}}