{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2GOGMHOCP7Q5WYH5QJ7GEBRTKQ","short_pith_number":"pith:2GOGMHOC","schema_version":"1.0","canonical_sha256":"d19c661dc27fe1db60fd827e620633541fe9b0cac5c1cd66d8f336f37f4840a5","source":{"kind":"arxiv","id":"1806.09138","version":2},"attestation_state":"computed","paper":{"title":"Resource-efficient verification of quantum computing using Serfling's bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akihiro Mizutani, Atul Mantri, Joseph F. Fitzsimons, Tomoyuki Morimae, Yuki Takeuchi","submitted_at":"2018-06-24T12:29:51Z","abstract_excerpt":"Verifying quantum states is central to certifying the correct operation of various quantum information processing tasks. In particular, in measurement-based quantum computing, checking whether correct graph states are generated is essential for reliable quantum computing. Several verification protocols for graph states have been proposed, but none of these are particularly resource efficient: multiple copies are required to extract a single state that is guaranteed to be close to the ideal one. The best protocol currently known requires $O(n^{15})$ copies of the state, where $n$ is the size of"},"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":"1806.09138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-24T12:29:51Z","cross_cats_sorted":[],"title_canon_sha256":"39413221b491cdc224ed8456a5819cf758ed8ba652de1dbb6755af8e6d0c1efc","abstract_canon_sha256":"91bc2edf434a4fcc82e2360aa4bbd5cd2f23088799a7925e975880b323a8723e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:40.383156Z","signature_b64":"HcBxiRMwPH72TZqj6npfpwJTSGH3jbIBfCG6mo0IFV7QymK7tF0Mlu8mh4ANuXnoQt1aCxuNI0mid9rxGTQPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d19c661dc27fe1db60fd827e620633541fe9b0cac5c1cd66d8f336f37f4840a5","last_reissued_at":"2026-05-17T23:48:40.382442Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:40.382442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource-efficient verification of quantum computing using Serfling's bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akihiro Mizutani, Atul Mantri, Joseph F. Fitzsimons, Tomoyuki Morimae, Yuki Takeuchi","submitted_at":"2018-06-24T12:29:51Z","abstract_excerpt":"Verifying quantum states is central to certifying the correct operation of various quantum information processing tasks. In particular, in measurement-based quantum computing, checking whether correct graph states are generated is essential for reliable quantum computing. Several verification protocols for graph states have been proposed, but none of these are particularly resource efficient: multiple copies are required to extract a single state that is guaranteed to be close to the ideal one. The best protocol currently known requires $O(n^{15})$ copies of the state, where $n$ is the size of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09138","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.09138","created_at":"2026-05-17T23:48:40.382556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09138v2","created_at":"2026-05-17T23:48:40.382556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09138","created_at":"2026-05-17T23:48:40.382556+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GOGMHOCP7Q5","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GOGMHOCP7Q5WYH5","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GOGMHOC","created_at":"2026-05-18T12:32:02.567920+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/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ","json":"https://pith.science/pith/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ.json","graph_json":"https://pith.science/api/pith-number/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ/graph.json","events_json":"https://pith.science/api/pith-number/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ/events.json","paper":"https://pith.science/paper/2GOGMHOC"},"agent_actions":{"view_html":"https://pith.science/pith/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ","download_json":"https://pith.science/pith/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ.json","view_paper":"https://pith.science/paper/2GOGMHOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09138&json=true","fetch_graph":"https://pith.science/api/pith-number/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ/action/storage_attestation","attest_author":"https://pith.science/pith/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ/action/author_attestation","sign_citation":"https://pith.science/pith/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ/action/citation_signature","submit_replication":"https://pith.science/pith/2GOGMHOCP7Q5WYH5QJ7GEBRTKQ/action/replication_record"}},"created_at":"2026-05-17T23:48:40.382556+00:00","updated_at":"2026-05-17T23:48:40.382556+00:00"}