{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I6Q7DFKABOGVRIFHXF2KADW6FQ","short_pith_number":"pith:I6Q7DFKA","canonical_record":{"source":{"id":"1709.06984","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T17:49:12Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"a246880d76034d7bdaf2430b02411097d3294fafe30aa3fce2782408820c08e4","abstract_canon_sha256":"bbe6f018fafadf41a1c98898526a22f85705baa28f22cf0c01c17632d6c0b912"},"schema_version":"1.0"},"canonical_sha256":"47a1f195400b8d58a0a7b974a00ede2c19ed236a7c4c7760730ed38766d7fec7","source":{"kind":"arxiv","id":"1709.06984","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06984","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06984v2","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06984","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"I6Q7DFKABOGV","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I6Q7DFKABOGVRIFH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I6Q7DFKA","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I6Q7DFKABOGVRIFHXF2KADW6FQ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06984","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T17:49:12Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"a246880d76034d7bdaf2430b02411097d3294fafe30aa3fce2782408820c08e4","abstract_canon_sha256":"bbe6f018fafadf41a1c98898526a22f85705baa28f22cf0c01c17632d6c0b912"},"schema_version":"1.0"},"canonical_sha256":"47a1f195400b8d58a0a7b974a00ede2c19ed236a7c4c7760730ed38766d7fec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:18.647364Z","signature_b64":"wWT0gmoqq/i21RaH9PJhP3h5pHe4ENEGXqHL/NSqi3PLomluRrhJ3ge8Cl1CsejkR0sKdtgmj6hsKlheIMILAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47a1f195400b8d58a0a7b974a00ede2c19ed236a7c4c7760730ed38766d7fec7","last_reissued_at":"2026-05-18T00:11:18.646699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:18.646699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06984","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-18T00:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dtb3WPUb3Vx4Fq/tOBu8L6fKpC6/vWQsOPp30ZqfUmBJLh3p1ncZxadxG9hwe+a7EuTLJKH2kxhLkK5UoBoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T20:06:58.023256Z"},"content_sha256":"d168257a8f4c235c67c83437e87b136b81f276961d3c3c118477d16ca6b9dfbe","schema_version":"1.0","event_id":"sha256:d168257a8f4c235c67c83437e87b136b81f276961d3c3c118477d16ca6b9dfbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I6Q7DFKABOGVRIFHXF2KADW6FQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of quantum computation: An overview of existing approaches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexandru Gheorghiu, Elham Kashefi, Theodoros Kapourniotis","submitted_at":"2017-09-20T17:49:12Z","abstract_excerpt":"Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can check whether quantum computers are indeed producing correct results. This task, known as quantum verification, has been highlighted as a significant challenge on the road to scalable quantum computing technology. We review the most significant approaches to quantum verification and compare them in terms of structure, complexity and required resources. We al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06984","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-18T00:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwzfX2rY7r7oLAFddwTS+syBz9sI+TMRimwFr5n5MHs6Z/0HnhKoss/0cQ2/m4qyfjRCgWjk0omwCWW+pbIHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T20:06:58.023751Z"},"content_sha256":"6c0944cd32bc2f6a3d19cc34958e3da1a2013976f2130dc3fd92f9a3edc69374","schema_version":"1.0","event_id":"sha256:6c0944cd32bc2f6a3d19cc34958e3da1a2013976f2130dc3fd92f9a3edc69374"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6Q7DFKABOGVRIFHXF2KADW6FQ/bundle.json","state_url":"https://pith.science/pith/I6Q7DFKABOGVRIFHXF2KADW6FQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6Q7DFKABOGVRIFHXF2KADW6FQ/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-08-14T20:06:58Z","links":{"resolver":"https://pith.science/pith/I6Q7DFKABOGVRIFHXF2KADW6FQ","bundle":"https://pith.science/pith/I6Q7DFKABOGVRIFHXF2KADW6FQ/bundle.json","state":"https://pith.science/pith/I6Q7DFKABOGVRIFHXF2KADW6FQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6Q7DFKABOGVRIFHXF2KADW6FQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I6Q7DFKABOGVRIFHXF2KADW6FQ","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":"bbe6f018fafadf41a1c98898526a22f85705baa28f22cf0c01c17632d6c0b912","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T17:49:12Z","title_canon_sha256":"a246880d76034d7bdaf2430b02411097d3294fafe30aa3fce2782408820c08e4"},"schema_version":"1.0","source":{"id":"1709.06984","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06984","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06984v2","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06984","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"I6Q7DFKABOGV","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I6Q7DFKABOGVRIFH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I6Q7DFKA","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:6c0944cd32bc2f6a3d19cc34958e3da1a2013976f2130dc3fd92f9a3edc69374","target":"graph","created_at":"2026-05-18T00:11:18Z","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":"Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can check whether quantum computers are indeed producing correct results. This task, known as quantum verification, has been highlighted as a significant challenge on the road to scalable quantum computing technology. We review the most significant approaches to quantum verification and compare them in terms of structure, complexity and required resources. We al","authors_text":"Alexandru Gheorghiu, Elham Kashefi, Theodoros Kapourniotis","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T17:49:12Z","title":"Verification of quantum computation: An overview of existing approaches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06984","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:d168257a8f4c235c67c83437e87b136b81f276961d3c3c118477d16ca6b9dfbe","target":"record","created_at":"2026-05-18T00:11:18Z","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":"bbe6f018fafadf41a1c98898526a22f85705baa28f22cf0c01c17632d6c0b912","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-20T17:49:12Z","title_canon_sha256":"a246880d76034d7bdaf2430b02411097d3294fafe30aa3fce2782408820c08e4"},"schema_version":"1.0","source":{"id":"1709.06984","kind":"arxiv","version":2}},"canonical_sha256":"47a1f195400b8d58a0a7b974a00ede2c19ed236a7c4c7760730ed38766d7fec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47a1f195400b8d58a0a7b974a00ede2c19ed236a7c4c7760730ed38766d7fec7","first_computed_at":"2026-05-18T00:11:18.646699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:18.646699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wWT0gmoqq/i21RaH9PJhP3h5pHe4ENEGXqHL/NSqi3PLomluRrhJ3ge8Cl1CsejkR0sKdtgmj6hsKlheIMILAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:18.647364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06984","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d168257a8f4c235c67c83437e87b136b81f276961d3c3c118477d16ca6b9dfbe","sha256:6c0944cd32bc2f6a3d19cc34958e3da1a2013976f2130dc3fd92f9a3edc69374"],"state_sha256":"bd7452e9bf62ea72e4af8618de486dc87a4891fd416b196c2a16d92329960a19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zh2spdH1IBCSKkDxZVXlR1SnF02nuDvmQV3enT04qAcYkDev/f5zyQNajZ/pQ6ltRIjkI6Y4qw+9Aa/DrB1BDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T20:06:58.027562Z","bundle_sha256":"b6331e1111a9816faec466e4490bd7f2b8d11e853de97cd4e36703aaaff6aeb6"}}