{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XIF4HVEMGZAYXLNESTLATAOR5S","short_pith_number":"pith:XIF4HVEM","schema_version":"1.0","canonical_sha256":"ba0bc3d48c36418bada494d60981d1eca54ea6dc7cdc4aac4e34352e70daee81","source":{"kind":"arxiv","id":"1806.08747","version":4},"attestation_state":"computed","paper":{"title":"A Universal Hypercomputer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Andrew Powell","submitted_at":"2018-06-22T16:15:33Z","abstract_excerpt":"This paper describes a type of infinitary computer (a hypercomputer) capable of computing truth in initial levels of the set theoretic universe, V. The proper class of such hypercomputers is called a universal hypercomputer. There are two basic variants of hypercomputer: a serial hypercomputer and a parallel hypercomputer. The set of computable functions of the two variants is identical but the parallel hypercomputer is in general faster than a serial hypercomputer (as measured by an ordinal complexity measure). Insights into set theory using information theory and a universal hypercomputer ar"},"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":"1806.08747","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-22T16:15:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"99d0ad1da4e4119dc4f5353fa47baec3fb321c88416b368beb276cc0b5c37af8","abstract_canon_sha256":"53b56cae52cd80c446e2967860e7753820503d938a94af0b62192afd3ad32ab8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:36.264063Z","signature_b64":"GJTD5MjgYrr756pkT+s+7eApOydMifolR1zE8aKQCqWNkSQvoBPJF9x71AwJwqHitQpa+AlAbjnCoMoeW0k2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba0bc3d48c36418bada494d60981d1eca54ea6dc7cdc4aac4e34352e70daee81","last_reissued_at":"2026-05-17T23:46:36.263358Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:36.263358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Universal Hypercomputer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Andrew Powell","submitted_at":"2018-06-22T16:15:33Z","abstract_excerpt":"This paper describes a type of infinitary computer (a hypercomputer) capable of computing truth in initial levels of the set theoretic universe, V. The proper class of such hypercomputers is called a universal hypercomputer. There are two basic variants of hypercomputer: a serial hypercomputer and a parallel hypercomputer. The set of computable functions of the two variants is identical but the parallel hypercomputer is in general faster than a serial hypercomputer (as measured by an ordinal complexity measure). Insights into set theory using information theory and a universal hypercomputer ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08747","kind":"arxiv","version":4},"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":"1806.08747","created_at":"2026-05-17T23:46:36.263464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08747v4","created_at":"2026-05-17T23:46:36.263464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08747","created_at":"2026-05-17T23:46:36.263464+00:00"},{"alias_kind":"pith_short_12","alias_value":"XIF4HVEMGZAY","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XIF4HVEMGZAYXLNE","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XIF4HVEM","created_at":"2026-05-18T12:33:01.666342+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/XIF4HVEMGZAYXLNESTLATAOR5S","json":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S.json","graph_json":"https://pith.science/api/pith-number/XIF4HVEMGZAYXLNESTLATAOR5S/graph.json","events_json":"https://pith.science/api/pith-number/XIF4HVEMGZAYXLNESTLATAOR5S/events.json","paper":"https://pith.science/paper/XIF4HVEM"},"agent_actions":{"view_html":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S","download_json":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S.json","view_paper":"https://pith.science/paper/XIF4HVEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08747&json=true","fetch_graph":"https://pith.science/api/pith-number/XIF4HVEMGZAYXLNESTLATAOR5S/graph.json","fetch_events":"https://pith.science/api/pith-number/XIF4HVEMGZAYXLNESTLATAOR5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S/action/storage_attestation","attest_author":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S/action/author_attestation","sign_citation":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S/action/citation_signature","submit_replication":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S/action/replication_record"}},"created_at":"2026-05-17T23:46:36.263464+00:00","updated_at":"2026-05-17T23:46:36.263464+00:00"}