{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:K6KBS4KF2AWDUU3YVW56YZC4L4","short_pith_number":"pith:K6KBS4KF","schema_version":"1.0","canonical_sha256":"5794197145d02c3a5378adbbec645c5f0d908b04b2bbd7810402f3dcc038a99d","source":{"kind":"arxiv","id":"1203.5217","version":3},"attestation_state":"computed","paper":{"title":"Unconditionally verifiable blind computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elham Kashefi, Joseph F. Fitzsimons","submitted_at":"2012-03-23T11:46:40Z","abstract_excerpt":"Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can verify with high probability whether the server has followed the instructions of the protocol, or if there has been some deviation resulting in a corrupted output state. A verifiable BQC protocol can be viewed as an interactive proof system leading to consequences for complexity theory. The authors, together with Broadbent, previously proposed"},"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":"1203.5217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-03-23T11:46:40Z","cross_cats_sorted":[],"title_canon_sha256":"6b9d93d4dd110f2b779c16bd52947aff7d20026b3c5d18da79c574e9b79a5f21","abstract_canon_sha256":"4ad6e6d4fe3a55f3fb96386b998d884c7dc9644de1f6dd402a50da825db708ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:34.061184Z","signature_b64":"NFcfMulJXKwxiwv9BeET8DtBRKbvXUklviU2F3FJZF1TSdpz/8SI2mvOk8zTk+i60oSpdpRhjQgNLF6Lu60OAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5794197145d02c3a5378adbbec645c5f0d908b04b2bbd7810402f3dcc038a99d","last_reissued_at":"2026-05-18T00:40:34.060364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:34.060364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unconditionally verifiable blind computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elham Kashefi, Joseph F. Fitzsimons","submitted_at":"2012-03-23T11:46:40Z","abstract_excerpt":"Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can verify with high probability whether the server has followed the instructions of the protocol, or if there has been some deviation resulting in a corrupted output state. A verifiable BQC protocol can be viewed as an interactive proof system leading to consequences for complexity theory. The authors, together with Broadbent, previously proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5217","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":"1203.5217","created_at":"2026-05-18T00:40:34.060507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.5217v3","created_at":"2026-05-18T00:40:34.060507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5217","created_at":"2026-05-18T00:40:34.060507+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6KBS4KF2AWD","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6KBS4KF2AWDUU3Y","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6KBS4KF","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.30636","citing_title":"Authentication in Quantum Networks","ref_index":191,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29962","citing_title":"BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":83,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4","json":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4.json","graph_json":"https://pith.science/api/pith-number/K6KBS4KF2AWDUU3YVW56YZC4L4/graph.json","events_json":"https://pith.science/api/pith-number/K6KBS4KF2AWDUU3YVW56YZC4L4/events.json","paper":"https://pith.science/paper/K6KBS4KF"},"agent_actions":{"view_html":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4","download_json":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4.json","view_paper":"https://pith.science/paper/K6KBS4KF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.5217&json=true","fetch_graph":"https://pith.science/api/pith-number/K6KBS4KF2AWDUU3YVW56YZC4L4/graph.json","fetch_events":"https://pith.science/api/pith-number/K6KBS4KF2AWDUU3YVW56YZC4L4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/action/storage_attestation","attest_author":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/action/author_attestation","sign_citation":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/action/citation_signature","submit_replication":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/action/replication_record"}},"created_at":"2026-05-18T00:40:34.060507+00:00","updated_at":"2026-05-18T00:40:34.060507+00:00"}