{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:3O75RDJT6UPNNEMX2XEWZC7NJG","short_pith_number":"pith:3O75RDJT","schema_version":"1.0","canonical_sha256":"dbbfd88d33f51ed69197d5c96c8bed499e356058653b0ccb79ee5635299365f6","source":{"kind":"arxiv","id":"0810.5375","version":2},"attestation_state":"computed","paper":{"title":"Interactive Proofs For Quantum Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Elad Eban, Michael Ben-Or","submitted_at":"2008-10-30T15:38:07Z","abstract_excerpt":"The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems perform as they should, if we cannot efficiently compute predictions for their behavior? Vazirani has asked: If predicting Quantum Mechanical systems requires exponential resources, is QM a falsifiable theory? In cryptographic settings, an untrusted future company wants to sell a quantum computer or perform a delegated quantum computation. Can the customer be"},"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":"0810.5375","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-10-30T15:38:07Z","cross_cats_sorted":[],"title_canon_sha256":"e2871a5e3d3da33c7034914c5cb8e87c1f9cff3485de089d23d4adffa1ee8645","abstract_canon_sha256":"53e1e690d2b013f1c8f663da713c350af993984bf95e1696afad3e6ace7bc87a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:16:07.568380Z","signature_b64":"yjg2QsDTHPAe3wl2WMtwHLa3ByFmUwGWxBzCfxCPMa2QNZ5wvmh9uqv/pg6cNG6drkJFOI8hd16jADk6EKnsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbbfd88d33f51ed69197d5c96c8bed499e356058653b0ccb79ee5635299365f6","last_reissued_at":"2026-07-04T15:16:07.567894Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:16:07.567894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interactive Proofs For Quantum Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Elad Eban, Michael Ben-Or","submitted_at":"2008-10-30T15:38:07Z","abstract_excerpt":"The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems perform as they should, if we cannot efficiently compute predictions for their behavior? Vazirani has asked: If predicting Quantum Mechanical systems requires exponential resources, is QM a falsifiable theory? In cryptographic settings, an untrusted future company wants to sell a quantum computer or perform a delegated quantum computation. Can the customer be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.5375","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0810.5375/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":"0810.5375","created_at":"2026-07-04T15:16:07.567957+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.5375v2","created_at":"2026-07-04T15:16:07.567957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.5375","created_at":"2026-07-04T15:16:07.567957+00:00"},{"alias_kind":"pith_short_12","alias_value":"3O75RDJT6UPN","created_at":"2026-07-04T15:16:07.567957+00:00"},{"alias_kind":"pith_short_16","alias_value":"3O75RDJT6UPNNEMX","created_at":"2026-07-04T15:16:07.567957+00:00"},{"alias_kind":"pith_short_8","alias_value":"3O75RDJT","created_at":"2026-07-04T15:16:07.567957+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2604.23490","citing_title":"Efficient Quantum Fully Homomorphic Encryption","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2606.30636","citing_title":"Authentication in Quantum Networks","ref_index":193,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23490","citing_title":"Efficient Quantum Fully Homomorphic Encryption","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3O75RDJT6UPNNEMX2XEWZC7NJG","json":"https://pith.science/pith/3O75RDJT6UPNNEMX2XEWZC7NJG.json","graph_json":"https://pith.science/api/pith-number/3O75RDJT6UPNNEMX2XEWZC7NJG/graph.json","events_json":"https://pith.science/api/pith-number/3O75RDJT6UPNNEMX2XEWZC7NJG/events.json","paper":"https://pith.science/paper/3O75RDJT"},"agent_actions":{"view_html":"https://pith.science/pith/3O75RDJT6UPNNEMX2XEWZC7NJG","download_json":"https://pith.science/pith/3O75RDJT6UPNNEMX2XEWZC7NJG.json","view_paper":"https://pith.science/paper/3O75RDJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.5375&json=true","fetch_graph":"https://pith.science/api/pith-number/3O75RDJT6UPNNEMX2XEWZC7NJG/graph.json","fetch_events":"https://pith.science/api/pith-number/3O75RDJT6UPNNEMX2XEWZC7NJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3O75RDJT6UPNNEMX2XEWZC7NJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3O75RDJT6UPNNEMX2XEWZC7NJG/action/storage_attestation","attest_author":"https://pith.science/pith/3O75RDJT6UPNNEMX2XEWZC7NJG/action/author_attestation","sign_citation":"https://pith.science/pith/3O75RDJT6UPNNEMX2XEWZC7NJG/action/citation_signature","submit_replication":"https://pith.science/pith/3O75RDJT6UPNNEMX2XEWZC7NJG/action/replication_record"}},"created_at":"2026-07-04T15:16:07.567957+00:00","updated_at":"2026-07-04T15:16:07.567957+00:00"}