{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KNZEILCIMXZ22SMUNWI5NASGOG","short_pith_number":"pith:KNZEILCI","canonical_record":{"source":{"id":"1707.01581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-05T21:09:07Z","cross_cats_sorted":[],"title_canon_sha256":"2bda5cfa3bf57c4b0993bbf0398ecca3aca43fc93a9d083798b9e60ee85b2818","abstract_canon_sha256":"4782c3dc622f59d8967179c3938a4c789294239581a3803caefc12996d55f89b"},"schema_version":"1.0"},"canonical_sha256":"5372442c4865f3ad49946d91d68246719a69a62817624c5703d5f07548ac9634","source":{"kind":"arxiv","id":"1707.01581","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01581","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01581v2","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01581","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"pith_short_12","alias_value":"KNZEILCIMXZ2","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNZEILCIMXZ22SMU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNZEILCI","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KNZEILCIMXZ22SMUNWI5NASGOG","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-05T21:09:07Z","cross_cats_sorted":[],"title_canon_sha256":"2bda5cfa3bf57c4b0993bbf0398ecca3aca43fc93a9d083798b9e60ee85b2818","abstract_canon_sha256":"4782c3dc622f59d8967179c3938a4c789294239581a3803caefc12996d55f89b"},"schema_version":"1.0"},"canonical_sha256":"5372442c4865f3ad49946d91d68246719a69a62817624c5703d5f07548ac9634","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:03.838892Z","signature_b64":"iBxVATJAyEQqBdz5PhFT5blvuPXcsZOuD6JCdS8YVPh5vlwdcWR5gvl+LVw25W2eeH3Wc8Vc9NYb9Uqqr1nXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5372442c4865f3ad49946d91d68246719a69a62817624c5703d5f07548ac9634","last_reissued_at":"2026-05-18T00:35:03.838162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:03.838162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01581","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-18T00:35:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uy2qIBWno3gg+k45hZZhqjRPBakqXr4fJX7MYzJr5GWG79TXSh30yDC2FZ60LA6CXViMMQLcVWpkSZ/yVlSzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:23:37.687680Z"},"content_sha256":"cc30310bdf5b8e4b7f334776b3caf082cb1cd84048e87094ab4c8807447a958c","schema_version":"1.0","event_id":"sha256:cc30310bdf5b8e4b7f334776b3caf082cb1cd84048e87094ab4c8807447a958c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KNZEILCIMXZ22SMUNWI5NASGOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding paths with quantum walks or quantum walking through a maze","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Koch, Daniel Reitzner, Mark Hillery","submitted_at":"2017-07-05T21:09:07Z","abstract_excerpt":"We show that it is possible to use a quantum walk to find a path from one marked vertex to another. In the specific case of $M$ stars connected in a chain, one can find the path from the first star to the last one in $O(M\\sqrt{N})$ steps, where $N$ is the number of spokes of each star. First we provide an analytical result showing that by starting in a phase-modulated highly superposed initial state we can find the path in $O(M\\sqrt{N}\\log M)$ steps. Next, we improve this efficiency by showing that the recovery of the path can also be performed by a series of successive searches when we start "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01581","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-18T00:35:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RrL/HSJnu42wlnTwYoWJd4W8u0qmL4W+nS+B1Q1V4Tz5Zu7gq4hv5daR1G3Nrv5j5ImcHnIuOdldSPQePWrtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T16:23:37.688032Z"},"content_sha256":"4e673458d0a28e836a0618fb54b81eb2c489d6f27f6d82df20f9674c492c8245","schema_version":"1.0","event_id":"sha256:4e673458d0a28e836a0618fb54b81eb2c489d6f27f6d82df20f9674c492c8245"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG/bundle.json","state_url":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNZEILCIMXZ22SMUNWI5NASGOG/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-19T16:23:37Z","links":{"resolver":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG","bundle":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG/bundle.json","state":"https://pith.science/pith/KNZEILCIMXZ22SMUNWI5NASGOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNZEILCIMXZ22SMUNWI5NASGOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KNZEILCIMXZ22SMUNWI5NASGOG","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":"4782c3dc622f59d8967179c3938a4c789294239581a3803caefc12996d55f89b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-05T21:09:07Z","title_canon_sha256":"2bda5cfa3bf57c4b0993bbf0398ecca3aca43fc93a9d083798b9e60ee85b2818"},"schema_version":"1.0","source":{"id":"1707.01581","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01581","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01581v2","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01581","created_at":"2026-05-18T00:35:03Z"},{"alias_kind":"pith_short_12","alias_value":"KNZEILCIMXZ2","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNZEILCIMXZ22SMU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNZEILCI","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:4e673458d0a28e836a0618fb54b81eb2c489d6f27f6d82df20f9674c492c8245","target":"graph","created_at":"2026-05-18T00:35:03Z","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 that it is possible to use a quantum walk to find a path from one marked vertex to another. In the specific case of $M$ stars connected in a chain, one can find the path from the first star to the last one in $O(M\\sqrt{N})$ steps, where $N$ is the number of spokes of each star. First we provide an analytical result showing that by starting in a phase-modulated highly superposed initial state we can find the path in $O(M\\sqrt{N}\\log M)$ steps. Next, we improve this efficiency by showing that the recovery of the path can also be performed by a series of successive searches when we start ","authors_text":"Daniel Koch, Daniel Reitzner, Mark Hillery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-05T21:09:07Z","title":"Finding paths with quantum walks or quantum walking through a maze"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01581","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:cc30310bdf5b8e4b7f334776b3caf082cb1cd84048e87094ab4c8807447a958c","target":"record","created_at":"2026-05-18T00:35:03Z","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":"4782c3dc622f59d8967179c3938a4c789294239581a3803caefc12996d55f89b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-07-05T21:09:07Z","title_canon_sha256":"2bda5cfa3bf57c4b0993bbf0398ecca3aca43fc93a9d083798b9e60ee85b2818"},"schema_version":"1.0","source":{"id":"1707.01581","kind":"arxiv","version":2}},"canonical_sha256":"5372442c4865f3ad49946d91d68246719a69a62817624c5703d5f07548ac9634","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5372442c4865f3ad49946d91d68246719a69a62817624c5703d5f07548ac9634","first_computed_at":"2026-05-18T00:35:03.838162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:03.838162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iBxVATJAyEQqBdz5PhFT5blvuPXcsZOuD6JCdS8YVPh5vlwdcWR5gvl+LVw25W2eeH3Wc8Vc9NYb9Uqqr1nXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:03.838892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01581","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc30310bdf5b8e4b7f334776b3caf082cb1cd84048e87094ab4c8807447a958c","sha256:4e673458d0a28e836a0618fb54b81eb2c489d6f27f6d82df20f9674c492c8245"],"state_sha256":"bee5a8e8f6567b9f1cb39b91e90ef2ec5cd5199806bf0d37a072712516b3970b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b9A19vJJnjfOmxtOk8moNVKQl4X/va8JYMPaDe0nzEePBXH8y+8aB5ckf3kam4CS6623HuQK6oHgUGFRzbeUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T16:23:37.689985Z","bundle_sha256":"fa90f70264cc1fa0cfd426f43c0d8f95fae24756170a6ff915922408a4deae4f"}}