{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WANRCVWGZWHFUCITGYJOR25DPI","short_pith_number":"pith:WANRCVWG","schema_version":"1.0","canonical_sha256":"b01b1156c6cd8e5a09133612e8eba37a112c49a1a1dcb3c670dad14265fa9bdd","source":{"kind":"arxiv","id":"1304.3876","version":3},"attestation_state":"computed","paper":{"title":"Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","quant-ph"],"primary_cat":"cs.CC","authors_text":"Daowen Qiu, Jozef Gruska, Shenggen Zheng","submitted_at":"2013-04-14T04:59:44Z","abstract_excerpt":"In this paper we explore the power of AM for the case that verifiers are {\\em two-way finite automata with quantum and classical states} (2QCFA)--introduced by Ambainis and Watrous in 2002--and the communications are classical. It is of interest to consider AM with such \"semi-quantum\" verifiers because they use only limited quantum resources. Our main result is that such Quantum Arthur-Merlin proof systems (QAM(2QCFA)) with polynomial expected running time are more powerful than in the case verifiers are two-way probabilistic finite automata (AM(2PFA)) with polynomial expected running time. Mo"},"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":"1304.3876","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-14T04:59:44Z","cross_cats_sorted":["cs.CR","quant-ph"],"title_canon_sha256":"9ee89b8455ade27a4cb3272cd59923ae25b3ac2f53ed712f20eedd9d9363cc38","abstract_canon_sha256":"f512c85cb114645feee6c9660c4446710c13c86dafac649877013233553cfa66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:12.572822Z","signature_b64":"JqHkKFSftZ9krXPcvYL2j3XJp+XXjw9wRfSqNSjYWVCNHVVBgJKvJbkTMSJD2PcDXfsrsgBbf45lh1OzY0n6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b01b1156c6cd8e5a09133612e8eba37a112c49a1a1dcb3c670dad14265fa9bdd","last_reissued_at":"2026-05-18T02:17:12.572060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:12.572060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","quant-ph"],"primary_cat":"cs.CC","authors_text":"Daowen Qiu, Jozef Gruska, Shenggen Zheng","submitted_at":"2013-04-14T04:59:44Z","abstract_excerpt":"In this paper we explore the power of AM for the case that verifiers are {\\em two-way finite automata with quantum and classical states} (2QCFA)--introduced by Ambainis and Watrous in 2002--and the communications are classical. It is of interest to consider AM with such \"semi-quantum\" verifiers because they use only limited quantum resources. Our main result is that such Quantum Arthur-Merlin proof systems (QAM(2QCFA)) with polynomial expected running time are more powerful than in the case verifiers are two-way probabilistic finite automata (AM(2PFA)) with polynomial expected running time. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3876","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.3876","created_at":"2026-05-18T02:17:12.572187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3876v3","created_at":"2026-05-18T02:17:12.572187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3876","created_at":"2026-05-18T02:17:12.572187+00:00"},{"alias_kind":"pith_short_12","alias_value":"WANRCVWGZWHF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WANRCVWGZWHFUCIT","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WANRCVWG","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WANRCVWGZWHFUCITGYJOR25DPI","json":"https://pith.science/pith/WANRCVWGZWHFUCITGYJOR25DPI.json","graph_json":"https://pith.science/api/pith-number/WANRCVWGZWHFUCITGYJOR25DPI/graph.json","events_json":"https://pith.science/api/pith-number/WANRCVWGZWHFUCITGYJOR25DPI/events.json","paper":"https://pith.science/paper/WANRCVWG"},"agent_actions":{"view_html":"https://pith.science/pith/WANRCVWGZWHFUCITGYJOR25DPI","download_json":"https://pith.science/pith/WANRCVWGZWHFUCITGYJOR25DPI.json","view_paper":"https://pith.science/paper/WANRCVWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3876&json=true","fetch_graph":"https://pith.science/api/pith-number/WANRCVWGZWHFUCITGYJOR25DPI/graph.json","fetch_events":"https://pith.science/api/pith-number/WANRCVWGZWHFUCITGYJOR25DPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WANRCVWGZWHFUCITGYJOR25DPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WANRCVWGZWHFUCITGYJOR25DPI/action/storage_attestation","attest_author":"https://pith.science/pith/WANRCVWGZWHFUCITGYJOR25DPI/action/author_attestation","sign_citation":"https://pith.science/pith/WANRCVWGZWHFUCITGYJOR25DPI/action/citation_signature","submit_replication":"https://pith.science/pith/WANRCVWGZWHFUCITGYJOR25DPI/action/replication_record"}},"created_at":"2026-05-18T02:17:12.572187+00:00","updated_at":"2026-05-18T02:17:12.572187+00:00"}