{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G3MYLGH5ZIAUR2NOGK3QZRGSK6","short_pith_number":"pith:G3MYLGH5","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"},"canonical_sha256":"36d98598fdca0148e9ae32b70cc4d2579c8e81fe1ae802aee16bbcfbf8b29434","source":{"kind":"arxiv","id":"1602.07967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07967","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07967v1","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07967","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"pith_short_12","alias_value":"G3MYLGH5ZIAU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G3MYLGH5ZIAUR2NO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G3MYLGH5","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G3MYLGH5ZIAUR2NOGK3QZRGSK6","target":"record","payload":{"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"},"canonical_sha256":"36d98598fdca0148e9ae32b70cc4d2579c8e81fe1ae802aee16bbcfbf8b29434","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"},"source_kind":"arxiv","source_id":"1602.07967","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlXvz0h48G3h1IXqPJat6s8Qsa1LdsBpLkRhlIwDcYrnfN+HHdxOftovNqLRlBPG634WBtgk+VRGFc5EjntkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:03:55.788479Z"},"content_sha256":"37251a63bca776166fe0cd50ad4a80b304a6e5a563c3c77a1947741b2a1e193b","schema_version":"1.0","event_id":"sha256:37251a63bca776166fe0cd50ad4a80b304a6e5a563c3c77a1947741b2a1e193b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G3MYLGH5ZIAUR2NOGK3QZRGSK6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jo3dOzXoMNgHvzRmsVzgWvuloT1DQEAGsHeZQBhQCSNc7kpiz5leAUGDMiweHJVdVoI+ZEn4/sQV+jRXHj5PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:03:55.789151Z"},"content_sha256":"faeebf7cb85ad1c8c778b4d5094991c19adde7095a275f5cbb246116f5d8768d","schema_version":"1.0","event_id":"sha256:faeebf7cb85ad1c8c778b4d5094991c19adde7095a275f5cbb246116f5d8768d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/bundle.json","state_url":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T05:03:55Z","links":{"resolver":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6","bundle":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/bundle.json","state":"https://pith.science/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3MYLGH5ZIAUR2NOGK3QZRGSK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G3MYLGH5ZIAUR2NOGK3QZRGSK6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"13321c6526c465669c3f62bd39eeb97ff98da5ec55a7d07f505d5176a6ad6585","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-25T15:38:12Z","title_canon_sha256":"53829191b1d9e3c581f0dcdbed4bc19081587f55936053cee529be5a0652e47a"},"schema_version":"1.0","source":{"id":"1602.07967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07967","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07967v1","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07967","created_at":"2026-05-18T01:19:58Z"},{"alias_kind":"pith_short_12","alias_value":"G3MYLGH5ZIAU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G3MYLGH5ZIAUR2NO","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G3MYLGH5","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:faeebf7cb85ad1c8c778b4d5094991c19adde7095a275f5cbb246116f5d8768d","target":"graph","created_at":"2026-05-18T01:19:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Abuzer Yakary{\\i}lmaz, Aleksandrs Belovs, Juan Andres Montoya","cross_cats":["cs.CC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-25T15:38:12Z","title":"Can one quantum bit separate any pair of words with zero-error?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07967","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:37251a63bca776166fe0cd50ad4a80b304a6e5a563c3c77a1947741b2a1e193b","target":"record","created_at":"2026-05-18T01:19:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"13321c6526c465669c3f62bd39eeb97ff98da5ec55a7d07f505d5176a6ad6585","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-02-25T15:38:12Z","title_canon_sha256":"53829191b1d9e3c581f0dcdbed4bc19081587f55936053cee529be5a0652e47a"},"schema_version":"1.0","source":{"id":"1602.07967","kind":"arxiv","version":1}},"canonical_sha256":"36d98598fdca0148e9ae32b70cc4d2579c8e81fe1ae802aee16bbcfbf8b29434","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36d98598fdca0148e9ae32b70cc4d2579c8e81fe1ae802aee16bbcfbf8b29434","first_computed_at":"2026-05-18T01:19:58.147820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:58.147820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1KeaVc7mWOfEY6a7RifHGhOIoOFD6HqGzWekrHXF1KXHbOPnVQ9gJE88ZkMBWOcvU/h3GjJ02t+M2PDsu/NjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:58.148567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37251a63bca776166fe0cd50ad4a80b304a6e5a563c3c77a1947741b2a1e193b","sha256:faeebf7cb85ad1c8c778b4d5094991c19adde7095a275f5cbb246116f5d8768d"],"state_sha256":"1f11cc62db2b77e3e2d7aa61fd3be77539890bd2cb81dda5a9cc9b9deb3d5602"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtdO1ZZCOi4yDM+KDLii6R21jf7UVijeYqh8ftp5N4bcsIuCxTHNnpAyhkdC2QE8yt1pa1TjlWhz9MvED70PAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:03:55.792872Z","bundle_sha256":"cf916d4f27b7f4457b45bbbe920cb28e24a39ac36936ac94331a0f6f882c73cf"}}