{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CS2VHR7WAJ5YOZO4ZM7DUS7HK7","short_pith_number":"pith:CS2VHR7W","schema_version":"1.0","canonical_sha256":"14b553c7f6027b8765dccb3e3a4be757ed8d1f51464ae24330cb88f8ef979947","source":{"kind":"arxiv","id":"1405.0055","version":2},"attestation_state":"computed","paper":{"title":"Quantum, Stochastic, and Pseudo Stochastic Languages with Few States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.FL","authors_text":"Abuzer Yakaryilmaz, Arseny M. Shur","submitted_at":"2014-04-30T23:29:33Z","abstract_excerpt":"Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpoint over the field of real numbers. More general computational models over the same field such as generalized finite automata (GFAs) and quantum finite automata (QFAs) define the same class. In 1963, Rabin proved the set of stochastic languages to be uncountable presenting a single 2-state PFA over the binary alphabet recognizing uncountably many languages depending on the cutpoint. In this paper, we show the same result for unary stochastic languages. Namely, we exhibit a 2-state unary GFA, a 2"},"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":"1405.0055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-30T23:29:33Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"6113e6a6820806c83cb46f893c454385ddf7b78c604f8b5d0bb31dca1a58d070","abstract_canon_sha256":"4bd409b9485e65a9b55c6011127bbe9e00599625446c87bdada0727e2abc36e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:47.341537Z","signature_b64":"vV1Iyrn1WTTwuUIhtKbG+tnq2CwiKqDxCmF8zAzGUY+8YhNaUGfEFvqKJZQBsG0XqItSCtG9amLZR20DbWbWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14b553c7f6027b8765dccb3e3a4be757ed8d1f51464ae24330cb88f8ef979947","last_reissued_at":"2026-05-18T02:30:47.341045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:47.341045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum, Stochastic, and Pseudo Stochastic Languages with Few States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.FL","authors_text":"Abuzer Yakaryilmaz, Arseny M. Shur","submitted_at":"2014-04-30T23:29:33Z","abstract_excerpt":"Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpoint over the field of real numbers. More general computational models over the same field such as generalized finite automata (GFAs) and quantum finite automata (QFAs) define the same class. In 1963, Rabin proved the set of stochastic languages to be uncountable presenting a single 2-state PFA over the binary alphabet recognizing uncountably many languages depending on the cutpoint. In this paper, we show the same result for unary stochastic languages. Namely, we exhibit a 2-state unary GFA, a 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0055","kind":"arxiv","version":2},"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":"1405.0055","created_at":"2026-05-18T02:30:47.341112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0055v2","created_at":"2026-05-18T02:30:47.341112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0055","created_at":"2026-05-18T02:30:47.341112+00:00"},{"alias_kind":"pith_short_12","alias_value":"CS2VHR7WAJ5Y","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CS2VHR7WAJ5YOZO4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CS2VHR7W","created_at":"2026-05-18T12:28:22.404517+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/CS2VHR7WAJ5YOZO4ZM7DUS7HK7","json":"https://pith.science/pith/CS2VHR7WAJ5YOZO4ZM7DUS7HK7.json","graph_json":"https://pith.science/api/pith-number/CS2VHR7WAJ5YOZO4ZM7DUS7HK7/graph.json","events_json":"https://pith.science/api/pith-number/CS2VHR7WAJ5YOZO4ZM7DUS7HK7/events.json","paper":"https://pith.science/paper/CS2VHR7W"},"agent_actions":{"view_html":"https://pith.science/pith/CS2VHR7WAJ5YOZO4ZM7DUS7HK7","download_json":"https://pith.science/pith/CS2VHR7WAJ5YOZO4ZM7DUS7HK7.json","view_paper":"https://pith.science/paper/CS2VHR7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0055&json=true","fetch_graph":"https://pith.science/api/pith-number/CS2VHR7WAJ5YOZO4ZM7DUS7HK7/graph.json","fetch_events":"https://pith.science/api/pith-number/CS2VHR7WAJ5YOZO4ZM7DUS7HK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CS2VHR7WAJ5YOZO4ZM7DUS7HK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CS2VHR7WAJ5YOZO4ZM7DUS7HK7/action/storage_attestation","attest_author":"https://pith.science/pith/CS2VHR7WAJ5YOZO4ZM7DUS7HK7/action/author_attestation","sign_citation":"https://pith.science/pith/CS2VHR7WAJ5YOZO4ZM7DUS7HK7/action/citation_signature","submit_replication":"https://pith.science/pith/CS2VHR7WAJ5YOZO4ZM7DUS7HK7/action/replication_record"}},"created_at":"2026-05-18T02:30:47.341112+00:00","updated_at":"2026-05-18T02:30:47.341112+00:00"}