{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:K6KBS4KF2AWDUU3YVW56YZC4L4","short_pith_number":"pith:K6KBS4KF","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"},"canonical_sha256":"5794197145d02c3a5378adbbec645c5f0d908b04b2bbd7810402f3dcc038a99d","source":{"kind":"arxiv","id":"1203.5217","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5217","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5217v3","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5217","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"K6KBS4KF2AWD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K6KBS4KF2AWDUU3Y","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K6KBS4KF","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:K6KBS4KF2AWDUU3YVW56YZC4L4","target":"record","payload":{"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"},"canonical_sha256":"5794197145d02c3a5378adbbec645c5f0d908b04b2bbd7810402f3dcc038a99d","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"},"source_kind":"arxiv","source_id":"1203.5217","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6h7lrgmj8brORhwG1NydQsWu5x74XwW+20uuly8L29LvkVX4pH9gtwlkqrcJ3INplG4J1GKPG70SdIq0Ay9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:18:01.922847Z"},"content_sha256":"a8bfb4925ee321888d0b4fe14f0bf85d79a20562014e8c86710c011052e44930","schema_version":"1.0","event_id":"sha256:a8bfb4925ee321888d0b4fe14f0bf85d79a20562014e8c86710c011052e44930"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:K6KBS4KF2AWDUU3YVW56YZC4L4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIODu7NC32MySXJ+viKqisUW9KgliCR/jeny7jgGlo+cvgp8C6XaHN1vunIpoehNJYn+BtnYUPBpuO2reOj+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:18:01.923186Z"},"content_sha256":"a07a18a0814fb8b9bdbf285668fed377772532eed068d4e6496bb037c47cc716","schema_version":"1.0","event_id":"sha256:a07a18a0814fb8b9bdbf285668fed377772532eed068d4e6496bb037c47cc716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/bundle.json","state_url":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T19:18:01Z","links":{"resolver":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4","bundle":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/bundle.json","state":"https://pith.science/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6KBS4KF2AWDUU3YVW56YZC4L4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:K6KBS4KF2AWDUU3YVW56YZC4L4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4ad6e6d4fe3a55f3fb96386b998d884c7dc9644de1f6dd402a50da825db708ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-03-23T11:46:40Z","title_canon_sha256":"6b9d93d4dd110f2b779c16bd52947aff7d20026b3c5d18da79c574e9b79a5f21"},"schema_version":"1.0","source":{"id":"1203.5217","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5217","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5217v3","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5217","created_at":"2026-05-18T00:40:34Z"},{"alias_kind":"pith_short_12","alias_value":"K6KBS4KF2AWD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"K6KBS4KF2AWDUU3Y","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"K6KBS4KF","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:a07a18a0814fb8b9bdbf285668fed377772532eed068d4e6496bb037c47cc716","target":"graph","created_at":"2026-05-18T00:40:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Elham Kashefi, Joseph F. Fitzsimons","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-03-23T11:46:40Z","title":"Unconditionally verifiable blind computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5217","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a8bfb4925ee321888d0b4fe14f0bf85d79a20562014e8c86710c011052e44930","target":"record","created_at":"2026-05-18T00:40:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4ad6e6d4fe3a55f3fb96386b998d884c7dc9644de1f6dd402a50da825db708ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-03-23T11:46:40Z","title_canon_sha256":"6b9d93d4dd110f2b779c16bd52947aff7d20026b3c5d18da79c574e9b79a5f21"},"schema_version":"1.0","source":{"id":"1203.5217","kind":"arxiv","version":3}},"canonical_sha256":"5794197145d02c3a5378adbbec645c5f0d908b04b2bbd7810402f3dcc038a99d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5794197145d02c3a5378adbbec645c5f0d908b04b2bbd7810402f3dcc038a99d","first_computed_at":"2026-05-18T00:40:34.060364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:34.060364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NFcfMulJXKwxiwv9BeET8DtBRKbvXUklviU2F3FJZF1TSdpz/8SI2mvOk8zTk+i60oSpdpRhjQgNLF6Lu60OAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:34.061184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5217","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8bfb4925ee321888d0b4fe14f0bf85d79a20562014e8c86710c011052e44930","sha256:a07a18a0814fb8b9bdbf285668fed377772532eed068d4e6496bb037c47cc716"],"state_sha256":"3ae240a837cf6a9b58ecf171ed1918e0c52453c947c2d7449e372ff5f2805034"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARueZELgu9OBXH4baLqgBDz40cDtuQR0TRcGrvIzivTdLTRaXKfdIaAqhgZgLdxcAsmN8n0G3kRdqq3qcx3UCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:18:01.925087Z","bundle_sha256":"4103d58fe6434576dc08515d481b1cdc2630cac679116b5350c56d87b537f5a8"}}