{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G3MYLGH5ZIAUR2NOGK3QZRGSK6","short_pith_number":"pith:G3MYLGH5","schema_version":"1.0","canonical_sha256":"36d98598fdca0148e9ae32b70cc4d2579c8e81fe1ae802aee16bbcfbf8b29434","source":{"kind":"arxiv","id":"1602.07967","version":1},"attestation_state":"computed","paper":{"title":"Can one quantum bit separate any pair of words with zero-error?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cs.FL","authors_text":"Abuzer Yakary{\\i}lmaz, Aleksandrs Belovs, Juan Andres Montoya","submitted_at":"2016-02-25T15:38:12Z","abstract_excerpt":"Determining the minimum number of states required by a finite automaton to separate a given pair of different words is an important problem. In this paper, we consider this problem for quantum automata (QFAs). We show that 2-state QFAs can separate any pair of words in nondeterministic acceptance mode and conjecture that they can separate any pair also with zero-error. Then, we focus on (a more general problem) separating a pair of two disjoint finite set of words. We show that QFAs can separate them efficiently in nondeterministic acceptance mode, i.e. the number of states is two to the power"},"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":"1602.07967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-25T15:38:12Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"53829191b1d9e3c581f0dcdbed4bc19081587f55936053cee529be5a0652e47a","abstract_canon_sha256":"13321c6526c465669c3f62bd39eeb97ff98da5ec55a7d07f505d5176a6ad6585"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:58.148567Z","signature_b64":"1KeaVc7mWOfEY6a7RifHGhOIoOFD6HqGzWekrHXF1KXHbOPnVQ9gJE88ZkMBWOcvU/h3GjJ02t+M2PDsu/NjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36d98598fdca0148e9ae32b70cc4d2579c8e81fe1ae802aee16bbcfbf8b29434","last_reissued_at":"2026-05-18T01:19:58.147820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:58.147820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can one quantum bit separate any pair of words with zero-error?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cs.FL","authors_text":"Abuzer Yakary{\\i}lmaz, Aleksandrs Belovs, Juan Andres Montoya","submitted_at":"2016-02-25T15:38:12Z","abstract_excerpt":"Determining the minimum number of states required by a finite automaton to separate a given pair of different words is an important problem. In this paper, we consider this problem for quantum automata (QFAs). We show that 2-state QFAs can separate any pair of words in nondeterministic acceptance mode and conjecture that they can separate any pair also with zero-error. Then, we focus on (a more general problem) separating a pair of two disjoint finite set of words. We show that QFAs can separate them efficiently in nondeterministic acceptance mode, i.e. the number of states is two to the power"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07967","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":"1602.07967","created_at":"2026-05-18T01:19:58.147939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07967v1","created_at":"2026-05-18T01:19:58.147939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07967","created_at":"2026-05-18T01:19:58.147939+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3MYLGH5ZIAU","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3MYLGH5ZIAUR2NO","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3MYLGH5","created_at":"2026-05-18T12:30:15.759754+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/G3MYLGH5ZIAUR2NOGK3QZRGSK6","json":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6.json","graph_json":"https://pith.science/api/pith-number/G3MYLGH5ZIAUR2NOGK3QZRGSK6/graph.json","events_json":"https://pith.science/api/pith-number/G3MYLGH5ZIAUR2NOGK3QZRGSK6/events.json","paper":"https://pith.science/paper/G3MYLGH5"},"agent_actions":{"view_html":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6","download_json":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6.json","view_paper":"https://pith.science/paper/G3MYLGH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07967&json=true","fetch_graph":"https://pith.science/api/pith-number/G3MYLGH5ZIAUR2NOGK3QZRGSK6/graph.json","fetch_events":"https://pith.science/api/pith-number/G3MYLGH5ZIAUR2NOGK3QZRGSK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/action/storage_attestation","attest_author":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/action/author_attestation","sign_citation":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/action/citation_signature","submit_replication":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/action/replication_record"}},"created_at":"2026-05-18T01:19:58.147939+00:00","updated_at":"2026-05-18T01:19:58.147939+00:00"}