{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WIDSVHDOYRSRZ6MO4E3IONPVKI","short_pith_number":"pith:WIDSVHDO","schema_version":"1.0","canonical_sha256":"b2072a9c6ec4651cf98ee1368735f55226598c792ead7b02b1a5faac44acd061","source":{"kind":"arxiv","id":"1901.07125","version":1},"attestation_state":"computed","paper":{"title":"The Power of One-State Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marzio De Biasi","submitted_at":"2019-01-22T00:09:17Z","abstract_excerpt":"At first glance, one-state Turing machines are very weak: the halting problem for them is decidable, and, without memory, they cannot even accept a simple one element language such as $L = \\{ 1 \\}$ . Nevertheless it has been showed that a one-state Turing machine can accept non regular languages. We extend such result and prove that they can also recognize non context-free languages, so for some tasks they are more powerful than pushdown automata."},"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":"1901.07125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-01-22T00:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"ba31b7de6c9af5230cdea446943e5488294efee26ba7a2dc7506833afb702726","abstract_canon_sha256":"b4a0f5f6f5248b4250d22d21535d5c42a7d0e429705ef19df36b942491593e9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:48.091376Z","signature_b64":"iOp9PQ4lNDyYDDFSdALaK8ni+fPd6eex5EgoigMKByB3othXoK8R/GZMr+Is27AGc5kzqc84f5ID1/i/HRc+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2072a9c6ec4651cf98ee1368735f55226598c792ead7b02b1a5faac44acd061","last_reissued_at":"2026-05-17T23:55:48.090759Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:48.090759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of One-State Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marzio De Biasi","submitted_at":"2019-01-22T00:09:17Z","abstract_excerpt":"At first glance, one-state Turing machines are very weak: the halting problem for them is decidable, and, without memory, they cannot even accept a simple one element language such as $L = \\{ 1 \\}$ . Nevertheless it has been showed that a one-state Turing machine can accept non regular languages. We extend such result and prove that they can also recognize non context-free languages, so for some tasks they are more powerful than pushdown automata."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07125","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":"1901.07125","created_at":"2026-05-17T23:55:48.090857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07125v1","created_at":"2026-05-17T23:55:48.090857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07125","created_at":"2026-05-17T23:55:48.090857+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIDSVHDOYRSR","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIDSVHDOYRSRZ6MO","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIDSVHDO","created_at":"2026-05-18T12:33:30.264802+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/WIDSVHDOYRSRZ6MO4E3IONPVKI","json":"https://pith.science/pith/WIDSVHDOYRSRZ6MO4E3IONPVKI.json","graph_json":"https://pith.science/api/pith-number/WIDSVHDOYRSRZ6MO4E3IONPVKI/graph.json","events_json":"https://pith.science/api/pith-number/WIDSVHDOYRSRZ6MO4E3IONPVKI/events.json","paper":"https://pith.science/paper/WIDSVHDO"},"agent_actions":{"view_html":"https://pith.science/pith/WIDSVHDOYRSRZ6MO4E3IONPVKI","download_json":"https://pith.science/pith/WIDSVHDOYRSRZ6MO4E3IONPVKI.json","view_paper":"https://pith.science/paper/WIDSVHDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07125&json=true","fetch_graph":"https://pith.science/api/pith-number/WIDSVHDOYRSRZ6MO4E3IONPVKI/graph.json","fetch_events":"https://pith.science/api/pith-number/WIDSVHDOYRSRZ6MO4E3IONPVKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIDSVHDOYRSRZ6MO4E3IONPVKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIDSVHDOYRSRZ6MO4E3IONPVKI/action/storage_attestation","attest_author":"https://pith.science/pith/WIDSVHDOYRSRZ6MO4E3IONPVKI/action/author_attestation","sign_citation":"https://pith.science/pith/WIDSVHDOYRSRZ6MO4E3IONPVKI/action/citation_signature","submit_replication":"https://pith.science/pith/WIDSVHDOYRSRZ6MO4E3IONPVKI/action/replication_record"}},"created_at":"2026-05-17T23:55:48.090857+00:00","updated_at":"2026-05-17T23:55:48.090857+00:00"}