{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:T2G77LJWQ3FE5V7K7GTSJ32TMS","short_pith_number":"pith:T2G77LJW","canonical_record":{"source":{"id":"1707.05297","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-07-17T17:49:30Z","cross_cats_sorted":[],"title_canon_sha256":"b19b549c1d1ed4234113be5023ba12140362499b0884ff656fc480373717b35a","abstract_canon_sha256":"61396c72cffb4e51b42194e3a74933aa23659800ac26fb153643fc307e0ad9b1"},"schema_version":"1.0"},"canonical_sha256":"9e8dffad3686ca4ed7eaf9a724ef5364a3556216df6e623bb12500a2a630519a","source":{"kind":"arxiv","id":"1707.05297","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05297","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05297v3","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05297","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"T2G77LJWQ3FE","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"pith_short_16","alias_value":"T2G77LJWQ3FE5V7K","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"pith_short_8","alias_value":"T2G77LJW","created_at":"2026-05-20T00:05:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:T2G77LJWQ3FE5V7K7GTSJ32TMS","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05297","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-07-17T17:49:30Z","cross_cats_sorted":[],"title_canon_sha256":"b19b549c1d1ed4234113be5023ba12140362499b0884ff656fc480373717b35a","abstract_canon_sha256":"61396c72cffb4e51b42194e3a74933aa23659800ac26fb153643fc307e0ad9b1"},"schema_version":"1.0"},"canonical_sha256":"9e8dffad3686ca4ed7eaf9a724ef5364a3556216df6e623bb12500a2a630519a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:23.347720Z","signature_b64":"sT1Ml3USyMARTR/mIYBVHu1H+BaKPGQ/x5OhtdjkXgL0BzJBcsIBoXwnU047j3bFzNU275paG1fjQ1v5n8TQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e8dffad3686ca4ed7eaf9a724ef5364a3556216df6e623bb12500a2a630519a","last_reissued_at":"2026-05-20T00:05:23.346944Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:23.346944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05297","source_version":3,"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-20T00:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3/GebYk+lW6s+21Y69fxx+aV76H+liJs6k2b4zsUOs1AkrGjGXIeD1MAgDchbEb3qTW2DbR4SKhLHZ4CKbvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:04:53.007759Z"},"content_sha256":"d6e29ad5e1511d4cb26b6d9fe2ea4645c2cff88021bf8f98cd15fa94d8975fca","schema_version":"1.0","event_id":"sha256:d6e29ad5e1511d4cb26b6d9fe2ea4645c2cff88021bf8f98cd15fa94d8975fca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:T2G77LJWQ3FE5V7K7GTSJ32TMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Bounded OTMs and REG$^{\\infty}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Merlin Carl","submitted_at":"2017-07-17T17:49:30Z","abstract_excerpt":"An important theorem in classical complexity theory is that LOGLOGSPACE=REG, i.e. that languages decidable with double-logarithmic space bound are regular. We consider a transfinite analogue of this theorem. To this end, we introduce deterministic ordinal automata (DOAs), show that they satisfy many of the basic statements of the theory of deterministic finite automata and regular languages. We then consider languages decidable by an ordinal Turing machine (OTM), introduced by P. Koepke in 2005 and show that if the working space of an OTM is of strictly smaller cardinality than the input lengt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05297","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1707.05297/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-20T00:05:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lRw9B/h9OTmmQ9V4uZziSKbw0+7QpatImTMl23kAX+pLRS/vWj4hgmNc18H+n6oohg6sLZiT/zs2svrCkBsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:04:53.008420Z"},"content_sha256":"7112b1ac3d22ca40f3d22c703ea4c7fc894f4b5538db0278e50016aaf3a8aa38","schema_version":"1.0","event_id":"sha256:7112b1ac3d22ca40f3d22c703ea4c7fc894f4b5538db0278e50016aaf3a8aa38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2G77LJWQ3FE5V7K7GTSJ32TMS/bundle.json","state_url":"https://pith.science/pith/T2G77LJWQ3FE5V7K7GTSJ32TMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2G77LJWQ3FE5V7K7GTSJ32TMS/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-30T22:04:53Z","links":{"resolver":"https://pith.science/pith/T2G77LJWQ3FE5V7K7GTSJ32TMS","bundle":"https://pith.science/pith/T2G77LJWQ3FE5V7K7GTSJ32TMS/bundle.json","state":"https://pith.science/pith/T2G77LJWQ3FE5V7K7GTSJ32TMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2G77LJWQ3FE5V7K7GTSJ32TMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T2G77LJWQ3FE5V7K7GTSJ32TMS","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":"61396c72cffb4e51b42194e3a74933aa23659800ac26fb153643fc307e0ad9b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-07-17T17:49:30Z","title_canon_sha256":"b19b549c1d1ed4234113be5023ba12140362499b0884ff656fc480373717b35a"},"schema_version":"1.0","source":{"id":"1707.05297","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05297","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05297v3","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05297","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"T2G77LJWQ3FE","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"pith_short_16","alias_value":"T2G77LJWQ3FE5V7K","created_at":"2026-05-20T00:05:23Z"},{"alias_kind":"pith_short_8","alias_value":"T2G77LJW","created_at":"2026-05-20T00:05:23Z"}],"graph_snapshots":[{"event_id":"sha256:7112b1ac3d22ca40f3d22c703ea4c7fc894f4b5538db0278e50016aaf3a8aa38","target":"graph","created_at":"2026-05-20T00:05:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1707.05297/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An important theorem in classical complexity theory is that LOGLOGSPACE=REG, i.e. that languages decidable with double-logarithmic space bound are regular. We consider a transfinite analogue of this theorem. To this end, we introduce deterministic ordinal automata (DOAs), show that they satisfy many of the basic statements of the theory of deterministic finite automata and regular languages. We then consider languages decidable by an ordinal Turing machine (OTM), introduced by P. Koepke in 2005 and show that if the working space of an OTM is of strictly smaller cardinality than the input lengt","authors_text":"Merlin Carl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-07-17T17:49:30Z","title":"Space-Bounded OTMs and REG$^{\\infty}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05297","kind":"arxiv","version":3},"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:d6e29ad5e1511d4cb26b6d9fe2ea4645c2cff88021bf8f98cd15fa94d8975fca","target":"record","created_at":"2026-05-20T00:05:23Z","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":"61396c72cffb4e51b42194e3a74933aa23659800ac26fb153643fc307e0ad9b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-07-17T17:49:30Z","title_canon_sha256":"b19b549c1d1ed4234113be5023ba12140362499b0884ff656fc480373717b35a"},"schema_version":"1.0","source":{"id":"1707.05297","kind":"arxiv","version":3}},"canonical_sha256":"9e8dffad3686ca4ed7eaf9a724ef5364a3556216df6e623bb12500a2a630519a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e8dffad3686ca4ed7eaf9a724ef5364a3556216df6e623bb12500a2a630519a","first_computed_at":"2026-05-20T00:05:23.346944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:23.346944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sT1Ml3USyMARTR/mIYBVHu1H+BaKPGQ/x5OhtdjkXgL0BzJBcsIBoXwnU047j3bFzNU275paG1fjQ1v5n8TQDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:23.347720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05297","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6e29ad5e1511d4cb26b6d9fe2ea4645c2cff88021bf8f98cd15fa94d8975fca","sha256:7112b1ac3d22ca40f3d22c703ea4c7fc894f4b5538db0278e50016aaf3a8aa38"],"state_sha256":"2b12849cd9780f8719cb2f0fb9d921e5afaf0e453bbccbdd8cc74fbeae14de66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Id0nKoEMZ4EqYvDXOi2vtPNy6JTkg+5PfU6t2m8g5sHtGzs9DCONVHeE2JZIV2vF6N7i1WrpebqXRmtluu1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T22:04:53.011456Z","bundle_sha256":"80634799216dcf75384fe72b762b9ce0b5cc0eed149c8bfc7d5eea5ae926bf33"}}