{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:3DHX7YBHRG7Q4QPOGLULPKN4FC","short_pith_number":"pith:3DHX7YBH","canonical_record":{"source":{"id":"quant-ph/0210064","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-10-10T00:06:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6fc5edf27e2490775a773e75e894895816b48e058d1f0b24b8ccacaf95839b8b","abstract_canon_sha256":"5e02fed7efa3864fe35a012a66be30d00faabd7461327654d32319f4bd9f637e"},"schema_version":"1.0"},"canonical_sha256":"d8cf7fe02789bf0e41ee32e8b7a9bc28ab0bf51f991bee24a7ae5777e50b0fe7","source":{"kind":"arxiv","id":"quant-ph/0210064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0210064","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0210064v1","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0210064","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"pith_short_12","alias_value":"3DHX7YBHRG7Q","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"pith_short_16","alias_value":"3DHX7YBHRG7Q4QPO","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"pith_short_8","alias_value":"3DHX7YBH","created_at":"2026-07-04T16:36:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:3DHX7YBHRG7Q4QPOGLULPKN4FC","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0210064","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-10-10T00:06:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6fc5edf27e2490775a773e75e894895816b48e058d1f0b24b8ccacaf95839b8b","abstract_canon_sha256":"5e02fed7efa3864fe35a012a66be30d00faabd7461327654d32319f4bd9f637e"},"schema_version":"1.0"},"canonical_sha256":"d8cf7fe02789bf0e41ee32e8b7a9bc28ab0bf51f991bee24a7ae5777e50b0fe7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:36:11.172055Z","signature_b64":"awMaD/YZVZuI6CNu/83XskCLu+mHwhX/+H4mnqJYGQ7y9Uf18bNz3pgvonIrL+HFcqevm8iqUWoudX1aX8vECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8cf7fe02789bf0e41ee32e8b7a9bc28ab0bf51f991bee24a7ae5777e50b0fe7","last_reissued_at":"2026-07-04T16:36:11.171714Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:36:11.171714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0210064","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-07-04T16:36:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Wa8zIiWaMw27HnyGZRQRt9DvKn9bp4Xsdgnw0hAb1wDckeLvgdX5a5YZTQuk6RaOcszdYBxoDpmZL+Q8ELrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T16:02:06.202251Z"},"content_sha256":"5b82427dbcf0eb098072df86baa78d24ee064bb73b6fb730a172eb7d01c76d4d","schema_version":"1.0","event_id":"sha256:5b82427dbcf0eb098072df86baa78d24ee064bb73b6fb730a172eb7d01c76d4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:3DHX7YBHRG7Q4QPOGLULPKN4FC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quantum Random Walk Search Algorithm","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Julia Kempe, K. Birgitta Whaley, Neil Shenvi","submitted_at":"2002-10-10T00:06:30Z","abstract_excerpt":"Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speed-up over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random walk architecture that provides such a speed-up. It will be shown that this algorithm performs an oracle search on a database of $N$ items with $O(\\sqrt{N})$ calls to the oracle, yielding a speed-up similar to other qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0210064","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/quant-ph/0210064/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"},"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-07-04T16:36:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PrzUo8ZY83g5OlrVY4SmbKNlZ4txg1in5+1tmKxatBH8jIhsSOmXINRnnT+34Bsp0dbtLveVLtCy9GnhVtjACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T16:02:06.202800Z"},"content_sha256":"dc44821b74234fd421c5ef32ff62c32db156960c72248070e2316a4597a8c67a","schema_version":"1.0","event_id":"sha256:dc44821b74234fd421c5ef32ff62c32db156960c72248070e2316a4597a8c67a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DHX7YBHRG7Q4QPOGLULPKN4FC/bundle.json","state_url":"https://pith.science/pith/3DHX7YBHRG7Q4QPOGLULPKN4FC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DHX7YBHRG7Q4QPOGLULPKN4FC/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-08-04T16:02:06Z","links":{"resolver":"https://pith.science/pith/3DHX7YBHRG7Q4QPOGLULPKN4FC","bundle":"https://pith.science/pith/3DHX7YBHRG7Q4QPOGLULPKN4FC/bundle.json","state":"https://pith.science/pith/3DHX7YBHRG7Q4QPOGLULPKN4FC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DHX7YBHRG7Q4QPOGLULPKN4FC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:3DHX7YBHRG7Q4QPOGLULPKN4FC","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":"5e02fed7efa3864fe35a012a66be30d00faabd7461327654d32319f4bd9f637e","cross_cats_sorted":["cs.DS"],"license":"","primary_cat":"quant-ph","submitted_at":"2002-10-10T00:06:30Z","title_canon_sha256":"6fc5edf27e2490775a773e75e894895816b48e058d1f0b24b8ccacaf95839b8b"},"schema_version":"1.0","source":{"id":"quant-ph/0210064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0210064","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0210064v1","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0210064","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"pith_short_12","alias_value":"3DHX7YBHRG7Q","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"pith_short_16","alias_value":"3DHX7YBHRG7Q4QPO","created_at":"2026-07-04T16:36:11Z"},{"alias_kind":"pith_short_8","alias_value":"3DHX7YBH","created_at":"2026-07-04T16:36:11Z"}],"graph_snapshots":[{"event_id":"sha256:dc44821b74234fd421c5ef32ff62c32db156960c72248070e2316a4597a8c67a","target":"graph","created_at":"2026-07-04T16:36:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0210064/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speed-up over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random walk architecture that provides such a speed-up. It will be shown that this algorithm performs an oracle search on a database of $N$ items with $O(\\sqrt{N})$ calls to the oracle, yielding a speed-up similar to other qu","authors_text":"Julia Kempe, K. Birgitta Whaley, Neil Shenvi","cross_cats":["cs.DS"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2002-10-10T00:06:30Z","title":"A Quantum Random Walk Search Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0210064","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:5b82427dbcf0eb098072df86baa78d24ee064bb73b6fb730a172eb7d01c76d4d","target":"record","created_at":"2026-07-04T16:36:11Z","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":"5e02fed7efa3864fe35a012a66be30d00faabd7461327654d32319f4bd9f637e","cross_cats_sorted":["cs.DS"],"license":"","primary_cat":"quant-ph","submitted_at":"2002-10-10T00:06:30Z","title_canon_sha256":"6fc5edf27e2490775a773e75e894895816b48e058d1f0b24b8ccacaf95839b8b"},"schema_version":"1.0","source":{"id":"quant-ph/0210064","kind":"arxiv","version":1}},"canonical_sha256":"d8cf7fe02789bf0e41ee32e8b7a9bc28ab0bf51f991bee24a7ae5777e50b0fe7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8cf7fe02789bf0e41ee32e8b7a9bc28ab0bf51f991bee24a7ae5777e50b0fe7","first_computed_at":"2026-07-04T16:36:11.171714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T16:36:11.171714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"awMaD/YZVZuI6CNu/83XskCLu+mHwhX/+H4mnqJYGQ7y9Uf18bNz3pgvonIrL+HFcqevm8iqUWoudX1aX8vECw==","signature_status":"signed_v1","signed_at":"2026-07-04T16:36:11.172055Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0210064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b82427dbcf0eb098072df86baa78d24ee064bb73b6fb730a172eb7d01c76d4d","sha256:dc44821b74234fd421c5ef32ff62c32db156960c72248070e2316a4597a8c67a"],"state_sha256":"d2f3b044ed9f27848fd8a0179f24bb0b370b080eaebfe28805f417280ae809ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZ7D64G1GFu/7TpQCImtjby7PSPgRmAfoztDpAepuKvMhKSAsC/5nIbybRDtYb7ppJw46sdJjMkii/voot67Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T16:02:06.231704Z","bundle_sha256":"a43818f758475e35e67d98ab8cfe0a999a3e5ba88077d007a1a089383cdd0144"}}