{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:DMFNDRCNKQWPZCBA4QO6LRFEE2","short_pith_number":"pith:DMFNDRCN","schema_version":"1.0","canonical_sha256":"1b0ad1c44d542cfc8820e41de5c4a426b0d19c679346784c8914a0cce5b277b6","source":{"kind":"arxiv","id":"quant-ph/0009004","version":1},"attestation_state":"computed","paper":{"title":"On the class of languages recognizable by 1-way quantum finite automata","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Arnolds Kikusts, Maris Valdats","submitted_at":"2000-09-01T17:41:45Z","abstract_excerpt":"It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient.\n  Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant."},"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":"quant-ph/0009004","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-09-01T17:41:45Z","cross_cats_sorted":[],"title_canon_sha256":"6eca0f8c49a1db5724c1ff5dc8de1c3e8e342aefb9c6b26fbac1dcc2cd400666","abstract_canon_sha256":"3abe1f480f238f31584748c4410c0f4bfd4e89f0b063addda68a532bfa4b36a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:31.357557Z","signature_b64":"3SGO6BXFRFDwVVIOREYiHlYEC7C4alESYDPYpXvWn7SvDw0lFZ4d2c4RjPnaSnzT6xGRiuVochfD4x8pL4EtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b0ad1c44d542cfc8820e41de5c4a426b0d19c679346784c8914a0cce5b277b6","last_reissued_at":"2026-07-04T14:45:31.357190Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:31.357190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the class of languages recognizable by 1-way quantum finite automata","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Arnolds Kikusts, Maris Valdats","submitted_at":"2000-09-01T17:41:45Z","abstract_excerpt":"It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient.\n  Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0009004","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0009004/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"quant-ph/0009004","created_at":"2026-07-04T14:45:31.357242+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0009004v1","created_at":"2026-07-04T14:45:31.357242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0009004","created_at":"2026-07-04T14:45:31.357242+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMFNDRCNKQWP","created_at":"2026-07-04T14:45:31.357242+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMFNDRCNKQWPZCBA","created_at":"2026-07-04T14:45:31.357242+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMFNDRCN","created_at":"2026-07-04T14:45:31.357242+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/DMFNDRCNKQWPZCBA4QO6LRFEE2","json":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2.json","graph_json":"https://pith.science/api/pith-number/DMFNDRCNKQWPZCBA4QO6LRFEE2/graph.json","events_json":"https://pith.science/api/pith-number/DMFNDRCNKQWPZCBA4QO6LRFEE2/events.json","paper":"https://pith.science/paper/DMFNDRCN"},"agent_actions":{"view_html":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2","download_json":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2.json","view_paper":"https://pith.science/paper/DMFNDRCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0009004&json=true","fetch_graph":"https://pith.science/api/pith-number/DMFNDRCNKQWPZCBA4QO6LRFEE2/graph.json","fetch_events":"https://pith.science/api/pith-number/DMFNDRCNKQWPZCBA4QO6LRFEE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/action/storage_attestation","attest_author":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/action/author_attestation","sign_citation":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/action/citation_signature","submit_replication":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/action/replication_record"}},"created_at":"2026-07-04T14:45:31.357242+00:00","updated_at":"2026-07-04T14:45:31.357242+00:00"}