{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OKCNNMGPPPDEBCQYDYSATGWRUU","short_pith_number":"pith:OKCNNMGP","canonical_record":{"source":{"id":"1703.10535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-30T15:41:50Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"c457dedbfa9381a5f07f0e637ef6b23f57b2126f6b3c11a8f85e3523516f83c4","abstract_canon_sha256":"c3b8eff1b90d8fc364708c9eab601b228b21539fc5ea46633af96a6bae052f4f"},"schema_version":"1.0"},"canonical_sha256":"7284d6b0cf7bc6408a181e24099ad1a51c94e9642ea84f170d7a444ad632f536","source":{"kind":"arxiv","id":"1703.10535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10535","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10535v1","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10535","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"OKCNNMGPPPDE","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKCNNMGPPPDEBCQY","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKCNNMGP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OKCNNMGPPPDEBCQYDYSATGWRUU","target":"record","payload":{"canonical_record":{"source":{"id":"1703.10535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-30T15:41:50Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"c457dedbfa9381a5f07f0e637ef6b23f57b2126f6b3c11a8f85e3523516f83c4","abstract_canon_sha256":"c3b8eff1b90d8fc364708c9eab601b228b21539fc5ea46633af96a6bae052f4f"},"schema_version":"1.0"},"canonical_sha256":"7284d6b0cf7bc6408a181e24099ad1a51c94e9642ea84f170d7a444ad632f536","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:01.569454Z","signature_b64":"dqAFuNfAlcItCSk9Ayaa80HPv1wkV6LDgvksFOBlxCtqO1dTHPQhlcoqWPlgKsMyXD5xIcK0RUR/yMCMU5wkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7284d6b0cf7bc6408a181e24099ad1a51c94e9642ea84f170d7a444ad632f536","last_reissued_at":"2026-05-18T00:29:01.569018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:01.569018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.10535","source_version":1,"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:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZ2DUlVAHbaJVMr43Q92ZRecfHI3KTqFf4MlYrt1wZsz3C14FPhu3MQ6eJ8aprd+hdWGYIW+N4gGGdUO3VdgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:13:55.270552Z"},"content_sha256":"a1da25d96b87ea55abdac29291abd08a0f922072b370628556f230ec212194a3","schema_version":"1.0","event_id":"sha256:a1da25d96b87ea55abdac29291abd08a0f922072b370628556f230ec212194a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OKCNNMGPPPDEBCQYDYSATGWRUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complete 3-Qubit Grover Search on a Programmable Quantum Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"C. Figgatt, C. Monroe, D. Maslov, K. A. Landsman, N. M. Linke, S. Debnath","submitted_at":"2017-03-30T15:41:50Z","abstract_excerpt":"Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries over classical computers. It is an optimal search algorithm for a quantum computer, and has further applications as a subroutine for other quantum algorithms. Searches with two qubits have been demonstrated on a variety of platforms and proposed for others, but larger search spaces have only been demonstrated on a non-scalable NMR system. Here, we report res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10535","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":""},"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:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+uUXRlhEvY+CQqPrPzZmKjXqq9c+1YldgnvmGChkASUxw4pQ1NSozFxCXo6ETnoGqrOWwEGWy0JI15ekL1JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:13:55.271201Z"},"content_sha256":"264b39d35da0d2ddb0700f115234a40467dcdb7c6dd32cca3c403c539d1232da","schema_version":"1.0","event_id":"sha256:264b39d35da0d2ddb0700f115234a40467dcdb7c6dd32cca3c403c539d1232da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/bundle.json","state_url":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/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-05-24T10:13:55Z","links":{"resolver":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU","bundle":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/bundle.json","state":"https://pith.science/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKCNNMGPPPDEBCQYDYSATGWRUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OKCNNMGPPPDEBCQYDYSATGWRUU","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":"c3b8eff1b90d8fc364708c9eab601b228b21539fc5ea46633af96a6bae052f4f","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-30T15:41:50Z","title_canon_sha256":"c457dedbfa9381a5f07f0e637ef6b23f57b2126f6b3c11a8f85e3523516f83c4"},"schema_version":"1.0","source":{"id":"1703.10535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10535","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10535v1","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10535","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"OKCNNMGPPPDE","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OKCNNMGPPPDEBCQY","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OKCNNMGP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:264b39d35da0d2ddb0700f115234a40467dcdb7c6dd32cca3c403c539d1232da","target":"graph","created_at":"2026-05-18T00:29:01Z","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":"Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries over classical computers. It is an optimal search algorithm for a quantum computer, and has further applications as a subroutine for other quantum algorithms. Searches with two qubits have been demonstrated on a variety of platforms and proposed for others, but larger search spaces have only been demonstrated on a non-scalable NMR system. Here, we report res","authors_text":"C. Figgatt, C. Monroe, D. Maslov, K. A. Landsman, N. M. Linke, S. Debnath","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-30T15:41:50Z","title":"Complete 3-Qubit Grover Search on a Programmable Quantum Computer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10535","kind":"arxiv","version":1},"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:a1da25d96b87ea55abdac29291abd08a0f922072b370628556f230ec212194a3","target":"record","created_at":"2026-05-18T00:29:01Z","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":"c3b8eff1b90d8fc364708c9eab601b228b21539fc5ea46633af96a6bae052f4f","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-30T15:41:50Z","title_canon_sha256":"c457dedbfa9381a5f07f0e637ef6b23f57b2126f6b3c11a8f85e3523516f83c4"},"schema_version":"1.0","source":{"id":"1703.10535","kind":"arxiv","version":1}},"canonical_sha256":"7284d6b0cf7bc6408a181e24099ad1a51c94e9642ea84f170d7a444ad632f536","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7284d6b0cf7bc6408a181e24099ad1a51c94e9642ea84f170d7a444ad632f536","first_computed_at":"2026-05-18T00:29:01.569018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:01.569018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dqAFuNfAlcItCSk9Ayaa80HPv1wkV6LDgvksFOBlxCtqO1dTHPQhlcoqWPlgKsMyXD5xIcK0RUR/yMCMU5wkBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:01.569454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1da25d96b87ea55abdac29291abd08a0f922072b370628556f230ec212194a3","sha256:264b39d35da0d2ddb0700f115234a40467dcdb7c6dd32cca3c403c539d1232da"],"state_sha256":"b9d56fdf916688d8e58ccfee32df8f6dd0ec4d1df7b65659596ef9e61665e715"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrEV82zOXve2mdjImsmLYlyEyhcRiQnhMwQ2CxNhy+dl3QZG59IbLWgpftNVDphRFKFN7kL/7b157wTtv0I6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T10:13:55.274866Z","bundle_sha256":"942a20b62427f0c206551cb46820cf355282d395791b843388a98f3b51c7dc95"}}