{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:AN67FOWDRDDJJIY55DR7BGCLJF","short_pith_number":"pith:AN67FOWD","canonical_record":{"source":{"id":"0909.1428","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-09-08T08:57:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"75c5034b00993a8dd8db601265ce1539100fc82f99390f5ea9f772585e9c422e","abstract_canon_sha256":"017211de7175ce229f88b4ae5cddf1b06633362ec6eeddc08d37c52264931ed4"},"schema_version":"1.0"},"canonical_sha256":"037df2bac388c694a31de8e3f0984b496b5f53d5e5c15da952a6ab5ef30fb60d","source":{"kind":"arxiv","id":"0909.1428","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.1428","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"0909.1428v5","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1428","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"AN67FOWDRDDJ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"AN67FOWDRDDJJIY5","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"AN67FOWD","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:AN67FOWDRDDJJIY55DR7BGCLJF","target":"record","payload":{"canonical_record":{"source":{"id":"0909.1428","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-09-08T08:57:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"75c5034b00993a8dd8db601265ce1539100fc82f99390f5ea9f772585e9c422e","abstract_canon_sha256":"017211de7175ce229f88b4ae5cddf1b06633362ec6eeddc08d37c52264931ed4"},"schema_version":"1.0"},"canonical_sha256":"037df2bac388c694a31de8e3f0984b496b5f53d5e5c15da952a6ab5ef30fb60d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:26.059416Z","signature_b64":"2f+frqhXals7pZ1WbEn6YqLJRajkxX+HG0ECKZ24KN4GcB2QNQT2Dx2VY0kGuNOtCFlqdotW8FQvQYw5bF9ZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037df2bac388c694a31de8e3f0984b496b5f53d5e5c15da952a6ab5ef30fb60d","last_reissued_at":"2026-05-18T03:25:26.058951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:26.058951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.1428","source_version":5,"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-18T03:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S7scM6AXJnt8NdUtzKQKBjDt9opch9R9xQCDPi3stxwYh/uLheW/USBAyDqI6ucPZJ14oaRCZLBYTyGFUXXzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:35:25.186650Z"},"content_sha256":"088d4dbca5821b69b4e0e603bf92f463ec76b90ab8908c94acc66178e75d10a7","schema_version":"1.0","event_id":"sha256:088d4dbca5821b69b4e0e603bf92f463ec76b90ab8908c94acc66178e75d10a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:AN67FOWDRDDJJIY55DR7BGCLJF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponentially more concise quantum recognition of non-RMM regular languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Amilcar Sernadas, Daowen Qiu, Lvzhou Li, Paulo Mateus","submitted_at":"2009-09-08T08:57:26Z","abstract_excerpt":"We show that there are quantum devices that accept all regular languages and that are exponentially more concise than deterministic finite automata (DFA). For this purpose, we introduce a new computing model of {\\it one-way quantum finite automata} (1QFA), namely, {\\it one-way quantum finite automata together with classical states} (1QFAC), which extends naturally both measure-only 1QFA and DFA and whose state complexity is upper-bounded by both. The original contributions of the paper are the following. First, we show that the set of languages accepted by 1QFAC with bounded error consists pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1428","kind":"arxiv","version":5},"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-18T03:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6EDnq8yjzAz7uV2vGVzLYMcOURSL5ouRyROhSeFxmLTC6TnHxx4jo2fMipBB6jkk479NyUJ0dRN3yIo0zfELAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:35:25.187114Z"},"content_sha256":"b5e95a21ba62bc790b79b5d2793a1a647f54d78396a6ed790d78e664c1fad827","schema_version":"1.0","event_id":"sha256:b5e95a21ba62bc790b79b5d2793a1a647f54d78396a6ed790d78e664c1fad827"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN67FOWDRDDJJIY55DR7BGCLJF/bundle.json","state_url":"https://pith.science/pith/AN67FOWDRDDJJIY55DR7BGCLJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN67FOWDRDDJJIY55DR7BGCLJF/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-25T21:35:25Z","links":{"resolver":"https://pith.science/pith/AN67FOWDRDDJJIY55DR7BGCLJF","bundle":"https://pith.science/pith/AN67FOWDRDDJJIY55DR7BGCLJF/bundle.json","state":"https://pith.science/pith/AN67FOWDRDDJJIY55DR7BGCLJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN67FOWDRDDJJIY55DR7BGCLJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:AN67FOWDRDDJJIY55DR7BGCLJF","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":"017211de7175ce229f88b4ae5cddf1b06633362ec6eeddc08d37c52264931ed4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-09-08T08:57:26Z","title_canon_sha256":"75c5034b00993a8dd8db601265ce1539100fc82f99390f5ea9f772585e9c422e"},"schema_version":"1.0","source":{"id":"0909.1428","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.1428","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"0909.1428v5","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1428","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"AN67FOWDRDDJ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"AN67FOWDRDDJJIY5","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"AN67FOWD","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:b5e95a21ba62bc790b79b5d2793a1a647f54d78396a6ed790d78e664c1fad827","target":"graph","created_at":"2026-05-18T03:25:26Z","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":"We show that there are quantum devices that accept all regular languages and that are exponentially more concise than deterministic finite automata (DFA). For this purpose, we introduce a new computing model of {\\it one-way quantum finite automata} (1QFA), namely, {\\it one-way quantum finite automata together with classical states} (1QFAC), which extends naturally both measure-only 1QFA and DFA and whose state complexity is upper-bounded by both. The original contributions of the paper are the following. First, we show that the set of languages accepted by 1QFAC with bounded error consists pre","authors_text":"Amilcar Sernadas, Daowen Qiu, Lvzhou Li, Paulo Mateus","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-09-08T08:57:26Z","title":"Exponentially more concise quantum recognition of non-RMM regular languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1428","kind":"arxiv","version":5},"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:088d4dbca5821b69b4e0e603bf92f463ec76b90ab8908c94acc66178e75d10a7","target":"record","created_at":"2026-05-18T03:25:26Z","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":"017211de7175ce229f88b4ae5cddf1b06633362ec6eeddc08d37c52264931ed4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-09-08T08:57:26Z","title_canon_sha256":"75c5034b00993a8dd8db601265ce1539100fc82f99390f5ea9f772585e9c422e"},"schema_version":"1.0","source":{"id":"0909.1428","kind":"arxiv","version":5}},"canonical_sha256":"037df2bac388c694a31de8e3f0984b496b5f53d5e5c15da952a6ab5ef30fb60d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"037df2bac388c694a31de8e3f0984b496b5f53d5e5c15da952a6ab5ef30fb60d","first_computed_at":"2026-05-18T03:25:26.058951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:26.058951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2f+frqhXals7pZ1WbEn6YqLJRajkxX+HG0ECKZ24KN4GcB2QNQT2Dx2VY0kGuNOtCFlqdotW8FQvQYw5bF9ZAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:26.059416Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.1428","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:088d4dbca5821b69b4e0e603bf92f463ec76b90ab8908c94acc66178e75d10a7","sha256:b5e95a21ba62bc790b79b5d2793a1a647f54d78396a6ed790d78e664c1fad827"],"state_sha256":"b50ab73a6f4aa1775955be7e5156001f134a0327af772e188a1f90d966032593"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOvkyb0Ub8YvdJ3Rl01s7I4hxwt0+AdyrHwUsYtVmcAs+cZXTFJv6fj5vz0Zkli0fgE7dZPrlQ22c9LHrJ9UDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T21:35:25.189694Z","bundle_sha256":"1177162cecff27848e7c915446a4549c647c4b8a1ecb859307d5d1cdace160ac"}}