{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7BD2RBACBBNEZ3QKPUT52LXBTQ","short_pith_number":"pith:7BD2RBAC","schema_version":"1.0","canonical_sha256":"f847a88402085a4cee0a7d27dd2ee19c3b86149dde24f63ac586c6886fc2966a","source":{"kind":"arxiv","id":"1210.1290","version":2},"attestation_state":"computed","paper":{"title":"Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall, Harumichi Nishimura, Hirotada Kobayashi","submitted_at":"2012-10-04T04:08:24Z","abstract_excerpt":"This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is proved that any problem in QMA has a two-message quantum interactive proof system of perfect completeness with constant soundness error, where the verifier has only to send a constant number of halves of EPR pairs. This in particular implies that the class QMA is necessarily included by the class QIP_1(2) of problems having two-message quantum interactive proofs of perfect completeness, which gives the first nontrivial upper bound for QMA in terms of quantum interactive proofs. It"},"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":"1210.1290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-04T04:08:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"101dd40f0a5d55e0417c9274a1157dae06e49caedc9122ed99a5893c94167d3c","abstract_canon_sha256":"085127f1020403e6b2b3d6a7b474400cb2fb4f5a2abd2dd2bfb575898c3475be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:09.695634Z","signature_b64":"PYErzu407CFdsU/5OOe2cWt9Z8VB80EbBh1YjQoYl6fZMaoKmCT2B5Nig+SMuAa+pgjtwXhP/BsOVH89EN1CBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f847a88402085a4cee0a7d27dd2ee19c3b86149dde24f63ac586c6886fc2966a","last_reissued_at":"2026-05-18T01:14:09.695007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:09.695007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall, Harumichi Nishimura, Hirotada Kobayashi","submitted_at":"2012-10-04T04:08:24Z","abstract_excerpt":"This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is proved that any problem in QMA has a two-message quantum interactive proof system of perfect completeness with constant soundness error, where the verifier has only to send a constant number of halves of EPR pairs. This in particular implies that the class QMA is necessarily included by the class QIP_1(2) of problems having two-message quantum interactive proofs of perfect completeness, which gives the first nontrivial upper bound for QMA in terms of quantum interactive proofs. It"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1290","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.1290","created_at":"2026-05-18T01:14:09.695100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1290v2","created_at":"2026-05-18T01:14:09.695100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1290","created_at":"2026-05-18T01:14:09.695100+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BD2RBACBBNE","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BD2RBACBBNEZ3QK","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BD2RBAC","created_at":"2026-05-18T12:26:56.085431+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/7BD2RBACBBNEZ3QKPUT52LXBTQ","json":"https://pith.science/pith/7BD2RBACBBNEZ3QKPUT52LXBTQ.json","graph_json":"https://pith.science/api/pith-number/7BD2RBACBBNEZ3QKPUT52LXBTQ/graph.json","events_json":"https://pith.science/api/pith-number/7BD2RBACBBNEZ3QKPUT52LXBTQ/events.json","paper":"https://pith.science/paper/7BD2RBAC"},"agent_actions":{"view_html":"https://pith.science/pith/7BD2RBACBBNEZ3QKPUT52LXBTQ","download_json":"https://pith.science/pith/7BD2RBACBBNEZ3QKPUT52LXBTQ.json","view_paper":"https://pith.science/paper/7BD2RBAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1290&json=true","fetch_graph":"https://pith.science/api/pith-number/7BD2RBACBBNEZ3QKPUT52LXBTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7BD2RBACBBNEZ3QKPUT52LXBTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BD2RBACBBNEZ3QKPUT52LXBTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BD2RBACBBNEZ3QKPUT52LXBTQ/action/storage_attestation","attest_author":"https://pith.science/pith/7BD2RBACBBNEZ3QKPUT52LXBTQ/action/author_attestation","sign_citation":"https://pith.science/pith/7BD2RBACBBNEZ3QKPUT52LXBTQ/action/citation_signature","submit_replication":"https://pith.science/pith/7BD2RBACBBNEZ3QKPUT52LXBTQ/action/replication_record"}},"created_at":"2026-05-18T01:14:09.695100+00:00","updated_at":"2026-05-18T01:14:09.695100+00:00"}