{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:U7WYXWTVS26YVJ3PAZM3ZX6SG4","short_pith_number":"pith:U7WYXWTV","schema_version":"1.0","canonical_sha256":"a7ed8bda7596bd8aa76f0659bcdfd2373694371db35f467c1e0b6a3019b265df","source":{"kind":"arxiv","id":"2107.02262","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2107.02262","created_at":"2026-07-05T05:24:09.260868+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.02262v2","created_at":"2026-07-05T05:24:09.260868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.02262","created_at":"2026-07-05T05:24:09.260868+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7WYXWTVS26Y","created_at":"2026-07-05T05:24:09.260868+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7WYXWTVS26YVJ3P","created_at":"2026-07-05T05:24:09.260868+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7WYXWTV","created_at":"2026-07-05T05:24:09.260868+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.18823","citing_title":"Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4","json":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4.json","graph_json":"https://pith.science/api/pith-number/U7WYXWTVS26YVJ3PAZM3ZX6SG4/graph.json","events_json":"https://pith.science/api/pith-number/U7WYXWTVS26YVJ3PAZM3ZX6SG4/events.json","paper":"https://pith.science/paper/U7WYXWTV"},"agent_actions":{"view_html":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4","download_json":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4.json","view_paper":"https://pith.science/paper/U7WYXWTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.02262&json=true","fetch_graph":"https://pith.science/api/pith-number/U7WYXWTVS26YVJ3PAZM3ZX6SG4/graph.json","fetch_events":"https://pith.science/api/pith-number/U7WYXWTVS26YVJ3PAZM3ZX6SG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/action/storage_attestation","attest_author":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/action/author_attestation","sign_citation":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/action/citation_signature","submit_replication":"https://pith.science/pith/U7WYXWTVS26YVJ3PAZM3ZX6SG4/action/replication_record"}},"created_at":"2026-07-05T05:24:09.260868+00:00","updated_at":"2026-07-05T05:24:09.260868+00:00"}