{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FH5M3AI4S4P3GHR6ISK5YHQ5N6","short_pith_number":"pith:FH5M3AI4","schema_version":"1.0","canonical_sha256":"29facd811c971fb31e3e4495dc1e1d6f8ec68724abe975f2005c0723844df41e","source":{"kind":"arxiv","id":"1402.1063","version":1},"attestation_state":"computed","paper":{"title":"A note on Autoreducibility for Infinite Time Register Machines and parameter-free 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":"2014-02-05T14:47:46Z","abstract_excerpt":"We propose a notion of autoreducibility for infinite time computability and explore it and its connection with a notion of randomness for infinite time machines."},"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":"1402.1063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-02-05T14:47:46Z","cross_cats_sorted":[],"title_canon_sha256":"a2d60b70dddbfaf340b1de41226bfde3ab5edc400a23bba17bbd5bf3782c7be8","abstract_canon_sha256":"3239d109f59c4731873ef858e89dc09176f7709ccf75309d0d97dce685851049"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:01.830535Z","signature_b64":"htQg5TgF5eq9Tk2s4fstoxYaHwj97uRn1tO8VFRxNn5+R9VJHJdmrmL8m80yN/OTvoxYqYsCw/DSWhfYgJO7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29facd811c971fb31e3e4495dc1e1d6f8ec68724abe975f2005c0723844df41e","last_reissued_at":"2026-05-18T03:00:01.829792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:01.829792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on Autoreducibility for Infinite Time Register Machines and parameter-free 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":"2014-02-05T14:47:46Z","abstract_excerpt":"We propose a notion of autoreducibility for infinite time computability and explore it and its connection with a notion of randomness for infinite time machines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1063","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":"1402.1063","created_at":"2026-05-18T03:00:01.829925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.1063v1","created_at":"2026-05-18T03:00:01.829925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1063","created_at":"2026-05-18T03:00:01.829925+00:00"},{"alias_kind":"pith_short_12","alias_value":"FH5M3AI4S4P3","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FH5M3AI4S4P3GHR6","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FH5M3AI4","created_at":"2026-05-18T12:28:28.263976+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/FH5M3AI4S4P3GHR6ISK5YHQ5N6","json":"https://pith.science/pith/FH5M3AI4S4P3GHR6ISK5YHQ5N6.json","graph_json":"https://pith.science/api/pith-number/FH5M3AI4S4P3GHR6ISK5YHQ5N6/graph.json","events_json":"https://pith.science/api/pith-number/FH5M3AI4S4P3GHR6ISK5YHQ5N6/events.json","paper":"https://pith.science/paper/FH5M3AI4"},"agent_actions":{"view_html":"https://pith.science/pith/FH5M3AI4S4P3GHR6ISK5YHQ5N6","download_json":"https://pith.science/pith/FH5M3AI4S4P3GHR6ISK5YHQ5N6.json","view_paper":"https://pith.science/paper/FH5M3AI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.1063&json=true","fetch_graph":"https://pith.science/api/pith-number/FH5M3AI4S4P3GHR6ISK5YHQ5N6/graph.json","fetch_events":"https://pith.science/api/pith-number/FH5M3AI4S4P3GHR6ISK5YHQ5N6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FH5M3AI4S4P3GHR6ISK5YHQ5N6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FH5M3AI4S4P3GHR6ISK5YHQ5N6/action/storage_attestation","attest_author":"https://pith.science/pith/FH5M3AI4S4P3GHR6ISK5YHQ5N6/action/author_attestation","sign_citation":"https://pith.science/pith/FH5M3AI4S4P3GHR6ISK5YHQ5N6/action/citation_signature","submit_replication":"https://pith.science/pith/FH5M3AI4S4P3GHR6ISK5YHQ5N6/action/replication_record"}},"created_at":"2026-05-18T03:00:01.829925+00:00","updated_at":"2026-05-18T03:00:01.829925+00:00"}