{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CJJRIPWUR4FEUNMOJLMXOIGMP3","short_pith_number":"pith:CJJRIPWU","schema_version":"1.0","canonical_sha256":"1253143ed48f0a4a358e4ad97720cc7ee1e71f0714d632ed18cd545382782b8a","source":{"kind":"arxiv","id":"1909.01900","version":2},"attestation_state":"computed","paper":{"title":"Efficient Verification of Pure Quantum States in the Adversarial Scenario","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Huangjun Zhu, Masahito Hayashi","submitted_at":"2019-09-04T15:52:58Z","abstract_excerpt":"Efficient verification of pure quantum states in the adversarial scenario is crucial to many applications in quantum information processing, such as blind measurement-based quantum computation and quantum networks. However, little is known about this topic so far. Here we establish a general framework for verifying pure quantum states in the adversarial scenario and clarify the resource cost. Moreover, we propose a simple and general recipe to constructing efficient verification protocols for the adversarial scenario from protocols for the nonadversarial scenario. With this recipe, arbitrary p"},"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":"1909.01900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-04T15:52:58Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"1cece791f01fd8e8072f62a59dc3874472f22a6e2db35b7781821d9582d04246","abstract_canon_sha256":"c9f449fc0e2595be6b2d2da44e8478c42df61b22136edc8718c97d88d0388156"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:37:07.886325Z","signature_b64":"LAEx/63cwSzfJ9zuziNyg8mlTCNb/ONBLzokY3CQ4VgjpCdT1udQnBv8SAbK9ff1249hNGePhotx4ntPvoK/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1253143ed48f0a4a358e4ad97720cc7ee1e71f0714d632ed18cd545382782b8a","last_reissued_at":"2026-07-05T00:37:07.885801Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:37:07.885801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Verification of Pure Quantum States in the Adversarial Scenario","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Huangjun Zhu, Masahito Hayashi","submitted_at":"2019-09-04T15:52:58Z","abstract_excerpt":"Efficient verification of pure quantum states in the adversarial scenario is crucial to many applications in quantum information processing, such as blind measurement-based quantum computation and quantum networks. However, little is known about this topic so far. Here we establish a general framework for verifying pure quantum states in the adversarial scenario and clarify the resource cost. Moreover, we propose a simple and general recipe to constructing efficient verification protocols for the adversarial scenario from protocols for the nonadversarial scenario. With this recipe, arbitrary p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01900","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/1909.01900/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":"1909.01900","created_at":"2026-07-05T00:37:07.885861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01900v2","created_at":"2026-07-05T00:37:07.885861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01900","created_at":"2026-07-05T00:37:07.885861+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJJRIPWUR4FE","created_at":"2026-07-05T00:37:07.885861+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJJRIPWUR4FEUNMO","created_at":"2026-07-05T00:37:07.885861+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJJRIPWU","created_at":"2026-07-05T00:37:07.885861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.16578","citing_title":"Verifying random matrix product states with autoregressive local measurements","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CJJRIPWUR4FEUNMOJLMXOIGMP3","json":"https://pith.science/pith/CJJRIPWUR4FEUNMOJLMXOIGMP3.json","graph_json":"https://pith.science/api/pith-number/CJJRIPWUR4FEUNMOJLMXOIGMP3/graph.json","events_json":"https://pith.science/api/pith-number/CJJRIPWUR4FEUNMOJLMXOIGMP3/events.json","paper":"https://pith.science/paper/CJJRIPWU"},"agent_actions":{"view_html":"https://pith.science/pith/CJJRIPWUR4FEUNMOJLMXOIGMP3","download_json":"https://pith.science/pith/CJJRIPWUR4FEUNMOJLMXOIGMP3.json","view_paper":"https://pith.science/paper/CJJRIPWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01900&json=true","fetch_graph":"https://pith.science/api/pith-number/CJJRIPWUR4FEUNMOJLMXOIGMP3/graph.json","fetch_events":"https://pith.science/api/pith-number/CJJRIPWUR4FEUNMOJLMXOIGMP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJJRIPWUR4FEUNMOJLMXOIGMP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJJRIPWUR4FEUNMOJLMXOIGMP3/action/storage_attestation","attest_author":"https://pith.science/pith/CJJRIPWUR4FEUNMOJLMXOIGMP3/action/author_attestation","sign_citation":"https://pith.science/pith/CJJRIPWUR4FEUNMOJLMXOIGMP3/action/citation_signature","submit_replication":"https://pith.science/pith/CJJRIPWUR4FEUNMOJLMXOIGMP3/action/replication_record"}},"created_at":"2026-07-05T00:37:07.885861+00:00","updated_at":"2026-07-05T00:37:07.885861+00:00"}