{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:DMFNDRCNKQWPZCBA4QO6LRFEE2","short_pith_number":"pith:DMFNDRCN","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"},"canonical_sha256":"1b0ad1c44d542cfc8820e41de5c4a426b0d19c679346784c8914a0cce5b277b6","source":{"kind":"arxiv","id":"quant-ph/0009004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0009004","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0009004v1","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0009004","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"DMFNDRCNKQWP","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"pith_short_16","alias_value":"DMFNDRCNKQWPZCBA","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"pith_short_8","alias_value":"DMFNDRCN","created_at":"2026-07-04T14:45:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:DMFNDRCNKQWPZCBA4QO6LRFEE2","target":"record","payload":{"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"},"canonical_sha256":"1b0ad1c44d542cfc8820e41de5c4a426b0d19c679346784c8914a0cce5b277b6","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"},"source_kind":"arxiv","source_id":"quant-ph/0009004","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-07-04T14:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6LEcoKP+k/Yvo6nq3j9xXvRn4Ml3qUFS5wpSvGttci5B2JjivJoguCO4J4yg+eEHHOGCI2089WzGUWs72TCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:58:30.977760Z"},"content_sha256":"1f0faee2deed5fc0920105d1778f06a8e064980a4f05dac23d0f9c298bbe8d89","schema_version":"1.0","event_id":"sha256:1f0faee2deed5fc0920105d1778f06a8e064980a4f05dac23d0f9c298bbe8d89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:DMFNDRCNKQWPZCBA4QO6LRFEE2","target":"graph","payload":{"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"},"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-07-04T14:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5f7Dy5uHjinrYO9oaC6vuALr/Jorw+s7KxGdFF2hPNa6guS0FUKvfcBrHm00RA4hiqmQJPuteZpG0AJ4WElCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:58:30.978269Z"},"content_sha256":"155cf58d6972137995038fc479b9ac38895e0002191dc8d843ca3e909721c022","schema_version":"1.0","event_id":"sha256:155cf58d6972137995038fc479b9ac38895e0002191dc8d843ca3e909721c022"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/bundle.json","state_url":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/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-08-07T07:58:30Z","links":{"resolver":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2","bundle":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/bundle.json","state":"https://pith.science/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMFNDRCNKQWPZCBA4QO6LRFEE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:DMFNDRCNKQWPZCBA4QO6LRFEE2","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":"3abe1f480f238f31584748c4410c0f4bfd4e89f0b063addda68a532bfa4b36a0","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-09-01T17:41:45Z","title_canon_sha256":"6eca0f8c49a1db5724c1ff5dc8de1c3e8e342aefb9c6b26fbac1dcc2cd400666"},"schema_version":"1.0","source":{"id":"quant-ph/0009004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0009004","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0009004v1","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0009004","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"DMFNDRCNKQWP","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"pith_short_16","alias_value":"DMFNDRCNKQWPZCBA","created_at":"2026-07-04T14:45:31Z"},{"alias_kind":"pith_short_8","alias_value":"DMFNDRCN","created_at":"2026-07-04T14:45:31Z"}],"graph_snapshots":[{"event_id":"sha256:155cf58d6972137995038fc479b9ac38895e0002191dc8d843ca3e909721c022","target":"graph","created_at":"2026-07-04T14:45:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0009004/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Andris Ambainis, Arnolds Kikusts, Maris Valdats","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2000-09-01T17:41:45Z","title":"On the class of languages recognizable by 1-way quantum finite automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0009004","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:1f0faee2deed5fc0920105d1778f06a8e064980a4f05dac23d0f9c298bbe8d89","target":"record","created_at":"2026-07-04T14:45:31Z","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":"3abe1f480f238f31584748c4410c0f4bfd4e89f0b063addda68a532bfa4b36a0","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-09-01T17:41:45Z","title_canon_sha256":"6eca0f8c49a1db5724c1ff5dc8de1c3e8e342aefb9c6b26fbac1dcc2cd400666"},"schema_version":"1.0","source":{"id":"quant-ph/0009004","kind":"arxiv","version":1}},"canonical_sha256":"1b0ad1c44d542cfc8820e41de5c4a426b0d19c679346784c8914a0cce5b277b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b0ad1c44d542cfc8820e41de5c4a426b0d19c679346784c8914a0cce5b277b6","first_computed_at":"2026-07-04T14:45:31.357190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:45:31.357190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3SGO6BXFRFDwVVIOREYiHlYEC7C4alESYDPYpXvWn7SvDw0lFZ4d2c4RjPnaSnzT6xGRiuVochfD4x8pL4EtCw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:45:31.357557Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0009004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f0faee2deed5fc0920105d1778f06a8e064980a4f05dac23d0f9c298bbe8d89","sha256:155cf58d6972137995038fc479b9ac38895e0002191dc8d843ca3e909721c022"],"state_sha256":"94acd4d6ef6c9e0e010009e73982bee79ed8611425691d783dae256f6074841c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29OxxOx+K3/DOgkDhnTx6QmZwV4MF4W25tu6VuWO11N2kTknwLztId+bQ7eocqgFjAnZ3lp7UKuJtHnrO2LpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T07:58:30.983903Z","bundle_sha256":"3506c9aa7599784fea42877bc90e15a418d4e5c1956dca96ce5cb9e63465bab4"}}