{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LOQOSMW7JF7NVWU3N6Z4EDNNMG","short_pith_number":"pith:LOQOSMW7","schema_version":"1.0","canonical_sha256":"5ba0e932df497edada9b6fb3c20dad6187381a6b98dc7ed7df78d150d6e86c34","source":{"kind":"arxiv","id":"2405.15736","version":1},"attestation_state":"computed","paper":{"title":"Single-Round Proofs of Quantumness from Knowledge Assumptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexandru Gheorghiu, Petia Arabadjieva, Tony Metger, Victor Gitton","submitted_at":"2024-05-24T17:33:10Z","abstract_excerpt":"A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass, but all efficient classical computers cannot (under some cryptographic assumption). Such protocols play a crucial role in the certification of quantum devices. Existing single-round protocols (like asking the quantum computer to factor a large number) require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. As such, current proofs of quantumness are out of reach for near-term devices.\n  In this wo"},"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":"2405.15736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-24T17:33:10Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"be3e4a60d30b4eca8dd010f353299333e99e5db8c1faee461c27b4bfe801fe4f","abstract_canon_sha256":"59fccb57d0d8f4cb81fd02886066339d31e73dcf5145b20947725f05c6f5bc25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:53.279549Z","signature_b64":"8yKADlYPxrG+692gOhQCQVCRxe3cKb3f4TgrGhw+lpO8ceMbSVgxABWQPSjlurAWNIPdd6ZX0OOdaUeKWitGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba0e932df497edada9b6fb3c20dad6187381a6b98dc7ed7df78d150d6e86c34","last_reissued_at":"2026-07-05T08:22:53.279098Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:53.279098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-Round Proofs of Quantumness from Knowledge Assumptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexandru Gheorghiu, Petia Arabadjieva, Tony Metger, Victor Gitton","submitted_at":"2024-05-24T17:33:10Z","abstract_excerpt":"A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass, but all efficient classical computers cannot (under some cryptographic assumption). Such protocols play a crucial role in the certification of quantum devices. Existing single-round protocols (like asking the quantum computer to factor a large number) require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. As such, current proofs of quantumness are out of reach for near-term devices.\n  In this wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.15736","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/2405.15736/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":"2405.15736","created_at":"2026-07-05T08:22:53.279156+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.15736v1","created_at":"2026-07-05T08:22:53.279156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.15736","created_at":"2026-07-05T08:22:53.279156+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOQOSMW7JF7N","created_at":"2026-07-05T08:22:53.279156+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOQOSMW7JF7NVWU3","created_at":"2026-07-05T08:22:53.279156+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOQOSMW7","created_at":"2026-07-05T08:22:53.279156+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/LOQOSMW7JF7NVWU3N6Z4EDNNMG","json":"https://pith.science/pith/LOQOSMW7JF7NVWU3N6Z4EDNNMG.json","graph_json":"https://pith.science/api/pith-number/LOQOSMW7JF7NVWU3N6Z4EDNNMG/graph.json","events_json":"https://pith.science/api/pith-number/LOQOSMW7JF7NVWU3N6Z4EDNNMG/events.json","paper":"https://pith.science/paper/LOQOSMW7"},"agent_actions":{"view_html":"https://pith.science/pith/LOQOSMW7JF7NVWU3N6Z4EDNNMG","download_json":"https://pith.science/pith/LOQOSMW7JF7NVWU3N6Z4EDNNMG.json","view_paper":"https://pith.science/paper/LOQOSMW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.15736&json=true","fetch_graph":"https://pith.science/api/pith-number/LOQOSMW7JF7NVWU3N6Z4EDNNMG/graph.json","fetch_events":"https://pith.science/api/pith-number/LOQOSMW7JF7NVWU3N6Z4EDNNMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOQOSMW7JF7NVWU3N6Z4EDNNMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOQOSMW7JF7NVWU3N6Z4EDNNMG/action/storage_attestation","attest_author":"https://pith.science/pith/LOQOSMW7JF7NVWU3N6Z4EDNNMG/action/author_attestation","sign_citation":"https://pith.science/pith/LOQOSMW7JF7NVWU3N6Z4EDNNMG/action/citation_signature","submit_replication":"https://pith.science/pith/LOQOSMW7JF7NVWU3N6Z4EDNNMG/action/replication_record"}},"created_at":"2026-07-05T08:22:53.279156+00:00","updated_at":"2026-07-05T08:22:53.279156+00:00"}