{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AMYLY7QTDWSW6LELL73HYDQCPU","short_pith_number":"pith:AMYLY7QT","canonical_record":{"source":{"id":"1801.10027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-01-30T14:59:04Z","cross_cats_sorted":[],"title_canon_sha256":"696cf55b1034f5166f2812c64d8a365dab27cbac87d6614f53d350a616dda776","abstract_canon_sha256":"15b19ba78ac964c041c6b6f6b220a4af1d7b336f818375cacecd7753fa54c341"},"schema_version":"1.0"},"canonical_sha256":"0330bc7e131da56f2c8b5ff67c0e027d2bea532bfb547256c1b446538b54f7b5","source":{"kind":"arxiv","id":"1801.10027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10027","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10027v1","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10027","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"AMYLY7QTDWSW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AMYLY7QTDWSW6LEL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AMYLY7QT","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AMYLY7QTDWSW6LELL73HYDQCPU","target":"record","payload":{"canonical_record":{"source":{"id":"1801.10027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-01-30T14:59:04Z","cross_cats_sorted":[],"title_canon_sha256":"696cf55b1034f5166f2812c64d8a365dab27cbac87d6614f53d350a616dda776","abstract_canon_sha256":"15b19ba78ac964c041c6b6f6b220a4af1d7b336f818375cacecd7753fa54c341"},"schema_version":"1.0"},"canonical_sha256":"0330bc7e131da56f2c8b5ff67c0e027d2bea532bfb547256c1b446538b54f7b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:46.083139Z","signature_b64":"q9nLA0a6Y3SGC0i6/bT2nptpoA7vSdDlGCgPDUlktNHzRfWhzrJmr2TKatavOFmZuKuQEi9svM81narMdO6oBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0330bc7e131da56f2c8b5ff67c0e027d2bea532bfb547256c1b446538b54f7b5","last_reissued_at":"2026-05-18T00:24:46.082247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:46.082247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.10027","source_version":1,"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-18T00:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nqtm0lc8UvM/AVUkj7bUvgLNmJHtmiQKySKMLmEIPWqbaJQ0yB5FeVJ2sYgepg+nvV7Ijcw/eBuBd+TfU6ucBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:52:43.848076Z"},"content_sha256":"7c6a7301b6ccb58bf61484675b4c11cfc64ea2c83e0077bef4ff45b0ebfa670e","schema_version":"1.0","event_id":"sha256:7c6a7301b6ccb58bf61484675b4c11cfc64ea2c83e0077bef4ff45b0ebfa670e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AMYLY7QTDWSW6LELL73HYDQCPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some Observations on Infinitary Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Merlin Carl","submitted_at":"2018-01-30T14:59:04Z","abstract_excerpt":"Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\\\"owe and the author, we prove the following results:\n  (1) An analogue of Ladner's theorem for OTMs holds: That is, there are languages $\\mathcal{L}$ which are NP$^{\\infty}$, but neither P$^{\\infty}$ nor NP$^{\\infty}$-complete. This answers an open question of \\cite{CLR}.\n  (2) The speedup theorem for Turing machines, which allows us to bring down the computation time and space usage of a Turing machine program down by an aribtrary positive factor under relatively mild side condition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10027","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"},"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-18T00:24:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXwlCcTK5tIn4Fhdvv/Oxj28kuEi78GDZqSBZRKvYEdj6kHoEbuNeZjqU2Z4bfm/ugw9aJknATeA5BKuZ7wzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:52:43.848444Z"},"content_sha256":"527a6bbb4e7707c355e2d79d202d54627ce1ee4222a229f0ce5a63b5f3669c87","schema_version":"1.0","event_id":"sha256:527a6bbb4e7707c355e2d79d202d54627ce1ee4222a229f0ce5a63b5f3669c87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMYLY7QTDWSW6LELL73HYDQCPU/bundle.json","state_url":"https://pith.science/pith/AMYLY7QTDWSW6LELL73HYDQCPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMYLY7QTDWSW6LELL73HYDQCPU/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-30T17:52:43Z","links":{"resolver":"https://pith.science/pith/AMYLY7QTDWSW6LELL73HYDQCPU","bundle":"https://pith.science/pith/AMYLY7QTDWSW6LELL73HYDQCPU/bundle.json","state":"https://pith.science/pith/AMYLY7QTDWSW6LELL73HYDQCPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMYLY7QTDWSW6LELL73HYDQCPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AMYLY7QTDWSW6LELL73HYDQCPU","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":"15b19ba78ac964c041c6b6f6b220a4af1d7b336f818375cacecd7753fa54c341","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-01-30T14:59:04Z","title_canon_sha256":"696cf55b1034f5166f2812c64d8a365dab27cbac87d6614f53d350a616dda776"},"schema_version":"1.0","source":{"id":"1801.10027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10027","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10027v1","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10027","created_at":"2026-05-18T00:24:46Z"},{"alias_kind":"pith_short_12","alias_value":"AMYLY7QTDWSW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AMYLY7QTDWSW6LEL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AMYLY7QT","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:527a6bbb4e7707c355e2d79d202d54627ce1ee4222a229f0ce5a63b5f3669c87","target":"graph","created_at":"2026-05-18T00:24:46Z","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":"Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\\\"owe and the author, we prove the following results:\n  (1) An analogue of Ladner's theorem for OTMs holds: That is, there are languages $\\mathcal{L}$ which are NP$^{\\infty}$, but neither P$^{\\infty}$ nor NP$^{\\infty}$-complete. This answers an open question of \\cite{CLR}.\n  (2) The speedup theorem for Turing machines, which allows us to bring down the computation time and space usage of a Turing machine program down by an aribtrary positive factor under relatively mild side condition","authors_text":"Merlin Carl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-01-30T14:59:04Z","title":"Some Observations on Infinitary Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10027","kind":"arxiv","version":1},"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:7c6a7301b6ccb58bf61484675b4c11cfc64ea2c83e0077bef4ff45b0ebfa670e","target":"record","created_at":"2026-05-18T00:24:46Z","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":"15b19ba78ac964c041c6b6f6b220a4af1d7b336f818375cacecd7753fa54c341","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-01-30T14:59:04Z","title_canon_sha256":"696cf55b1034f5166f2812c64d8a365dab27cbac87d6614f53d350a616dda776"},"schema_version":"1.0","source":{"id":"1801.10027","kind":"arxiv","version":1}},"canonical_sha256":"0330bc7e131da56f2c8b5ff67c0e027d2bea532bfb547256c1b446538b54f7b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0330bc7e131da56f2c8b5ff67c0e027d2bea532bfb547256c1b446538b54f7b5","first_computed_at":"2026-05-18T00:24:46.082247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:46.082247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q9nLA0a6Y3SGC0i6/bT2nptpoA7vSdDlGCgPDUlktNHzRfWhzrJmr2TKatavOFmZuKuQEi9svM81narMdO6oBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:46.083139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.10027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c6a7301b6ccb58bf61484675b4c11cfc64ea2c83e0077bef4ff45b0ebfa670e","sha256:527a6bbb4e7707c355e2d79d202d54627ce1ee4222a229f0ce5a63b5f3669c87"],"state_sha256":"7b8647534d861c933531939c56c393dc746663e8c56bb74f84e221dc5197b01f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"haKHGJWnBXo5BijhR644YNqfjoZU5btBJk2IR27vGKuGIRJ7VddU1DAKaqtMgJL3RNcfvvHl5kPUsAKZT1lyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:52:43.850533Z","bundle_sha256":"51584ab7e45816145dea404b1f525ec88b74bfbac5ea9589b454946d9f8a7583"}}