{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:UGP6IDKXFVHSDTJYWCZFW4J26K","short_pith_number":"pith:UGP6IDKX","canonical_record":{"source":{"id":"0911.1102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-05T19:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"8c5461d025d1639ddd39833a5a3018f63a39cecbd30f1da93f41a148b15f8f21","abstract_canon_sha256":"987e835b877d77c30c0c54e61d7b2dd770b53a9b7b884366ae62da273d095c2e"},"schema_version":"1.0"},"canonical_sha256":"a19fe40d572d4f21cd38b0b25b713af2beb92539a152c89bb573e84d5fa619d1","source":{"kind":"arxiv","id":"0911.1102","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.1102","created_at":"2026-05-18T02:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"0911.1102v1","created_at":"2026-05-18T02:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1102","created_at":"2026-05-18T02:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"UGP6IDKXFVHS","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UGP6IDKXFVHSDTJY","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UGP6IDKX","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:UGP6IDKXFVHSDTJYWCZFW4J26K","target":"record","payload":{"canonical_record":{"source":{"id":"0911.1102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-05T19:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"8c5461d025d1639ddd39833a5a3018f63a39cecbd30f1da93f41a148b15f8f21","abstract_canon_sha256":"987e835b877d77c30c0c54e61d7b2dd770b53a9b7b884366ae62da273d095c2e"},"schema_version":"1.0"},"canonical_sha256":"a19fe40d572d4f21cd38b0b25b713af2beb92539a152c89bb573e84d5fa619d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:10:59.150925Z","signature_b64":"4UubiyGe86132wPIb05fuYFG7RonlDnD4UVUzFynSLfQQnbFlTqOTHQkCBp/U/XZUOjOVaU5B/KlFipe9A08AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a19fe40d572d4f21cd38b0b25b713af2beb92539a152c89bb573e84d5fa619d1","last_reissued_at":"2026-05-18T02:10:59.150058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:10:59.150058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.1102","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-18T02:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gg2q86qad06mumY7n8IfyCpOPLfGQ65sY0PmdGuM7mQ1jy2l9BwJq3MU1XmGub8eM+ZWrwX/kg+C2oIunSu4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:31:51.072156Z"},"content_sha256":"c7951c3ad7c819ac9896cbcf03780d952d662fefc9ff70eff651a83c02927021","schema_version":"1.0","event_id":"sha256:c7951c3ad7c819ac9896cbcf03780d952d662fefc9ff70eff651a83c02927021"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:UGP6IDKXFVHSDTJYWCZFW4J26K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Searching via walking: How to find a marked subgraph of a graph using quantum walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Reitzner, Mark Hillery, Vladimir Buzek","submitted_at":"2009-11-05T19:01:14Z","abstract_excerpt":"We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1102","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-18T02:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3JjUgLBRZhn+qsFCgJUoy11riG2TogtENYi8wKLAFwaoYft9qagTw8nVbu22X2t3tnmtZxvLbzi2qzmpNmRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:31:51.072515Z"},"content_sha256":"140210f1a7f47ece83ad6350059d10a3fd1ff2f1c43ff7b34f181df494c3498c","schema_version":"1.0","event_id":"sha256:140210f1a7f47ece83ad6350059d10a3fd1ff2f1c43ff7b34f181df494c3498c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGP6IDKXFVHSDTJYWCZFW4J26K/bundle.json","state_url":"https://pith.science/pith/UGP6IDKXFVHSDTJYWCZFW4J26K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGP6IDKXFVHSDTJYWCZFW4J26K/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-28T16:31:51Z","links":{"resolver":"https://pith.science/pith/UGP6IDKXFVHSDTJYWCZFW4J26K","bundle":"https://pith.science/pith/UGP6IDKXFVHSDTJYWCZFW4J26K/bundle.json","state":"https://pith.science/pith/UGP6IDKXFVHSDTJYWCZFW4J26K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGP6IDKXFVHSDTJYWCZFW4J26K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:UGP6IDKXFVHSDTJYWCZFW4J26K","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":"987e835b877d77c30c0c54e61d7b2dd770b53a9b7b884366ae62da273d095c2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-05T19:01:14Z","title_canon_sha256":"8c5461d025d1639ddd39833a5a3018f63a39cecbd30f1da93f41a148b15f8f21"},"schema_version":"1.0","source":{"id":"0911.1102","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.1102","created_at":"2026-05-18T02:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"0911.1102v1","created_at":"2026-05-18T02:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1102","created_at":"2026-05-18T02:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"UGP6IDKXFVHS","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"UGP6IDKXFVHSDTJY","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"UGP6IDKX","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:140210f1a7f47ece83ad6350059d10a3fd1ff2f1c43ff7b34f181df494c3498c","target":"graph","created_at":"2026-05-18T02:10:59Z","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 show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how ","authors_text":"Daniel Reitzner, Mark Hillery, Vladimir Buzek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-05T19:01:14Z","title":"Searching via walking: How to find a marked subgraph of a graph using quantum walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1102","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:c7951c3ad7c819ac9896cbcf03780d952d662fefc9ff70eff651a83c02927021","target":"record","created_at":"2026-05-18T02:10:59Z","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":"987e835b877d77c30c0c54e61d7b2dd770b53a9b7b884366ae62da273d095c2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-11-05T19:01:14Z","title_canon_sha256":"8c5461d025d1639ddd39833a5a3018f63a39cecbd30f1da93f41a148b15f8f21"},"schema_version":"1.0","source":{"id":"0911.1102","kind":"arxiv","version":1}},"canonical_sha256":"a19fe40d572d4f21cd38b0b25b713af2beb92539a152c89bb573e84d5fa619d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a19fe40d572d4f21cd38b0b25b713af2beb92539a152c89bb573e84d5fa619d1","first_computed_at":"2026-05-18T02:10:59.150058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:10:59.150058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4UubiyGe86132wPIb05fuYFG7RonlDnD4UVUzFynSLfQQnbFlTqOTHQkCBp/U/XZUOjOVaU5B/KlFipe9A08AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:10:59.150925Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.1102","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7951c3ad7c819ac9896cbcf03780d952d662fefc9ff70eff651a83c02927021","sha256:140210f1a7f47ece83ad6350059d10a3fd1ff2f1c43ff7b34f181df494c3498c"],"state_sha256":"9b754c826d124446ded8c6c607fb61ddb88a2119b542b6263ae5ffbc36172e27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pGEMWV1gbJKD9/inVBa5C69cd1NR55zTh/vKbyTMFXQJPW8GVGyfBZ0Xw1rcEszUX05/kgro9YvAEHIyU82iDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:31:51.074759Z","bundle_sha256":"ad4c3aeccfdc3ba4824a3c78dfbbaab88d5c2d865e974875637ec8f59c7a602e"}}