{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J7J25TQVKF3MXC4VSGC5MCBQML","short_pith_number":"pith:J7J25TQV","schema_version":"1.0","canonical_sha256":"4fd3aece155176cb8b959185d6083062d672e79ce7a6506b01ec7e8a393d4f80","source":{"kind":"arxiv","id":"1904.11100","version":1},"attestation_state":"computed","paper":{"title":"Decision Problems for Restricted Variants of Two-Dimensional Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Kai Salomaa, Taylor J. Smith","submitted_at":"2019-04-24T23:55:44Z","abstract_excerpt":"A two-dimensional finite automaton has a read-only input head that moves in four directions on a finite array of cells labelled by symbols of the input alphabet. A three-way two-dimensional automaton is prohibited from making upward moves, while a two-way two-dimensional automaton can only move downward and rightward.\n  We show that the language emptiness problem for unary three-way nondeterministic two-dimensional automata is NP-complete, and is in P for general-alphabet two-way nondeterministic two-dimensional automata. We show that the language equivalence problem for two-way deterministic "},"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.11100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-24T23:55:44Z","cross_cats_sorted":[],"title_canon_sha256":"49ea3e548da92fc86d408cbe5ba9a69fe9f534f50bb5dea0b52ff97e921a6bc0","abstract_canon_sha256":"c897c8f7d13a959a5003ba98edccb9f2469664bfcd3d55299c9b629e4799e3fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:45.818264Z","signature_b64":"14owStjFYas1F1f/D70PcfHIO5AKobCcoxPHOOp7zld6Dd7eotOmfKXYHMLSoivo6sg+KV60qD6Zk7NNlq6yDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fd3aece155176cb8b959185d6083062d672e79ce7a6506b01ec7e8a393d4f80","last_reissued_at":"2026-05-17T23:47:45.817361Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:45.817361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decision Problems for Restricted Variants of Two-Dimensional Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Kai Salomaa, Taylor J. Smith","submitted_at":"2019-04-24T23:55:44Z","abstract_excerpt":"A two-dimensional finite automaton has a read-only input head that moves in four directions on a finite array of cells labelled by symbols of the input alphabet. A three-way two-dimensional automaton is prohibited from making upward moves, while a two-way two-dimensional automaton can only move downward and rightward.\n  We show that the language emptiness problem for unary three-way nondeterministic two-dimensional automata is NP-complete, and is in P for general-alphabet two-way nondeterministic two-dimensional automata. We show that the language equivalence problem for two-way deterministic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11100","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.11100","created_at":"2026-05-17T23:47:45.817520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11100v1","created_at":"2026-05-17T23:47:45.817520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11100","created_at":"2026-05-17T23:47:45.817520+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7J25TQVKF3M","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7J25TQVKF3MXC4V","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7J25TQV","created_at":"2026-05-18T12:33:18.533446+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/J7J25TQVKF3MXC4VSGC5MCBQML","json":"https://pith.science/pith/J7J25TQVKF3MXC4VSGC5MCBQML.json","graph_json":"https://pith.science/api/pith-number/J7J25TQVKF3MXC4VSGC5MCBQML/graph.json","events_json":"https://pith.science/api/pith-number/J7J25TQVKF3MXC4VSGC5MCBQML/events.json","paper":"https://pith.science/paper/J7J25TQV"},"agent_actions":{"view_html":"https://pith.science/pith/J7J25TQVKF3MXC4VSGC5MCBQML","download_json":"https://pith.science/pith/J7J25TQVKF3MXC4VSGC5MCBQML.json","view_paper":"https://pith.science/paper/J7J25TQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11100&json=true","fetch_graph":"https://pith.science/api/pith-number/J7J25TQVKF3MXC4VSGC5MCBQML/graph.json","fetch_events":"https://pith.science/api/pith-number/J7J25TQVKF3MXC4VSGC5MCBQML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7J25TQVKF3MXC4VSGC5MCBQML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7J25TQVKF3MXC4VSGC5MCBQML/action/storage_attestation","attest_author":"https://pith.science/pith/J7J25TQVKF3MXC4VSGC5MCBQML/action/author_attestation","sign_citation":"https://pith.science/pith/J7J25TQVKF3MXC4VSGC5MCBQML/action/citation_signature","submit_replication":"https://pith.science/pith/J7J25TQVKF3MXC4VSGC5MCBQML/action/replication_record"}},"created_at":"2026-05-17T23:47:45.817520+00:00","updated_at":"2026-05-17T23:47:45.817520+00:00"}