{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MKRFADMJQS6VE26OWJB7CJSRXQ","short_pith_number":"pith:MKRFADMJ","canonical_record":{"source":{"id":"1901.07992","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-01-23T16:44:21Z","cross_cats_sorted":[],"title_canon_sha256":"00297a4d2e01581a5180fd683a267bf60206b5e534c958f332ecde8042b52f2f","abstract_canon_sha256":"882953e1aff25e3f1e423628dac2cf4ca68a973ec248eeb2c5052b3c6edcdeb5"},"schema_version":"1.0"},"canonical_sha256":"62a2500d8984bd526bceb243f12651bc09fc3309aa7f1ee820de82b4417f82d1","source":{"kind":"arxiv","id":"1901.07992","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07992","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07992v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07992","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"MKRFADMJQS6V","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MKRFADMJQS6VE26O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MKRFADMJ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MKRFADMJQS6VE26OWJB7CJSRXQ","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07992","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-01-23T16:44:21Z","cross_cats_sorted":[],"title_canon_sha256":"00297a4d2e01581a5180fd683a267bf60206b5e534c958f332ecde8042b52f2f","abstract_canon_sha256":"882953e1aff25e3f1e423628dac2cf4ca68a973ec248eeb2c5052b3c6edcdeb5"},"schema_version":"1.0"},"canonical_sha256":"62a2500d8984bd526bceb243f12651bc09fc3309aa7f1ee820de82b4417f82d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:39.365093Z","signature_b64":"aAwZR+pk+R/BQo3fGtQ9DAMS5au3HbRCt6hfcr64VE95BJgYc2qGt0NGesylOnzj/DOJh6zLPg3wBhyJ2JXmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62a2500d8984bd526bceb243f12651bc09fc3309aa7f1ee820de82b4417f82d1","last_reissued_at":"2026-05-17T23:55:39.364640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:39.364640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07992","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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiWCV4C7CKVEGabMpjK1d3zvp2pSTSA+ium0NzsvX0DK1Pgga/dBhFkDQevsKWIVF7nA0RqFWie/I5y4A5YWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:58:30.697814Z"},"content_sha256":"afbd37d9d431c21989c920214eeb281f3d2b801d1d42cfb2101203cf727c16ab","schema_version":"1.0","event_id":"sha256:afbd37d9d431c21989c920214eeb281f3d2b801d1d42cfb2101203cf727c16ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MKRFADMJQS6VE26OWJB7CJSRXQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum finite automata: survey, status and research directions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Ajay Kumar, Amandeep Singh Bhatia","submitted_at":"2019-01-23T16:44:21Z","abstract_excerpt":"Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for computations. Quantum automata can be classified thusly: quantum finite automata, quantum sequential machine, quantum pushdown automata, quantum Turing machine and orthomodular lattice-valued automata. These models are useful for determining the expressive power and boundaries of various computational features. In light of the current state of quantum computation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07992","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-17T23:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJNt0e0BliJsE9+GE30OCjxSvPz1kGX9tf465uh9TTqIgvFXjF8O7Jk2PAexDEUHj1ex0FLHN8xsbqBa6NezCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T04:58:30.698144Z"},"content_sha256":"9e34ac3a9a363eaf0ad093fed42a9254b263e1945c6fd7598b37eeaf36441099","schema_version":"1.0","event_id":"sha256:9e34ac3a9a363eaf0ad093fed42a9254b263e1945c6fd7598b37eeaf36441099"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKRFADMJQS6VE26OWJB7CJSRXQ/bundle.json","state_url":"https://pith.science/pith/MKRFADMJQS6VE26OWJB7CJSRXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKRFADMJQS6VE26OWJB7CJSRXQ/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-28T04:58:30Z","links":{"resolver":"https://pith.science/pith/MKRFADMJQS6VE26OWJB7CJSRXQ","bundle":"https://pith.science/pith/MKRFADMJQS6VE26OWJB7CJSRXQ/bundle.json","state":"https://pith.science/pith/MKRFADMJQS6VE26OWJB7CJSRXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKRFADMJQS6VE26OWJB7CJSRXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MKRFADMJQS6VE26OWJB7CJSRXQ","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":"882953e1aff25e3f1e423628dac2cf4ca68a973ec248eeb2c5052b3c6edcdeb5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-01-23T16:44:21Z","title_canon_sha256":"00297a4d2e01581a5180fd683a267bf60206b5e534c958f332ecde8042b52f2f"},"schema_version":"1.0","source":{"id":"1901.07992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07992","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07992v1","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07992","created_at":"2026-05-17T23:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"MKRFADMJQS6V","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MKRFADMJQS6VE26O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MKRFADMJ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:9e34ac3a9a363eaf0ad093fed42a9254b263e1945c6fd7598b37eeaf36441099","target":"graph","created_at":"2026-05-17T23:55:39Z","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 concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for computations. Quantum automata can be classified thusly: quantum finite automata, quantum sequential machine, quantum pushdown automata, quantum Turing machine and orthomodular lattice-valued automata. These models are useful for determining the expressive power and boundaries of various computational features. In light of the current state of quantum computation ","authors_text":"Ajay Kumar, Amandeep Singh Bhatia","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-01-23T16:44:21Z","title":"Quantum finite automata: survey, status and research directions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07992","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:afbd37d9d431c21989c920214eeb281f3d2b801d1d42cfb2101203cf727c16ab","target":"record","created_at":"2026-05-17T23:55:39Z","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":"882953e1aff25e3f1e423628dac2cf4ca68a973ec248eeb2c5052b3c6edcdeb5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-01-23T16:44:21Z","title_canon_sha256":"00297a4d2e01581a5180fd683a267bf60206b5e534c958f332ecde8042b52f2f"},"schema_version":"1.0","source":{"id":"1901.07992","kind":"arxiv","version":1}},"canonical_sha256":"62a2500d8984bd526bceb243f12651bc09fc3309aa7f1ee820de82b4417f82d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62a2500d8984bd526bceb243f12651bc09fc3309aa7f1ee820de82b4417f82d1","first_computed_at":"2026-05-17T23:55:39.364640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:39.364640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aAwZR+pk+R/BQo3fGtQ9DAMS5au3HbRCt6hfcr64VE95BJgYc2qGt0NGesylOnzj/DOJh6zLPg3wBhyJ2JXmAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:39.365093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afbd37d9d431c21989c920214eeb281f3d2b801d1d42cfb2101203cf727c16ab","sha256:9e34ac3a9a363eaf0ad093fed42a9254b263e1945c6fd7598b37eeaf36441099"],"state_sha256":"606a1780aa41a7f6fa3d4dfbe511d46b653d88e697a801f9763513ec6eb6e1d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHkBTNsf0U8CRjzSWl3lCkVOaRZ9oli75Hy6X5XYx/BaRxjjvywVATsWw5Pz57AvODsl3wvSKsaQ/Ii9cXc3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T04:58:30.702065Z","bundle_sha256":"2373bb9565717402b43d555fe37614d078fb34026eb2c7e7913e26f3b37e8cfb"}}