{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TKMZHXM5O6MONJHHQGMFL4XJR5","short_pith_number":"pith:TKMZHXM5","schema_version":"1.0","canonical_sha256":"9a9993dd9d7798e6a4e7819855f2e98f64e027dd5770ce4e4c316b22d33e9e35","source":{"kind":"arxiv","id":"1906.10087","version":2},"attestation_state":"computed","paper":{"title":"A Note on Clockability for Ordinal Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Merlin Carl","submitted_at":"2019-06-24T17:08:48Z","abstract_excerpt":"We study clockability for Ordinal Turing Machines (OTMs). In particular, we show that, in contrast to the situation for ITTMs, admissible ordinals can be OTM-clockable, that $\\Sigma_{2}$-admissible ordinals are never OTM-clockable and that gaps in the OTM-clockable ordinals are always started by admissible limits of admissible ordinals."},"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":"1906.10087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-06-24T17:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"623c2a79042c3d5d971036b531032e7b1ec7a7377c646683996f2d0d46ee8cc3","abstract_canon_sha256":"4839ba3da35c215233f7a851d0b803e4dab071106cce6e2910cfb6a93d251508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:18.314232Z","signature_b64":"DawDc9nu0xBlWqpzVbHAOHlL7EByYBOMceiiEfZghPhfXDHseXLLcsTA5jyo1azu7ILYqcl5zO1vBFQmoJf0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a9993dd9d7798e6a4e7819855f2e98f64e027dd5770ce4e4c316b22d33e9e35","last_reissued_at":"2026-05-17T23:42:18.313802Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:18.313802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Clockability for Ordinal Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Merlin Carl","submitted_at":"2019-06-24T17:08:48Z","abstract_excerpt":"We study clockability for Ordinal Turing Machines (OTMs). In particular, we show that, in contrast to the situation for ITTMs, admissible ordinals can be OTM-clockable, that $\\Sigma_{2}$-admissible ordinals are never OTM-clockable and that gaps in the OTM-clockable ordinals are always started by admissible limits of admissible ordinals."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10087","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":"1906.10087","created_at":"2026-05-17T23:42:18.313863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10087v2","created_at":"2026-05-17T23:42:18.313863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10087","created_at":"2026-05-17T23:42:18.313863+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKMZHXM5O6MO","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKMZHXM5O6MONJHH","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKMZHXM5","created_at":"2026-05-18T12:33:30.264802+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/TKMZHXM5O6MONJHHQGMFL4XJR5","json":"https://pith.science/pith/TKMZHXM5O6MONJHHQGMFL4XJR5.json","graph_json":"https://pith.science/api/pith-number/TKMZHXM5O6MONJHHQGMFL4XJR5/graph.json","events_json":"https://pith.science/api/pith-number/TKMZHXM5O6MONJHHQGMFL4XJR5/events.json","paper":"https://pith.science/paper/TKMZHXM5"},"agent_actions":{"view_html":"https://pith.science/pith/TKMZHXM5O6MONJHHQGMFL4XJR5","download_json":"https://pith.science/pith/TKMZHXM5O6MONJHHQGMFL4XJR5.json","view_paper":"https://pith.science/paper/TKMZHXM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10087&json=true","fetch_graph":"https://pith.science/api/pith-number/TKMZHXM5O6MONJHHQGMFL4XJR5/graph.json","fetch_events":"https://pith.science/api/pith-number/TKMZHXM5O6MONJHHQGMFL4XJR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKMZHXM5O6MONJHHQGMFL4XJR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKMZHXM5O6MONJHHQGMFL4XJR5/action/storage_attestation","attest_author":"https://pith.science/pith/TKMZHXM5O6MONJHHQGMFL4XJR5/action/author_attestation","sign_citation":"https://pith.science/pith/TKMZHXM5O6MONJHHQGMFL4XJR5/action/citation_signature","submit_replication":"https://pith.science/pith/TKMZHXM5O6MONJHHQGMFL4XJR5/action/replication_record"}},"created_at":"2026-05-17T23:42:18.313863+00:00","updated_at":"2026-05-17T23:42:18.313863+00:00"}