{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:U7WYXWTVS26YVJ3PAZM3ZX6SG4","short_pith_number":"pith:U7WYXWTV","canonical_record":{"source":{"id":"2107.02262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-05T20:41:18Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"968de2fa0fafc3a1547447606fe40d1f81104046e3432a4845d79670f5bf5a2b","abstract_canon_sha256":"8eaf3e1aeb5ff17dfeda8c54a0dc8aa3bb10f9e50f4b2d9ea98b86ba0d9bbaf4"},"schema_version":"1.0"},"canonical_sha256":"a7ed8bda7596bd8aa76f0659bcdfd2373694371db35f467c1e0b6a3019b265df","source":{"kind":"arxiv","id":"2107.02262","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.02262","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"2107.02262v2","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.02262","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"U7WYXWTVS26Y","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"pith_short_16","alias_value":"U7WYXWTVS26YVJ3P","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"pith_short_8","alias_value":"U7WYXWTV","created_at":"2026-07-05T05:24:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:U7WYXWTVS26YVJ3PAZM3ZX6SG4","target":"record","payload":{"canonical_record":{"source":{"id":"2107.02262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-05T20:41:18Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"968de2fa0fafc3a1547447606fe40d1f81104046e3432a4845d79670f5bf5a2b","abstract_canon_sha256":"8eaf3e1aeb5ff17dfeda8c54a0dc8aa3bb10f9e50f4b2d9ea98b86ba0d9bbaf4"},"schema_version":"1.0"},"canonical_sha256":"a7ed8bda7596bd8aa76f0659bcdfd2373694371db35f467c1e0b6a3019b265df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:24:09.261207Z","signature_b64":"0d66Cr9ySATa0uFGZvlXXITLRmYLBqJmxFJ2wp23rgVuWpiH/rTLfiqBLOjZ1e4kazGgrx8v44zkN6Z39NrkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7ed8bda7596bd8aa76f0659bcdfd2373694371db35f467c1e0b6a3019b265df","last_reissued_at":"2026-07-05T05:24:09.260806Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:24:09.260806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.02262","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-07-05T05:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gFqdjixWi4c6On5pmzscMX0Lb1geR+rCCzZK1iJLXGjKYoqg7zBT97WTlWBMMuAiAeO3SlSfc5x7NqYGDYZQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:03:48.434732Z"},"content_sha256":"21c7fbf19dc39793b4bc9369feff8c510294ec3bff9f8e609217c365024e5009","schema_version":"1.0","event_id":"sha256:21c7fbf19dc39793b4bc9369feff8c510294ec3bff9f8e609217c365024e5009"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:U7WYXWTVS26YVJ3PAZM3ZX6SG4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost-efficient QFA Algorithm for Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"quant-ph","authors_text":"Abuzer Yakary{\\i}lmaz, \\\"Ozlem Salehi","submitted_at":"2021-07-05T20:41:18Z","abstract_excerpt":"The study of quantum finite automata (QFAs) is one of the possible approaches in exploring quantum computers with finite memory. Despite being one of the most restricted models, Moore-Crutchfield quantum finite automaton (MCQFA) is proven to be exponentially more succinct than classical finite automata models in recognizing certain languages such as $\\mathtt{MOD}_p = \\{ a^{j} \\mid j \\equiv 0 \\mod p\\}$, where $p$ is a prime number. In this paper, we present a modified MCQFA algorithm for the language $\\mathtt{MOD}_p$, the operators of which are selected based on the basis gates on the available"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.02262","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.02262/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-05T05:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FFGuGwXLPMonFHKOFpFzKZhSjeIAYw/n8TSddLMnMA7TlkVCEU5elxa+YVXHEiV1z2ozbrA7qC0JGYZ8bh3qBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:03:48.435046Z"},"content_sha256":"34e3a143f681b19a93a9a5eb2d394924a2131c05421bc6404f639bc44b37cb9b","schema_version":"1.0","event_id":"sha256:34e3a143f681b19a93a9a5eb2d394924a2131c05421bc6404f639bc44b37cb9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/bundle.json","state_url":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/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-15T03:03:48Z","links":{"resolver":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4","bundle":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/bundle.json","state":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:U7WYXWTVS26YVJ3PAZM3ZX6SG4","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":"8eaf3e1aeb5ff17dfeda8c54a0dc8aa3bb10f9e50f4b2d9ea98b86ba0d9bbaf4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-05T20:41:18Z","title_canon_sha256":"968de2fa0fafc3a1547447606fe40d1f81104046e3432a4845d79670f5bf5a2b"},"schema_version":"1.0","source":{"id":"2107.02262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.02262","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"2107.02262v2","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.02262","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"U7WYXWTVS26Y","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"pith_short_16","alias_value":"U7WYXWTVS26YVJ3P","created_at":"2026-07-05T05:24:09Z"},{"alias_kind":"pith_short_8","alias_value":"U7WYXWTV","created_at":"2026-07-05T05:24:09Z"}],"graph_snapshots":[{"event_id":"sha256:34e3a143f681b19a93a9a5eb2d394924a2131c05421bc6404f639bc44b37cb9b","target":"graph","created_at":"2026-07-05T05:24:09Z","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/2107.02262/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The study of quantum finite automata (QFAs) is one of the possible approaches in exploring quantum computers with finite memory. Despite being one of the most restricted models, Moore-Crutchfield quantum finite automaton (MCQFA) is proven to be exponentially more succinct than classical finite automata models in recognizing certain languages such as $\\mathtt{MOD}_p = \\{ a^{j} \\mid j \\equiv 0 \\mod p\\}$, where $p$ is a prime number. In this paper, we present a modified MCQFA algorithm for the language $\\mathtt{MOD}_p$, the operators of which are selected based on the basis gates on the available","authors_text":"Abuzer Yakary{\\i}lmaz, \\\"Ozlem Salehi","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-05T20:41:18Z","title":"Cost-efficient QFA Algorithm for Quantum Computers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.02262","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:21c7fbf19dc39793b4bc9369feff8c510294ec3bff9f8e609217c365024e5009","target":"record","created_at":"2026-07-05T05:24:09Z","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":"8eaf3e1aeb5ff17dfeda8c54a0dc8aa3bb10f9e50f4b2d9ea98b86ba0d9bbaf4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-05T20:41:18Z","title_canon_sha256":"968de2fa0fafc3a1547447606fe40d1f81104046e3432a4845d79670f5bf5a2b"},"schema_version":"1.0","source":{"id":"2107.02262","kind":"arxiv","version":2}},"canonical_sha256":"a7ed8bda7596bd8aa76f0659bcdfd2373694371db35f467c1e0b6a3019b265df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7ed8bda7596bd8aa76f0659bcdfd2373694371db35f467c1e0b6a3019b265df","first_computed_at":"2026-07-05T05:24:09.260806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:24:09.260806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0d66Cr9ySATa0uFGZvlXXITLRmYLBqJmxFJ2wp23rgVuWpiH/rTLfiqBLOjZ1e4kazGgrx8v44zkN6Z39NrkBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:24:09.261207Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.02262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21c7fbf19dc39793b4bc9369feff8c510294ec3bff9f8e609217c365024e5009","sha256:34e3a143f681b19a93a9a5eb2d394924a2131c05421bc6404f639bc44b37cb9b"],"state_sha256":"b2f3536c2f864777de209498debbde98309c9bc915ac81c717d10d0823eac03d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vm1w9WFi6DmogNMUaxEWE70n/C6TJJ82XkjlzXM7WZ1bFLNrcCBH0joaZcIrrilekWhgYhRTnPXbxBbuexvyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T03:03:48.437213Z","bundle_sha256":"27e814d9c51ab0bb13c03231563aa07e7533971beea4fa180133f0f3551bcdff"}}