{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3BO3ZP3ETTU76V3DJARMZJX5H2","short_pith_number":"pith:3BO3ZP3E","schema_version":"1.0","canonical_sha256":"d85dbcbf649ce9ff57634822cca6fd3e98b7c3feafc345dcce86750b9d00760c","source":{"kind":"arxiv","id":"2607.03983","version":1},"attestation_state":"computed","paper":{"title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Harold Ollivier","submitted_at":"2026-07-04T18:44:43Z","abstract_excerpt":"How can a user with limited quantum resources verify the output of an untrusted, fully quantum server? This manuscript provides a conceptual synthesis of some recent developments toward answering this question under statistical (information-theoretic) security. Rather than duplicating the dense technical proofs of the underlying publications, our focus here is on the physical motivations, the structural connections between different protocols, and the path toward hardware-efficient implementation.\n  We begin by introducing a modular, composable framework that partitions verification into three"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.03983","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-04T18:44:43Z","cross_cats_sorted":[],"title_canon_sha256":"7b4bc20f94255688d8ecca697144ca6ba2378eb567797acea0dcaea1dcc2c664","abstract_canon_sha256":"bfc7eaee62a9dec93c772374a23d0c5cc8394b5fd3f7ba9072cd7ae37af38b05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:18:50.858269Z","signature_b64":"T/Cib0nkU2s+o+1jQLdvsLoHDITeNI2Hm+ExM0xYVYp1A+Ukba2uv83ApT4wK5l50JuUvDuRa/JrWF8I9bqHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d85dbcbf649ce9ff57634822cca6fd3e98b7c3feafc345dcce86750b9d00760c","last_reissued_at":"2026-07-07T02:18:50.857568Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:18:50.857568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of Quantum Computations: Hardware-Efficient Security Proofs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Harold Ollivier","submitted_at":"2026-07-04T18:44:43Z","abstract_excerpt":"How can a user with limited quantum resources verify the output of an untrusted, fully quantum server? This manuscript provides a conceptual synthesis of some recent developments toward answering this question under statistical (information-theoretic) security. Rather than duplicating the dense technical proofs of the underlying publications, our focus here is on the physical motivations, the structural connections between different protocols, and the path toward hardware-efficient implementation.\n  We begin by introducing a modular, composable framework that partitions verification into three"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03983","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.03983/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.03983","created_at":"2026-07-07T02:18:50.857674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.03983v1","created_at":"2026-07-07T02:18:50.857674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03983","created_at":"2026-07-07T02:18:50.857674+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BO3ZP3ETTU7","created_at":"2026-07-07T02:18:50.857674+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BO3ZP3ETTU76V3D","created_at":"2026-07-07T02:18:50.857674+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BO3ZP3E","created_at":"2026-07-07T02:18:50.857674+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BO3ZP3ETTU76V3DJARMZJX5H2","json":"https://pith.science/pith/3BO3ZP3ETTU76V3DJARMZJX5H2.json","graph_json":"https://pith.science/api/pith-number/3BO3ZP3ETTU76V3DJARMZJX5H2/graph.json","events_json":"https://pith.science/api/pith-number/3BO3ZP3ETTU76V3DJARMZJX5H2/events.json","paper":"https://pith.science/paper/3BO3ZP3E"},"agent_actions":{"view_html":"https://pith.science/pith/3BO3ZP3ETTU76V3DJARMZJX5H2","download_json":"https://pith.science/pith/3BO3ZP3ETTU76V3DJARMZJX5H2.json","view_paper":"https://pith.science/paper/3BO3ZP3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.03983&json=true","fetch_graph":"https://pith.science/api/pith-number/3BO3ZP3ETTU76V3DJARMZJX5H2/graph.json","fetch_events":"https://pith.science/api/pith-number/3BO3ZP3ETTU76V3DJARMZJX5H2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BO3ZP3ETTU76V3DJARMZJX5H2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BO3ZP3ETTU76V3DJARMZJX5H2/action/storage_attestation","attest_author":"https://pith.science/pith/3BO3ZP3ETTU76V3DJARMZJX5H2/action/author_attestation","sign_citation":"https://pith.science/pith/3BO3ZP3ETTU76V3DJARMZJX5H2/action/citation_signature","submit_replication":"https://pith.science/pith/3BO3ZP3ETTU76V3DJARMZJX5H2/action/replication_record"}},"created_at":"2026-07-07T02:18:50.857674+00:00","updated_at":"2026-07-07T02:18:50.857674+00:00"}