{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BDAXFTKVEI6BBAUUUICBV3SBZN","short_pith_number":"pith:BDAXFTKV","canonical_record":{"source":{"id":"1508.07778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-31T12:16:51Z","cross_cats_sorted":[],"title_canon_sha256":"98ab612f476ef9f80366c6014c4afeef8bcb6d6190806325427f6e648d750c35","abstract_canon_sha256":"87b18229ef847ca038b5f19e3ab8a60cd2a8b8f353521b39260b6f6d709ebb40"},"schema_version":"1.0"},"canonical_sha256":"08c172cd55223c108294a2041aee41cb56c67a1fa1ed356ea65bd7538ac47f3c","source":{"kind":"arxiv","id":"1508.07778","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07778","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07778v2","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07778","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"BDAXFTKVEI6B","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BDAXFTKVEI6BBAUU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BDAXFTKV","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BDAXFTKVEI6BBAUUUICBV3SBZN","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-31T12:16:51Z","cross_cats_sorted":[],"title_canon_sha256":"98ab612f476ef9f80366c6014c4afeef8bcb6d6190806325427f6e648d750c35","abstract_canon_sha256":"87b18229ef847ca038b5f19e3ab8a60cd2a8b8f353521b39260b6f6d709ebb40"},"schema_version":"1.0"},"canonical_sha256":"08c172cd55223c108294a2041aee41cb56c67a1fa1ed356ea65bd7538ac47f3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:13.383125Z","signature_b64":"PvSrWjWB29S1LKDQbhBmHOTf3vbXJiRXxpwaM9EgARTaeyFXGYYNkLvPkRhFvZ4/UMW8HKq+W51BwKO/8ho7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08c172cd55223c108294a2041aee41cb56c67a1fa1ed356ea65bd7538ac47f3c","last_reissued_at":"2026-05-18T01:31:13.382363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:13.382363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07778","source_version":2,"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-18T01:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6H/lMAfweCYLdAdauk+UcTtt45ncVVuvGHPzYWP5eg4W12K5vDAaa/kgRH9Mg/Qbdjugwc4MEFRVEGRDnAGtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:14:00.862170Z"},"content_sha256":"70b709a1c2114abfad594ab7ceea6cb493b53eb161cdaff5cac1f05e3e2133ee","schema_version":"1.0","event_id":"sha256:70b709a1c2114abfad594ab7ceea6cb493b53eb161cdaff5cac1f05e3e2133ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BDAXFTKVEI6BBAUUUICBV3SBZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blind quantum computation with completely classical client and a trusted center","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Min Liang","submitted_at":"2015-08-31T12:16:51Z","abstract_excerpt":"Blind quantum computation (BQC) enables a client without enough quantum power to delegate his quantum computation to a quantum server, while keeping the input data, the algorithm and the result unknown to the server. In the studies of practical BQC protocol, an important problem is how to reduce the quantum requirement of the client. Multi-server BQC protocols have been proposed to solve this problem. We review the double-server and triple-server protocols [Li et al., Phys. Rev. A 89, 040302(R) (2014)], and propose a modified double-server BQC protocol with a trusted center. In our protocol, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07778","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"},"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-18T01:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6WiojwPZ/2q2VKJb0cLedEmVad0Nxv3Aa4J293VZitQPzr3uAA5XQhPLxO05dsJ9fq6DJxVlj5i86+FEFXmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:14:00.862748Z"},"content_sha256":"2bd22d75bd1ae4ec0babf4e973c13478b95040485d864d0b79559dc1460eec55","schema_version":"1.0","event_id":"sha256:2bd22d75bd1ae4ec0babf4e973c13478b95040485d864d0b79559dc1460eec55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDAXFTKVEI6BBAUUUICBV3SBZN/bundle.json","state_url":"https://pith.science/pith/BDAXFTKVEI6BBAUUUICBV3SBZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDAXFTKVEI6BBAUUUICBV3SBZN/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-05-27T14:14:00Z","links":{"resolver":"https://pith.science/pith/BDAXFTKVEI6BBAUUUICBV3SBZN","bundle":"https://pith.science/pith/BDAXFTKVEI6BBAUUUICBV3SBZN/bundle.json","state":"https://pith.science/pith/BDAXFTKVEI6BBAUUUICBV3SBZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDAXFTKVEI6BBAUUUICBV3SBZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BDAXFTKVEI6BBAUUUICBV3SBZN","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":"87b18229ef847ca038b5f19e3ab8a60cd2a8b8f353521b39260b6f6d709ebb40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-31T12:16:51Z","title_canon_sha256":"98ab612f476ef9f80366c6014c4afeef8bcb6d6190806325427f6e648d750c35"},"schema_version":"1.0","source":{"id":"1508.07778","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07778","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07778v2","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07778","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"BDAXFTKVEI6B","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BDAXFTKVEI6BBAUU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BDAXFTKV","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:2bd22d75bd1ae4ec0babf4e973c13478b95040485d864d0b79559dc1460eec55","target":"graph","created_at":"2026-05-18T01:31:13Z","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 computation (BQC) enables a client without enough quantum power to delegate his quantum computation to a quantum server, while keeping the input data, the algorithm and the result unknown to the server. In the studies of practical BQC protocol, an important problem is how to reduce the quantum requirement of the client. Multi-server BQC protocols have been proposed to solve this problem. We review the double-server and triple-server protocols [Li et al., Phys. Rev. A 89, 040302(R) (2014)], and propose a modified double-server BQC protocol with a trusted center. In our protocol, t","authors_text":"Min Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-31T12:16:51Z","title":"Blind quantum computation with completely classical client and a trusted center"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07778","kind":"arxiv","version":2},"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:70b709a1c2114abfad594ab7ceea6cb493b53eb161cdaff5cac1f05e3e2133ee","target":"record","created_at":"2026-05-18T01:31:13Z","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":"87b18229ef847ca038b5f19e3ab8a60cd2a8b8f353521b39260b6f6d709ebb40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-31T12:16:51Z","title_canon_sha256":"98ab612f476ef9f80366c6014c4afeef8bcb6d6190806325427f6e648d750c35"},"schema_version":"1.0","source":{"id":"1508.07778","kind":"arxiv","version":2}},"canonical_sha256":"08c172cd55223c108294a2041aee41cb56c67a1fa1ed356ea65bd7538ac47f3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08c172cd55223c108294a2041aee41cb56c67a1fa1ed356ea65bd7538ac47f3c","first_computed_at":"2026-05-18T01:31:13.382363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:13.382363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PvSrWjWB29S1LKDQbhBmHOTf3vbXJiRXxpwaM9EgARTaeyFXGYYNkLvPkRhFvZ4/UMW8HKq+W51BwKO/8ho7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:13.383125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07778","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70b709a1c2114abfad594ab7ceea6cb493b53eb161cdaff5cac1f05e3e2133ee","sha256:2bd22d75bd1ae4ec0babf4e973c13478b95040485d864d0b79559dc1460eec55"],"state_sha256":"4b4d4ddf977106626363a61a18a8624c47a629d666d68e5c2f633c695164addb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTeoQZkCzX4J0fggPuYwNdkiekNRV5Mnf7PEPg6l3xDwh/S9v5Ei/uBO+V4Q9aYFv74ZNkYB9Hfg4BvnGX97Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:14:00.865233Z","bundle_sha256":"8370507436f2ef2475d31834cfb20f54cae28d04bf34c36a56d376515d8befed"}}