{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LAICFR5POBUOY4OAQV6YHCYMC5","short_pith_number":"pith:LAICFR5P","canonical_record":{"source":{"id":"1904.10174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-23T06:48:28Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"64ade50aed40c14fc139824726f9d84cd6a1ba92c3ace12c1937ea2f85c1e8a3","abstract_canon_sha256":"29e3757c8ecb8fe57359847f712d562b7967d15caba9364e2f920e26898e9ea6"},"schema_version":"1.0"},"canonical_sha256":"581022c7af7068ec71c0857d838b0c17496a8c8b542080388422b6c3b291d91f","source":{"kind":"arxiv","id":"1904.10174","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10174","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10174v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10174","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"LAICFR5POBUO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LAICFR5POBUOY4OA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LAICFR5P","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LAICFR5POBUOY4OAQV6YHCYMC5","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-23T06:48:28Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"64ade50aed40c14fc139824726f9d84cd6a1ba92c3ace12c1937ea2f85c1e8a3","abstract_canon_sha256":"29e3757c8ecb8fe57359847f712d562b7967d15caba9364e2f920e26898e9ea6"},"schema_version":"1.0"},"canonical_sha256":"581022c7af7068ec71c0857d838b0c17496a8c8b542080388422b6c3b291d91f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:54.915245Z","signature_b64":"xSvxB8GG5Yuzc/7xmpDKxwiKMzJcl54G/76fdqlH9eHR2vsZrSW8SOwye+ueYUww1Cu/NmkUmdArWDJYp7HfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"581022c7af7068ec71c0857d838b0c17496a8c8b542080388422b6c3b291d91f","last_reissued_at":"2026-05-17T23:47:54.914753Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:54.914753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10174","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-17T23:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67wtxSNsli2a4aaJ0fZ6w9JtCevvAuulIb4vWQKBzg8Aq+g8G4H4YGN1zU0Lm4fmr7B84wDzu9u0OlvlHUaJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:41:09.771035Z"},"content_sha256":"e578f896f9bc3c25eb86c5bc0636ffbb183e4f275f92c695c9fa5ce2ef5e58a9","schema_version":"1.0","event_id":"sha256:e578f896f9bc3c25eb86c5bc0636ffbb183e4f275f92c695c9fa5ce2ef5e58a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LAICFR5POBUOY4OAQV6YHCYMC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A general architecture of oritatami systems for simulating arbitrary finite automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Hwee Kim, Shinnosuke Seki, Yo-Sub Han, Yusei Masuda","submitted_at":"2019-04-23T06:48:28Z","abstract_excerpt":"In this paper, we propose an architecture of oritatami systems with which one can simulate an arbitrary nondeterministic finite automaton (NFA) in a unified manner. The oritatami system is known to be Turing-universal but the simulation available so far requires 542 bead types and $O(t^4 \\log^2 t)$ steps in order to simulate $t$ steps of a Turing machine. The architecture we propose employs only 329 bead types and requires just $O(t |Q|^4 |\\Sigma|^2)$ steps to simulate an NFA over an input alphabet $\\Sigma$ with a state set $Q$ working on a word of length $t$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10174","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-17T23:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZiCn9sLcrFyS8KPR2pwLt61siCJ0HyCx4rzFEiBekeSKaK7DKsYFAqBmQ+8uqcL2YUFLTYWkvJjxvdGr08QjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:41:09.771435Z"},"content_sha256":"6297875cf727e9907fd39c3f38096fdd32cf4475b84c8e6fbb220f8248ff94dd","schema_version":"1.0","event_id":"sha256:6297875cf727e9907fd39c3f38096fdd32cf4475b84c8e6fbb220f8248ff94dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5/bundle.json","state_url":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAICFR5POBUOY4OAQV6YHCYMC5/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-05-30T17:41:09Z","links":{"resolver":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5","bundle":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5/bundle.json","state":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAICFR5POBUOY4OAQV6YHCYMC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LAICFR5POBUOY4OAQV6YHCYMC5","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":"29e3757c8ecb8fe57359847f712d562b7967d15caba9364e2f920e26898e9ea6","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-23T06:48:28Z","title_canon_sha256":"64ade50aed40c14fc139824726f9d84cd6a1ba92c3ace12c1937ea2f85c1e8a3"},"schema_version":"1.0","source":{"id":"1904.10174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10174","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10174v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10174","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"LAICFR5POBUO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LAICFR5POBUOY4OA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LAICFR5P","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:6297875cf727e9907fd39c3f38096fdd32cf4475b84c8e6fbb220f8248ff94dd","target":"graph","created_at":"2026-05-17T23:47:54Z","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":"In this paper, we propose an architecture of oritatami systems with which one can simulate an arbitrary nondeterministic finite automaton (NFA) in a unified manner. The oritatami system is known to be Turing-universal but the simulation available so far requires 542 bead types and $O(t^4 \\log^2 t)$ steps in order to simulate $t$ steps of a Turing machine. The architecture we propose employs only 329 bead types and requires just $O(t |Q|^4 |\\Sigma|^2)$ steps to simulate an NFA over an input alphabet $\\Sigma$ with a state set $Q$ working on a word of length $t$.","authors_text":"Hwee Kim, Shinnosuke Seki, Yo-Sub Han, Yusei Masuda","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-23T06:48:28Z","title":"A general architecture of oritatami systems for simulating arbitrary finite automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10174","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:e578f896f9bc3c25eb86c5bc0636ffbb183e4f275f92c695c9fa5ce2ef5e58a9","target":"record","created_at":"2026-05-17T23:47:54Z","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":"29e3757c8ecb8fe57359847f712d562b7967d15caba9364e2f920e26898e9ea6","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-23T06:48:28Z","title_canon_sha256":"64ade50aed40c14fc139824726f9d84cd6a1ba92c3ace12c1937ea2f85c1e8a3"},"schema_version":"1.0","source":{"id":"1904.10174","kind":"arxiv","version":1}},"canonical_sha256":"581022c7af7068ec71c0857d838b0c17496a8c8b542080388422b6c3b291d91f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"581022c7af7068ec71c0857d838b0c17496a8c8b542080388422b6c3b291d91f","first_computed_at":"2026-05-17T23:47:54.914753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:54.914753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xSvxB8GG5Yuzc/7xmpDKxwiKMzJcl54G/76fdqlH9eHR2vsZrSW8SOwye+ueYUww1Cu/NmkUmdArWDJYp7HfCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:54.915245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e578f896f9bc3c25eb86c5bc0636ffbb183e4f275f92c695c9fa5ce2ef5e58a9","sha256:6297875cf727e9907fd39c3f38096fdd32cf4475b84c8e6fbb220f8248ff94dd"],"state_sha256":"7bd3117eed83c853466941bdcd652e8ae4c2d4ee5a974bac21cfdc303a9d21c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dii4ipdXBNhUJzkZXDh3LCHQa44YAw0MTjqWIJ/xVKCoqTQUDyacRyUwCqSZXI+lmd5N1Tmt6d4Az+wNgAI8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:41:09.774500Z","bundle_sha256":"df446755bd60d19b02122302410906969008f7ee803f84269ed42e4931130dbe"}}