{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L3CS6ICTQC5YGNRCREXKFXEDZG","short_pith_number":"pith:L3CS6ICT","canonical_record":{"source":{"id":"1804.06105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-17T08:25:59Z","cross_cats_sorted":[],"title_canon_sha256":"e0f2944d341586eb942d11cfc387f4191642593cf2272075e20ff54b7726420f","abstract_canon_sha256":"7b74b698332a020ec250038159588a2718ea2c6222bfc8eeb1d4c8745ef37805"},"schema_version":"1.0"},"canonical_sha256":"5ec52f205380bb833622892ea2dc83c987c75d2713a74aa9de28d5f0c2610605","source":{"kind":"arxiv","id":"1804.06105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06105","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06105v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06105","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"L3CS6ICTQC5Y","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L3CS6ICTQC5YGNRC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L3CS6ICT","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L3CS6ICTQC5YGNRCREXKFXEDZG","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-17T08:25:59Z","cross_cats_sorted":[],"title_canon_sha256":"e0f2944d341586eb942d11cfc387f4191642593cf2272075e20ff54b7726420f","abstract_canon_sha256":"7b74b698332a020ec250038159588a2718ea2c6222bfc8eeb1d4c8745ef37805"},"schema_version":"1.0"},"canonical_sha256":"5ec52f205380bb833622892ea2dc83c987c75d2713a74aa9de28d5f0c2610605","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.708607Z","signature_b64":"VBdyogA/DyUAiLPEYDmrz2guPpGxx8hZDvQadkFCp9d8iGDWbtohU/o3meokH3ujRpsd+PxPd+xl4Vb8NC5jAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ec52f205380bb833622892ea2dc83c987c75d2713a74aa9de28d5f0c2610605","last_reissued_at":"2026-05-18T00:18:21.707886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.707886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06105","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:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiSVsQ/5PWuaukk6ZPx0Wy9ZPWVyhbaxfB9oC1XgiIQE1LtWNEawRR8LDZKZZlP562rtBeeDJUvhhwI7r70OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:51:15.667867Z"},"content_sha256":"bc55fdeb6806acac3916bdc718795e9815f563c4e919f939799f396b5cfaa2ce","schema_version":"1.0","event_id":"sha256:bc55fdeb6806acac3916bdc718795e9815f563c4e919f939799f396b5cfaa2ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L3CS6ICTQC5YGNRCREXKFXEDZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple protocol for fault tolerant verification of quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexandru Gheorghiu, Elham Kashefi, Matty J. Hoban","submitted_at":"2018-04-17T08:25:59Z","abstract_excerpt":"With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation within the framework of interactive proofs has been fruitful for addressing this problem. Specifically, an untrusted agent (prover) alleging to perform quantum computations can have his claims verified by another agent (verifier) who only has access to classical computation and a small quantum device for preparing or measuring single qubits. However, when t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06105","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:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XxpPJSo2f0W7LscsgiDIzvUEC1DVsO5y68jcocjXVCBS+m8e3HCJHyumN7W4gVMzxOF86PGc5Fx0WjhNogk8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:51:15.668214Z"},"content_sha256":"71aa5a00954eff9b8b625eb8ce4333ee0cc901719c83923546ed1e9d254820b4","schema_version":"1.0","event_id":"sha256:71aa5a00954eff9b8b625eb8ce4333ee0cc901719c83923546ed1e9d254820b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3CS6ICTQC5YGNRCREXKFXEDZG/bundle.json","state_url":"https://pith.science/pith/L3CS6ICTQC5YGNRCREXKFXEDZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3CS6ICTQC5YGNRCREXKFXEDZG/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-20T09:51:15Z","links":{"resolver":"https://pith.science/pith/L3CS6ICTQC5YGNRCREXKFXEDZG","bundle":"https://pith.science/pith/L3CS6ICTQC5YGNRCREXKFXEDZG/bundle.json","state":"https://pith.science/pith/L3CS6ICTQC5YGNRCREXKFXEDZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3CS6ICTQC5YGNRCREXKFXEDZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L3CS6ICTQC5YGNRCREXKFXEDZG","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":"7b74b698332a020ec250038159588a2718ea2c6222bfc8eeb1d4c8745ef37805","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-17T08:25:59Z","title_canon_sha256":"e0f2944d341586eb942d11cfc387f4191642593cf2272075e20ff54b7726420f"},"schema_version":"1.0","source":{"id":"1804.06105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06105","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06105v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06105","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"L3CS6ICTQC5Y","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L3CS6ICTQC5YGNRC","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L3CS6ICT","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:71aa5a00954eff9b8b625eb8ce4333ee0cc901719c83923546ed1e9d254820b4","target":"graph","created_at":"2026-05-18T00:18:21Z","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":"With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation within the framework of interactive proofs has been fruitful for addressing this problem. Specifically, an untrusted agent (prover) alleging to perform quantum computations can have his claims verified by another agent (verifier) who only has access to classical computation and a small quantum device for preparing or measuring single qubits. However, when t","authors_text":"Alexandru Gheorghiu, Elham Kashefi, Matty J. Hoban","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-17T08:25:59Z","title":"A simple protocol for fault tolerant verification of quantum computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06105","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:bc55fdeb6806acac3916bdc718795e9815f563c4e919f939799f396b5cfaa2ce","target":"record","created_at":"2026-05-18T00:18:21Z","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":"7b74b698332a020ec250038159588a2718ea2c6222bfc8eeb1d4c8745ef37805","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-17T08:25:59Z","title_canon_sha256":"e0f2944d341586eb942d11cfc387f4191642593cf2272075e20ff54b7726420f"},"schema_version":"1.0","source":{"id":"1804.06105","kind":"arxiv","version":1}},"canonical_sha256":"5ec52f205380bb833622892ea2dc83c987c75d2713a74aa9de28d5f0c2610605","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ec52f205380bb833622892ea2dc83c987c75d2713a74aa9de28d5f0c2610605","first_computed_at":"2026-05-18T00:18:21.707886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:21.707886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VBdyogA/DyUAiLPEYDmrz2guPpGxx8hZDvQadkFCp9d8iGDWbtohU/o3meokH3ujRpsd+PxPd+xl4Vb8NC5jAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:21.708607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc55fdeb6806acac3916bdc718795e9815f563c4e919f939799f396b5cfaa2ce","sha256:71aa5a00954eff9b8b625eb8ce4333ee0cc901719c83923546ed1e9d254820b4"],"state_sha256":"47fc370f8315d353943aba49324fe4710b43efc6b9ae5b078adaa871806cf4ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkP+6cTuAoUhS1jx/pedIEKRKVy577G/2jiFfJjktveWxSUl6CFqfjzx/v5Szb26atLge2UnoEwvHEtL0NlCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:51:15.670095Z","bundle_sha256":"ee121b89d2c484ea0fb464f97c807bd772408ed80f2831d9b63e22af28654f98"}}