{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2Z3S7Z5FAMDOD2BG5PZCNN3I3B","short_pith_number":"pith:2Z3S7Z5F","canonical_record":{"source":{"id":"1803.06624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-18T07:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"7b70182b6186db60cc7fb64174d1008647e7a1590ba486178005f60d4ba6e0e0","abstract_canon_sha256":"d6c14a20cf3d16afb3c16162a392d5cf06f98b22be828912de3c57405135176b"},"schema_version":"1.0"},"canonical_sha256":"d6772fe7a50306e1e826ebf226b768d860c0b7e2c75034d3ee929b1b326bd6e1","source":{"kind":"arxiv","id":"1803.06624","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06624","created_at":"2026-05-18T00:20:34Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06624v1","created_at":"2026-05-18T00:20:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06624","created_at":"2026-05-18T00:20:34Z"},{"alias_kind":"pith_short_12","alias_value":"2Z3S7Z5FAMDO","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2Z3S7Z5FAMDOD2BG","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2Z3S7Z5F","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2Z3S7Z5FAMDOD2BG5PZCNN3I3B","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-18T07:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"7b70182b6186db60cc7fb64174d1008647e7a1590ba486178005f60d4ba6e0e0","abstract_canon_sha256":"d6c14a20cf3d16afb3c16162a392d5cf06f98b22be828912de3c57405135176b"},"schema_version":"1.0"},"canonical_sha256":"d6772fe7a50306e1e826ebf226b768d860c0b7e2c75034d3ee929b1b326bd6e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:34.349962Z","signature_b64":"+N0POovYnBIrmcqLdFDqjeD/q9hkc+MMiGO1M4/mLf20gf0h5X+xC91mqONlLrXvzAeZ2pT+rcoI8k1QB4j8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6772fe7a50306e1e826ebf226b768d860c0b7e2c75034d3ee929b1b326bd6e1","last_reissued_at":"2026-05-18T00:20:34.349352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:34.349352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06624","source_version":1,"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:20:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tfBAP5voFmilHwD5efynj4iWLa3IV4p6O07z/sX4uduFe8RDbyB0Sjpu5x/bN5A37c74mFuz2TN0yyEVUNWuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:55:06.895264Z"},"content_sha256":"0f17a41729b9d98e389467ae8b10515346521e8db58049d4899c2a07ef41a6f5","schema_version":"1.0","event_id":"sha256:0f17a41729b9d98e389467ae8b10515346521e8db58049d4899c2a07ef41a6f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2Z3S7Z5FAMDOD2BG5PZCNN3I3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blind quantum computing can always be made verifiable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Tomoyuki Morimae","submitted_at":"2018-03-18T07:58:46Z","abstract_excerpt":"Blind quantum computing enables a client, who does not have enough quantum technologies, to delegate her quantum computing to a remote quantum server in such a way that her privacy is protected against the server. Some blind quantum computing protocols can be made verifiable, which means that the client can check the correctness of server's quantum computing. Can any blind protocol always be made verifiable? In this paper, we answer to the open problem affirmatively. We propose a plug-in that makes any universal blind quantum computing protocol automatically verifiable. The idea is that the cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06624","kind":"arxiv","version":1},"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:20:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SzXvfRvW7wq3E9k0miFR+au76CY2IGEs8eAHgN3iUtLi4YDrxnlVHNdgC5KDbPOupdhR+Gw+WepWtJVBjo3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:55:06.895870Z"},"content_sha256":"02415636508f6698a893c2d38b30a265ee23a793d396d644a833844cb5af57a2","schema_version":"1.0","event_id":"sha256:02415636508f6698a893c2d38b30a265ee23a793d396d644a833844cb5af57a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Z3S7Z5FAMDOD2BG5PZCNN3I3B/bundle.json","state_url":"https://pith.science/pith/2Z3S7Z5FAMDOD2BG5PZCNN3I3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Z3S7Z5FAMDOD2BG5PZCNN3I3B/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-28T01:55:06Z","links":{"resolver":"https://pith.science/pith/2Z3S7Z5FAMDOD2BG5PZCNN3I3B","bundle":"https://pith.science/pith/2Z3S7Z5FAMDOD2BG5PZCNN3I3B/bundle.json","state":"https://pith.science/pith/2Z3S7Z5FAMDOD2BG5PZCNN3I3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Z3S7Z5FAMDOD2BG5PZCNN3I3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2Z3S7Z5FAMDOD2BG5PZCNN3I3B","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":"d6c14a20cf3d16afb3c16162a392d5cf06f98b22be828912de3c57405135176b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-18T07:58:46Z","title_canon_sha256":"7b70182b6186db60cc7fb64174d1008647e7a1590ba486178005f60d4ba6e0e0"},"schema_version":"1.0","source":{"id":"1803.06624","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06624","created_at":"2026-05-18T00:20:34Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06624v1","created_at":"2026-05-18T00:20:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06624","created_at":"2026-05-18T00:20:34Z"},{"alias_kind":"pith_short_12","alias_value":"2Z3S7Z5FAMDO","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2Z3S7Z5FAMDOD2BG","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2Z3S7Z5F","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:02415636508f6698a893c2d38b30a265ee23a793d396d644a833844cb5af57a2","target":"graph","created_at":"2026-05-18T00:20: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 enables a client, who does not have enough quantum technologies, to delegate her quantum computing to a remote quantum server in such a way that her privacy is protected against the server. Some blind quantum computing protocols can be made verifiable, which means that the client can check the correctness of server's quantum computing. Can any blind protocol always be made verifiable? In this paper, we answer to the open problem affirmatively. We propose a plug-in that makes any universal blind quantum computing protocol automatically verifiable. The idea is that the cl","authors_text":"Tomoyuki Morimae","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-18T07:58:46Z","title":"Blind quantum computing can always be made verifiable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06624","kind":"arxiv","version":1},"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:0f17a41729b9d98e389467ae8b10515346521e8db58049d4899c2a07ef41a6f5","target":"record","created_at":"2026-05-18T00:20: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":"d6c14a20cf3d16afb3c16162a392d5cf06f98b22be828912de3c57405135176b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-18T07:58:46Z","title_canon_sha256":"7b70182b6186db60cc7fb64174d1008647e7a1590ba486178005f60d4ba6e0e0"},"schema_version":"1.0","source":{"id":"1803.06624","kind":"arxiv","version":1}},"canonical_sha256":"d6772fe7a50306e1e826ebf226b768d860c0b7e2c75034d3ee929b1b326bd6e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6772fe7a50306e1e826ebf226b768d860c0b7e2c75034d3ee929b1b326bd6e1","first_computed_at":"2026-05-18T00:20:34.349352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:34.349352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+N0POovYnBIrmcqLdFDqjeD/q9hkc+MMiGO1M4/mLf20gf0h5X+xC91mqONlLrXvzAeZ2pT+rcoI8k1QB4j8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:34.349962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06624","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f17a41729b9d98e389467ae8b10515346521e8db58049d4899c2a07ef41a6f5","sha256:02415636508f6698a893c2d38b30a265ee23a793d396d644a833844cb5af57a2"],"state_sha256":"21e03b040968cbcabdcbce837ac7b1bfb80db055f9f49d7d8d98f4e03a319ac7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vsbPDSzOHRIvQUxgDENCZkSDHbN7UhXWJnjL8tWO2PxPq/jO3SoQEECvUSGDBDu7C+O51N+lo1psCNZ1j4IAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:55:06.898556Z","bundle_sha256":"29e120a66c311bc0193850f98b620f5dfd29074aa8e5ea2a73be8966cf1d4034"}}