{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MAXJ5VJ7NSFZKNV3VXVPUSIPRS","short_pith_number":"pith:MAXJ5VJ7","canonical_record":{"source":{"id":"1507.01988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-07T23:40:48Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"40a769bd4e076bd950441ead4c5dca8f45f9971856a10b374c1d03fdfc283dba","abstract_canon_sha256":"fb4c3c62ff6ce3d30a926abb4f95bda0de438e5bf3efd8484a45d45a81350287"},"schema_version":"1.0"},"canonical_sha256":"602e9ed53f6c8b9536bbadeafa490f8c92ef4720b61371e996800dd4aa4f9caa","source":{"kind":"arxiv","id":"1507.01988","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01988","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01988v2","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01988","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"MAXJ5VJ7NSFZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MAXJ5VJ7NSFZKNV3","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MAXJ5VJ7","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MAXJ5VJ7NSFZKNV3VXVPUSIPRS","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-07T23:40:48Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"40a769bd4e076bd950441ead4c5dca8f45f9971856a10b374c1d03fdfc283dba","abstract_canon_sha256":"fb4c3c62ff6ce3d30a926abb4f95bda0de438e5bf3efd8484a45d45a81350287"},"schema_version":"1.0"},"canonical_sha256":"602e9ed53f6c8b9536bbadeafa490f8c92ef4720b61371e996800dd4aa4f9caa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:32.854511Z","signature_b64":"mt7iReqhVpESvYFfBQ/RwGhCljjBo/hABAStV7xAASgir2fpSINjgPDJyuwvTp1FX9MHStyy+D0vjKMAX2txCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"602e9ed53f6c8b9536bbadeafa490f8c92ef4720b61371e996800dd4aa4f9caa","last_reissued_at":"2026-05-18T00:11:32.853930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:32.853930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01988","source_version":2,"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-18T00:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IP6ima8+wbQUWmtdUzQyiGaCw1AYvMBW49icPWmy/azr9kxbgdqNGtMjlzq73Or8x3JN5JyEEvK4tbQl8OPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:11.630286Z"},"content_sha256":"0f999deecc729ab775e622648b68c883f21630bb50fae93b5cf8b35c7b14bf12","schema_version":"1.0","event_id":"sha256:0f999deecc729ab775e622648b68c883f21630bb50fae93b5cf8b35c7b14bf12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MAXJ5VJ7NSFZKNV3VXVPUSIPRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automata and Quantum Computing","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, Andris Ambainis","submitted_at":"2015-07-07T23:40:48Z","abstract_excerpt":"Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers.\n  Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01988","kind":"arxiv","version":2},"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-18T00:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyVC9o+dpnE00QSLXTL4lQB8Z9KYQXnh24+5uqNqAllwwOJgqg8xFandStc34OhH4YO09TNWtkX2X8+mxQdKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:11.630694Z"},"content_sha256":"8d9894eb40d905dc59cb51d41c4a0a230d5e07425879e8a00b0d000b7f757502","schema_version":"1.0","event_id":"sha256:8d9894eb40d905dc59cb51d41c4a0a230d5e07425879e8a00b0d000b7f757502"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAXJ5VJ7NSFZKNV3VXVPUSIPRS/bundle.json","state_url":"https://pith.science/pith/MAXJ5VJ7NSFZKNV3VXVPUSIPRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAXJ5VJ7NSFZKNV3VXVPUSIPRS/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-05-25T18:26:11Z","links":{"resolver":"https://pith.science/pith/MAXJ5VJ7NSFZKNV3VXVPUSIPRS","bundle":"https://pith.science/pith/MAXJ5VJ7NSFZKNV3VXVPUSIPRS/bundle.json","state":"https://pith.science/pith/MAXJ5VJ7NSFZKNV3VXVPUSIPRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAXJ5VJ7NSFZKNV3VXVPUSIPRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MAXJ5VJ7NSFZKNV3VXVPUSIPRS","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":"fb4c3c62ff6ce3d30a926abb4f95bda0de438e5bf3efd8484a45d45a81350287","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-07T23:40:48Z","title_canon_sha256":"40a769bd4e076bd950441ead4c5dca8f45f9971856a10b374c1d03fdfc283dba"},"schema_version":"1.0","source":{"id":"1507.01988","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01988","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01988v2","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01988","created_at":"2026-05-18T00:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"MAXJ5VJ7NSFZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MAXJ5VJ7NSFZKNV3","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MAXJ5VJ7","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:8d9894eb40d905dc59cb51d41c4a0a230d5e07425879e8a00b0d000b7f757502","target":"graph","created_at":"2026-05-18T00:11:32Z","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":"Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers.\n  Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, ","authors_text":"Abuzer Yakary{\\i}lmaz, Andris Ambainis","cross_cats":["cs.CC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-07T23:40:48Z","title":"Automata and Quantum Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01988","kind":"arxiv","version":2},"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:0f999deecc729ab775e622648b68c883f21630bb50fae93b5cf8b35c7b14bf12","target":"record","created_at":"2026-05-18T00:11:32Z","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":"fb4c3c62ff6ce3d30a926abb4f95bda0de438e5bf3efd8484a45d45a81350287","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-07T23:40:48Z","title_canon_sha256":"40a769bd4e076bd950441ead4c5dca8f45f9971856a10b374c1d03fdfc283dba"},"schema_version":"1.0","source":{"id":"1507.01988","kind":"arxiv","version":2}},"canonical_sha256":"602e9ed53f6c8b9536bbadeafa490f8c92ef4720b61371e996800dd4aa4f9caa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"602e9ed53f6c8b9536bbadeafa490f8c92ef4720b61371e996800dd4aa4f9caa","first_computed_at":"2026-05-18T00:11:32.853930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:32.853930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mt7iReqhVpESvYFfBQ/RwGhCljjBo/hABAStV7xAASgir2fpSINjgPDJyuwvTp1FX9MHStyy+D0vjKMAX2txCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:32.854511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01988","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f999deecc729ab775e622648b68c883f21630bb50fae93b5cf8b35c7b14bf12","sha256:8d9894eb40d905dc59cb51d41c4a0a230d5e07425879e8a00b0d000b7f757502"],"state_sha256":"a17c404f5fe552b834c63e3d2e7010f6898d5534c439a3e2e1b2639b0a28bfee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPTXxB/lCSDfd4Qwi3OnDeT5C1zLrMDlfq2hvdJmmT49omgKpf8bXCMDYlWTQAt3pHfWBgsUpeauYQHX6LycCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:26:11.633477Z","bundle_sha256":"d7aaea8419bfe3d22ab0bc4c1b7ab580901ca35d67c7b16b134260f98e777313"}}