{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:KWGFZ7Q75PV456B6UHUBGFY7EA","short_pith_number":"pith:KWGFZ7Q7","canonical_record":{"source":{"id":"0812.1061","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2008-12-05T00:53:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8969b868f9286a1a40261a5ea3b2f965d7739dbb52d7596ecdec3c3a9ce91aae","abstract_canon_sha256":"18f148f0b7a9b9d4dba8b96c9b5a632e2c523d55e60e74b971466e30d541bee4"},"schema_version":"1.0"},"canonical_sha256":"558c5cfe1febebcef83ea1e813171f202141d241c62da1c813a948ea9d53f2db","source":{"kind":"arxiv","id":"0812.1061","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.1061","created_at":"2026-05-18T04:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"0812.1061v6","created_at":"2026-05-18T04:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.1061","created_at":"2026-05-18T04:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"KWGFZ7Q75PV4","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"KWGFZ7Q75PV456B6","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"KWGFZ7Q7","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:KWGFZ7Q75PV456B6UHUBGFY7EA","target":"record","payload":{"canonical_record":{"source":{"id":"0812.1061","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2008-12-05T00:53:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8969b868f9286a1a40261a5ea3b2f965d7739dbb52d7596ecdec3c3a9ce91aae","abstract_canon_sha256":"18f148f0b7a9b9d4dba8b96c9b5a632e2c523d55e60e74b971466e30d541bee4"},"schema_version":"1.0"},"canonical_sha256":"558c5cfe1febebcef83ea1e813171f202141d241c62da1c813a948ea9d53f2db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:14.483015Z","signature_b64":"Hp1Rz6l0Ft0lQSK3gTSUBpmoQ/BnidFzR7ErxovLspIlDnbO+u1jomxBfi6SF4IValKpYGxMesmMmWkvah5QBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"558c5cfe1febebcef83ea1e813171f202141d241c62da1c813a948ea9d53f2db","last_reissued_at":"2026-05-18T04:38:14.482520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:14.482520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0812.1061","source_version":6,"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-18T04:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Hj0mwL6coRzjXDEFuRPZTiHGC0gDf5jqEYUx5N6pTvHiz1Gy+/PLzB/xFXqMikmO8n/sWhhnr92ISVXcpK6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:40:52.557333Z"},"content_sha256":"42cb3e5abaf46d2ff4131302f59d4085879d942b35b252805f49ee764faad3ee","schema_version":"1.0","event_id":"sha256:42cb3e5abaf46d2ff4131302f59d4085879d942b35b252805f49ee764faad3ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:KWGFZ7Q75PV456B6UHUBGFY7EA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decidability of the Equivalence of Multi-Letter Quantum Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Daowen Qiu, Lvzhou Li, Paulo Mateus, Xiangfu Zou","submitted_at":"2008-12-05T00:53:20Z","abstract_excerpt":"Multi-letter {\\it quantum finite automata} (QFAs) were a quantum variant of classical {\\it one-way multi-head finite automata} (J. Hromkovi\\v{c}, Acta Informatica 19 (1983) 377-384), and it has been shown that this new one-way QFAs (multi-letter QFAs) can accept with no error some regular languages $(a+b)^{*}b$ that are unacceptable by the previous one-way QFAs. In this paper, we study the decidability of the equivalence of multi-letter QFAs, and the main technical contributions are as follows: (1) We show that any two automata, a $k_{1}$-letter QFA ${\\cal A}_1$ and a $k_{2}$-letter QFA ${\\cal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.1061","kind":"arxiv","version":6},"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-18T04:38:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyKJdueO+iv+oSpmWHrYMmQVc/4sRbHDVYINpIKcOPnfM5TucQ7aM+6DHltbgQdRgHCbbyAutlJGerVNFG+tBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:40:52.557689Z"},"content_sha256":"18f1c7c558420ab2d44ad742113ac14643825d1417b7a22859df912bf1464fe5","schema_version":"1.0","event_id":"sha256:18f1c7c558420ab2d44ad742113ac14643825d1417b7a22859df912bf1464fe5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWGFZ7Q75PV456B6UHUBGFY7EA/bundle.json","state_url":"https://pith.science/pith/KWGFZ7Q75PV456B6UHUBGFY7EA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWGFZ7Q75PV456B6UHUBGFY7EA/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-02T01:40:52Z","links":{"resolver":"https://pith.science/pith/KWGFZ7Q75PV456B6UHUBGFY7EA","bundle":"https://pith.science/pith/KWGFZ7Q75PV456B6UHUBGFY7EA/bundle.json","state":"https://pith.science/pith/KWGFZ7Q75PV456B6UHUBGFY7EA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWGFZ7Q75PV456B6UHUBGFY7EA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:KWGFZ7Q75PV456B6UHUBGFY7EA","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":"18f148f0b7a9b9d4dba8b96c9b5a632e2c523d55e60e74b971466e30d541bee4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2008-12-05T00:53:20Z","title_canon_sha256":"8969b868f9286a1a40261a5ea3b2f965d7739dbb52d7596ecdec3c3a9ce91aae"},"schema_version":"1.0","source":{"id":"0812.1061","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.1061","created_at":"2026-05-18T04:38:14Z"},{"alias_kind":"arxiv_version","alias_value":"0812.1061v6","created_at":"2026-05-18T04:38:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.1061","created_at":"2026-05-18T04:38:14Z"},{"alias_kind":"pith_short_12","alias_value":"KWGFZ7Q75PV4","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"KWGFZ7Q75PV456B6","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"KWGFZ7Q7","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:18f1c7c558420ab2d44ad742113ac14643825d1417b7a22859df912bf1464fe5","target":"graph","created_at":"2026-05-18T04:38:14Z","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":"Multi-letter {\\it quantum finite automata} (QFAs) were a quantum variant of classical {\\it one-way multi-head finite automata} (J. Hromkovi\\v{c}, Acta Informatica 19 (1983) 377-384), and it has been shown that this new one-way QFAs (multi-letter QFAs) can accept with no error some regular languages $(a+b)^{*}b$ that are unacceptable by the previous one-way QFAs. In this paper, we study the decidability of the equivalence of multi-letter QFAs, and the main technical contributions are as follows: (1) We show that any two automata, a $k_{1}$-letter QFA ${\\cal A}_1$ and a $k_{2}$-letter QFA ${\\cal","authors_text":"Daowen Qiu, Lvzhou Li, Paulo Mateus, Xiangfu Zou","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2008-12-05T00:53:20Z","title":"Decidability of the Equivalence of Multi-Letter Quantum Finite Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.1061","kind":"arxiv","version":6},"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:42cb3e5abaf46d2ff4131302f59d4085879d942b35b252805f49ee764faad3ee","target":"record","created_at":"2026-05-18T04:38:14Z","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":"18f148f0b7a9b9d4dba8b96c9b5a632e2c523d55e60e74b971466e30d541bee4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2008-12-05T00:53:20Z","title_canon_sha256":"8969b868f9286a1a40261a5ea3b2f965d7739dbb52d7596ecdec3c3a9ce91aae"},"schema_version":"1.0","source":{"id":"0812.1061","kind":"arxiv","version":6}},"canonical_sha256":"558c5cfe1febebcef83ea1e813171f202141d241c62da1c813a948ea9d53f2db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"558c5cfe1febebcef83ea1e813171f202141d241c62da1c813a948ea9d53f2db","first_computed_at":"2026-05-18T04:38:14.482520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:14.482520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hp1Rz6l0Ft0lQSK3gTSUBpmoQ/BnidFzR7ErxovLspIlDnbO+u1jomxBfi6SF4IValKpYGxMesmMmWkvah5QBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:14.483015Z","signed_message":"canonical_sha256_bytes"},"source_id":"0812.1061","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42cb3e5abaf46d2ff4131302f59d4085879d942b35b252805f49ee764faad3ee","sha256:18f1c7c558420ab2d44ad742113ac14643825d1417b7a22859df912bf1464fe5"],"state_sha256":"1bd6d7a507d203c1a0303ee2f0d5176fc628d6784810756c7c1cf3eff4b800d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tl8jZJBiuws2nVMvzeBWvZWeQrctMZe0Ua8ahln8eatvDCoAL4CzhY2VHe9hUG0mF+lyvC8yv33C7Tb6vicPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:40:52.559555Z","bundle_sha256":"7a9a6e8e7269a40651a8586547557c70cc8c16ec083479924aeecf79c42291f2"}}