{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XIF4HVEMGZAYXLNESTLATAOR5S","short_pith_number":"pith:XIF4HVEM","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"},"canonical_sha256":"ba0bc3d48c36418bada494d60981d1eca54ea6dc7cdc4aac4e34352e70daee81","source":{"kind":"arxiv","id":"1806.08747","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08747","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08747v4","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08747","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"pith_short_12","alias_value":"XIF4HVEMGZAY","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XIF4HVEMGZAYXLNE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XIF4HVEM","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XIF4HVEMGZAYXLNESTLATAOR5S","target":"record","payload":{"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"},"canonical_sha256":"ba0bc3d48c36418bada494d60981d1eca54ea6dc7cdc4aac4e34352e70daee81","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"},"source_kind":"arxiv","source_id":"1806.08747","source_version":4,"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-17T23:46:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wY1m6dzD0YGUk0lcSN959V9X3MUHL7blh5ezNpCEWLutu7EBpELBJ8WR/vbMsw/qaGmluL5jEMz7tI36OAWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:41:33.111529Z"},"content_sha256":"cba7c644861d94b01d4f41a74e9d6a1686c924e8ef4d7800ee3c049a5d7bfcc2","schema_version":"1.0","event_id":"sha256:cba7c644861d94b01d4f41a74e9d6a1686c924e8ef4d7800ee3c049a5d7bfcc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XIF4HVEMGZAYXLNESTLATAOR5S","target":"graph","payload":{"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"},"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-17T23:46:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDfUD5ExZ7EwcQsHcYPqRwYMpglZ+0xopOn2XjhXiViw5g+lZK+/n/gOh6WTjBkM0MjuHLhrDQRpA8mVMm3+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:41:33.112165Z"},"content_sha256":"a0c5ea760c661bfae5286ffa105bf09d0d5a727d1c0a1394ffcdd7066a0a8585","schema_version":"1.0","event_id":"sha256:a0c5ea760c661bfae5286ffa105bf09d0d5a727d1c0a1394ffcdd7066a0a8585"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S/bundle.json","state_url":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XIF4HVEMGZAYXLNESTLATAOR5S/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-05T19:41:33Z","links":{"resolver":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S","bundle":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S/bundle.json","state":"https://pith.science/pith/XIF4HVEMGZAYXLNESTLATAOR5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XIF4HVEMGZAYXLNESTLATAOR5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XIF4HVEMGZAYXLNESTLATAOR5S","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":"53b56cae52cd80c446e2967860e7753820503d938a94af0b62192afd3ad32ab8","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-22T16:15:33Z","title_canon_sha256":"99d0ad1da4e4119dc4f5353fa47baec3fb321c88416b368beb276cc0b5c37af8"},"schema_version":"1.0","source":{"id":"1806.08747","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08747","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08747v4","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08747","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"pith_short_12","alias_value":"XIF4HVEMGZAY","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XIF4HVEMGZAYXLNE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XIF4HVEM","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:a0c5ea760c661bfae5286ffa105bf09d0d5a727d1c0a1394ffcdd7066a0a8585","target":"graph","created_at":"2026-05-17T23:46: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":"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","authors_text":"Andrew Powell","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-22T16:15:33Z","title":"A Universal Hypercomputer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08747","kind":"arxiv","version":4},"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:cba7c644861d94b01d4f41a74e9d6a1686c924e8ef4d7800ee3c049a5d7bfcc2","target":"record","created_at":"2026-05-17T23:46: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":"53b56cae52cd80c446e2967860e7753820503d938a94af0b62192afd3ad32ab8","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-22T16:15:33Z","title_canon_sha256":"99d0ad1da4e4119dc4f5353fa47baec3fb321c88416b368beb276cc0b5c37af8"},"schema_version":"1.0","source":{"id":"1806.08747","kind":"arxiv","version":4}},"canonical_sha256":"ba0bc3d48c36418bada494d60981d1eca54ea6dc7cdc4aac4e34352e70daee81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba0bc3d48c36418bada494d60981d1eca54ea6dc7cdc4aac4e34352e70daee81","first_computed_at":"2026-05-17T23:46:36.263358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:36.263358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GJTD5MjgYrr756pkT+s+7eApOydMifolR1zE8aKQCqWNkSQvoBPJF9x71AwJwqHitQpa+AlAbjnCoMoeW0k2CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:36.264063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08747","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cba7c644861d94b01d4f41a74e9d6a1686c924e8ef4d7800ee3c049a5d7bfcc2","sha256:a0c5ea760c661bfae5286ffa105bf09d0d5a727d1c0a1394ffcdd7066a0a8585"],"state_sha256":"965126e29f6b5cecf3eaca1512418e44a4547bf16c5a79fa0e3e2b525b5528fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IGgo5lax0XYlZsG9N5otqfqsm9Mphxj2Gzb5tjj3zDW2JiCvgkYGUZ9T/WiI1Ci58xfbg1Qit/nyY5BlfX8dDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:41:33.115732Z","bundle_sha256":"1f125595a066e4d32722e0bb4a75096609f77e9838c0047b58ff67f5f1f2a65f"}}