{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:COTA4JRJWARGNFUWGEK3PFBVYE","short_pith_number":"pith:COTA4JRJ","canonical_record":{"source":{"id":"1510.07408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-26T09:05:54Z","cross_cats_sorted":[],"title_canon_sha256":"89c98ce486443b51d076c4395a65ee6894beccc43cd09a862b632d14e4b83313","abstract_canon_sha256":"de16989387fbb74bf6a859e08092021453853bda9e04e0e036f172131ef802d8"},"schema_version":"1.0"},"canonical_sha256":"13a60e2629b0226696963115b79435c137d895e8221f1ca816646d1bb278fcde","source":{"kind":"arxiv","id":"1510.07408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07408","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07408v1","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07408","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"COTA4JRJWARG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"COTA4JRJWARGNFUW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"COTA4JRJ","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:COTA4JRJWARGNFUWGEK3PFBVYE","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-26T09:05:54Z","cross_cats_sorted":[],"title_canon_sha256":"89c98ce486443b51d076c4395a65ee6894beccc43cd09a862b632d14e4b83313","abstract_canon_sha256":"de16989387fbb74bf6a859e08092021453853bda9e04e0e036f172131ef802d8"},"schema_version":"1.0"},"canonical_sha256":"13a60e2629b0226696963115b79435c137d895e8221f1ca816646d1bb278fcde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:08.619051Z","signature_b64":"5cfNcr0/BjK6I/E/gDW7QkIP49iBpooVmIxw9Tn5tWdGzeUj2wMZlDursgZ3ZuEfdd/HO2nZtZ2X8IyQCAfXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13a60e2629b0226696963115b79435c137d895e8221f1ca816646d1bb278fcde","last_reissued_at":"2026-05-18T00:49:08.618613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:08.618613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07408","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:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tP69Oa7hSLzpPeTHQ6v8BAfRRREHvxwHN8kvbaqrhHNgz3cQ4GZY5EiepPzgf1v5sr0Xq3o6W+mSdTAyCOb6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:03:07.666774Z"},"content_sha256":"f2e075f3310900dcf8931bc19c68789a7f667947d7d632348c333755545d031f","schema_version":"1.0","event_id":"sha256:f2e075f3310900dcf8931bc19c68789a7f667947d7d632348c333755545d031f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:COTA4JRJWARGNFUWGEK3PFBVYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimised resource construction for verifiable quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elham Kashefi, Petros Wallden","submitted_at":"2015-10-26T09:05:54Z","abstract_excerpt":"Recent developments make the possibility of achieving scalable quantum networks and quantum devices closer. From the computational point of view these emerging technologies become relevant when they are no longer classically simulatable. Hence a pressing challenge is the construction of practical methods to verify the correctness of the outcome produced by universal or non-universal quantum devices. A promising approach that has been extensively explored is the scheme of verification via encryption through blind quantum computing initiated by Fitzsimons and Kashefi. We present here a new const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07408","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:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+seSJpL7GwHmS+bGFawPHNYUhsl6Lfb/1whjjo1KmGAGFMEph6pURbpgeP8IAaCoeeCxE5h3zvDgEQZPy+YBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:03:07.667113Z"},"content_sha256":"4018897814cbc2c180c27b0236b32842f6088d306cdc241b4ebc48e8fe54f88b","schema_version":"1.0","event_id":"sha256:4018897814cbc2c180c27b0236b32842f6088d306cdc241b4ebc48e8fe54f88b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COTA4JRJWARGNFUWGEK3PFBVYE/bundle.json","state_url":"https://pith.science/pith/COTA4JRJWARGNFUWGEK3PFBVYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COTA4JRJWARGNFUWGEK3PFBVYE/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-09T01:03:07Z","links":{"resolver":"https://pith.science/pith/COTA4JRJWARGNFUWGEK3PFBVYE","bundle":"https://pith.science/pith/COTA4JRJWARGNFUWGEK3PFBVYE/bundle.json","state":"https://pith.science/pith/COTA4JRJWARGNFUWGEK3PFBVYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COTA4JRJWARGNFUWGEK3PFBVYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:COTA4JRJWARGNFUWGEK3PFBVYE","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":"de16989387fbb74bf6a859e08092021453853bda9e04e0e036f172131ef802d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-26T09:05:54Z","title_canon_sha256":"89c98ce486443b51d076c4395a65ee6894beccc43cd09a862b632d14e4b83313"},"schema_version":"1.0","source":{"id":"1510.07408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07408","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07408v1","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07408","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"COTA4JRJWARG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"COTA4JRJWARGNFUW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"COTA4JRJ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:4018897814cbc2c180c27b0236b32842f6088d306cdc241b4ebc48e8fe54f88b","target":"graph","created_at":"2026-05-18T00:49:08Z","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":"Recent developments make the possibility of achieving scalable quantum networks and quantum devices closer. From the computational point of view these emerging technologies become relevant when they are no longer classically simulatable. Hence a pressing challenge is the construction of practical methods to verify the correctness of the outcome produced by universal or non-universal quantum devices. A promising approach that has been extensively explored is the scheme of verification via encryption through blind quantum computing initiated by Fitzsimons and Kashefi. We present here a new const","authors_text":"Elham Kashefi, Petros Wallden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-26T09:05:54Z","title":"Optimised resource construction for verifiable quantum computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07408","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:f2e075f3310900dcf8931bc19c68789a7f667947d7d632348c333755545d031f","target":"record","created_at":"2026-05-18T00:49:08Z","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":"de16989387fbb74bf6a859e08092021453853bda9e04e0e036f172131ef802d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-10-26T09:05:54Z","title_canon_sha256":"89c98ce486443b51d076c4395a65ee6894beccc43cd09a862b632d14e4b83313"},"schema_version":"1.0","source":{"id":"1510.07408","kind":"arxiv","version":1}},"canonical_sha256":"13a60e2629b0226696963115b79435c137d895e8221f1ca816646d1bb278fcde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13a60e2629b0226696963115b79435c137d895e8221f1ca816646d1bb278fcde","first_computed_at":"2026-05-18T00:49:08.618613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:08.618613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5cfNcr0/BjK6I/E/gDW7QkIP49iBpooVmIxw9Tn5tWdGzeUj2wMZlDursgZ3ZuEfdd/HO2nZtZ2X8IyQCAfXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:08.619051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2e075f3310900dcf8931bc19c68789a7f667947d7d632348c333755545d031f","sha256:4018897814cbc2c180c27b0236b32842f6088d306cdc241b4ebc48e8fe54f88b"],"state_sha256":"964ee61ff3196c97a37f449d386c26834588dbcfe7ea70c05490f96ce2986570"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HU3RLpVZvWEXE7v5S/Jk/EtPCuhQ/uouM+AO/O9b/2qtH0BuGUgEOL6Gnc0JubbDaV/86yRquZdDIgq7QSP5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:03:07.669011Z","bundle_sha256":"15717a086995bb41a14b0f01e54a3f4d5f0f5e1c5a785aafc274c331c18262c9"}}