{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CSORIAMIA5DOZI664SOVLPE7YE","short_pith_number":"pith:CSORIAMI","canonical_record":{"source":{"id":"1002.2419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-11T20:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"a834ae018fd1a90749dfb179c1f442f11b848af62f34a80ba9f1cf8799748a81","abstract_canon_sha256":"0a57e43647101e7fee5f92c1261ee43fcd8d16ef0c2d5b6518451895dbfaed36"},"schema_version":"1.0"},"canonical_sha256":"149d1401880746eca3dee49d55bc9fc10a48aad5085fda5a85653de504c6d213","source":{"kind":"arxiv","id":"1002.2419","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2419","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2419v2","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2419","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"CSORIAMIA5DO","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CSORIAMIA5DOZI66","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CSORIAMI","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CSORIAMIA5DOZI664SOVLPE7YE","target":"record","payload":{"canonical_record":{"source":{"id":"1002.2419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-11T20:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"a834ae018fd1a90749dfb179c1f442f11b848af62f34a80ba9f1cf8799748a81","abstract_canon_sha256":"0a57e43647101e7fee5f92c1261ee43fcd8d16ef0c2d5b6518451895dbfaed36"},"schema_version":"1.0"},"canonical_sha256":"149d1401880746eca3dee49d55bc9fc10a48aad5085fda5a85653de504c6d213","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:55.938827Z","signature_b64":"3+CWhaR1Xh2QhNSwQEWUN6g3FakvOksYrhkU/VyuEf/EJ401ptXDirlO9+19v/hjlznM4fHe6HgcRdpA09WVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"149d1401880746eca3dee49d55bc9fc10a48aad5085fda5a85653de504c6d213","last_reissued_at":"2026-05-18T01:19:55.938108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:55.938108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.2419","source_version":2,"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-18T01:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZC/bXIvZ3p4FHcVege/IrUOBiLSH1jn7tQIQGRkIk3q4yawCgCGRD9Z283fTFlsI50bD/CiEFYaf57XKN3KkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:22:19.435689Z"},"content_sha256":"bf4b35d409ad277419781329990279e6e26559a2a3fbcaed9c21188212d091db","schema_version":"1.0","event_id":"sha256:bf4b35d409ad277419781329990279e6e26559a2a3fbcaed9c21188212d091db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CSORIAMIA5DOZI664SOVLPE7YE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum walks can find a marked element on any graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Magniez, Hari Krovi, J\\'er\\'emie Roland, Maris Ozols","submitted_at":"2010-02-11T20:18:35Z","abstract_excerpt":"We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically smaller than the classical hitting time $HT(P,M)$ of any reversible random walk $P$ on the graph. In the case of multiple marked elements, the number of steps is given in terms of a related quantity $HT^+(\\mathit{P,M})$ which we call extended hitting time.\n  Our approach is new, simpler and more general than previous ones. We introduce a notion of interpolat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2419","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"},"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-18T01:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+yfvc4hPR45qUFfIzZ7ETBGYA+l4GT6eE7lqdAsHhpI7xsSUb5tmNAlPqAHvF5GuHCgNlkm5WlsqUqnGW3HYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:22:19.436432Z"},"content_sha256":"491c6a6b8338eb39c25978373d380af33ff6a4296881e4123a2bf8998f711ae5","schema_version":"1.0","event_id":"sha256:491c6a6b8338eb39c25978373d380af33ff6a4296881e4123a2bf8998f711ae5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE/bundle.json","state_url":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSORIAMIA5DOZI664SOVLPE7YE/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-06-10T06:22:19Z","links":{"resolver":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE","bundle":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE/bundle.json","state":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSORIAMIA5DOZI664SOVLPE7YE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CSORIAMIA5DOZI664SOVLPE7YE","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":"0a57e43647101e7fee5f92c1261ee43fcd8d16ef0c2d5b6518451895dbfaed36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-11T20:18:35Z","title_canon_sha256":"a834ae018fd1a90749dfb179c1f442f11b848af62f34a80ba9f1cf8799748a81"},"schema_version":"1.0","source":{"id":"1002.2419","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2419","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2419v2","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2419","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"CSORIAMIA5DO","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CSORIAMIA5DOZI66","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CSORIAMI","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:491c6a6b8338eb39c25978373d380af33ff6a4296881e4123a2bf8998f711ae5","target":"graph","created_at":"2026-05-18T01:19:55Z","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":"We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically smaller than the classical hitting time $HT(P,M)$ of any reversible random walk $P$ on the graph. In the case of multiple marked elements, the number of steps is given in terms of a related quantity $HT^+(\\mathit{P,M})$ which we call extended hitting time.\n  Our approach is new, simpler and more general than previous ones. We introduce a notion of interpolat","authors_text":"Fr\\'ed\\'eric Magniez, Hari Krovi, J\\'er\\'emie Roland, Maris Ozols","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-11T20:18:35Z","title":"Quantum walks can find a marked element on any graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2419","kind":"arxiv","version":2},"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:bf4b35d409ad277419781329990279e6e26559a2a3fbcaed9c21188212d091db","target":"record","created_at":"2026-05-18T01:19:55Z","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":"0a57e43647101e7fee5f92c1261ee43fcd8d16ef0c2d5b6518451895dbfaed36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-11T20:18:35Z","title_canon_sha256":"a834ae018fd1a90749dfb179c1f442f11b848af62f34a80ba9f1cf8799748a81"},"schema_version":"1.0","source":{"id":"1002.2419","kind":"arxiv","version":2}},"canonical_sha256":"149d1401880746eca3dee49d55bc9fc10a48aad5085fda5a85653de504c6d213","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"149d1401880746eca3dee49d55bc9fc10a48aad5085fda5a85653de504c6d213","first_computed_at":"2026-05-18T01:19:55.938108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:55.938108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3+CWhaR1Xh2QhNSwQEWUN6g3FakvOksYrhkU/VyuEf/EJ401ptXDirlO9+19v/hjlznM4fHe6HgcRdpA09WVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:55.938827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.2419","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf4b35d409ad277419781329990279e6e26559a2a3fbcaed9c21188212d091db","sha256:491c6a6b8338eb39c25978373d380af33ff6a4296881e4123a2bf8998f711ae5"],"state_sha256":"cfa667d2e57a6dcdb050d99e5cc7b8a5247a9613c0fbbcfff7f90f46ece89541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NaEwS1blZS4FMJ8JCHOG/7OEibFdiUVByAzYPjlAl5YN3MY3rV1OWXHjoTf7mEKU2COQV3+Bmi3PPTT2DYEIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:22:19.440466Z","bundle_sha256":"4ddde2c48c86c40466d1e2c9ac6d6d40355ea50180014405ccce13ea2c1a958f"}}