{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LAICFR5POBUOY4OAQV6YHCYMC5","short_pith_number":"pith:LAICFR5P","schema_version":"1.0","canonical_sha256":"581022c7af7068ec71c0857d838b0c17496a8c8b542080388422b6c3b291d91f","source":{"kind":"arxiv","id":"1904.10174","version":1},"attestation_state":"computed","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$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.10174","created_at":"2026-05-17T23:47:54.914825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10174v1","created_at":"2026-05-17T23:47:54.914825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10174","created_at":"2026-05-17T23:47:54.914825+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAICFR5POBUO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAICFR5POBUOY4OA","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAICFR5P","created_at":"2026-05-18T12:33:21.387695+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/LAICFR5POBUOY4OAQV6YHCYMC5","json":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5.json","graph_json":"https://pith.science/api/pith-number/LAICFR5POBUOY4OAQV6YHCYMC5/graph.json","events_json":"https://pith.science/api/pith-number/LAICFR5POBUOY4OAQV6YHCYMC5/events.json","paper":"https://pith.science/paper/LAICFR5P"},"agent_actions":{"view_html":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5","download_json":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5.json","view_paper":"https://pith.science/paper/LAICFR5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10174&json=true","fetch_graph":"https://pith.science/api/pith-number/LAICFR5POBUOY4OAQV6YHCYMC5/graph.json","fetch_events":"https://pith.science/api/pith-number/LAICFR5POBUOY4OAQV6YHCYMC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5/action/storage_attestation","attest_author":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5/action/author_attestation","sign_citation":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5/action/citation_signature","submit_replication":"https://pith.science/pith/LAICFR5POBUOY4OAQV6YHCYMC5/action/replication_record"}},"created_at":"2026-05-17T23:47:54.914825+00:00","updated_at":"2026-05-17T23:47:54.914825+00:00"}