{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GFHJPKP3TVPVV5PSI5PDL255BG","short_pith_number":"pith:GFHJPKP3","canonical_record":{"source":{"id":"1408.1616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-08-07T15:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"0606c5ff1577e05ca7a12c6c4d1eecbe2b069dd0d330322361fa161c88878878","abstract_canon_sha256":"0c1210c9df22bc542250449523ea18d2e480d45788ca4c42e7564e060d511a60"},"schema_version":"1.0"},"canonical_sha256":"314e97a9fb9d5f5af5f2475e35ebbd09a436310d10a477fbb5448d766e635bbc","source":{"kind":"arxiv","id":"1408.1616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1616","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1616v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1616","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"GFHJPKP3TVPV","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GFHJPKP3TVPVV5PS","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GFHJPKP3","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GFHJPKP3TVPVV5PSI5PDL255BG","target":"record","payload":{"canonical_record":{"source":{"id":"1408.1616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-08-07T15:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"0606c5ff1577e05ca7a12c6c4d1eecbe2b069dd0d330322361fa161c88878878","abstract_canon_sha256":"0c1210c9df22bc542250449523ea18d2e480d45788ca4c42e7564e060d511a60"},"schema_version":"1.0"},"canonical_sha256":"314e97a9fb9d5f5af5f2475e35ebbd09a436310d10a477fbb5448d766e635bbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:40.064244Z","signature_b64":"CwDolJ0Rqe5igN0ZGd1lFy36K/Hu+xf864JoA95pEYv/g2YMl6SdOlNHxTeYadzCwI6S6sze57rfaDWZjFJBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"314e97a9fb9d5f5af5f2475e35ebbd09a436310d10a477fbb5448d766e635bbc","last_reissued_at":"2026-05-18T02:45:40.063747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:40.063747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.1616","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:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kINXtUtUc4PRUUrmxTpgZv0T+Hg13+jegfVOTbBLE6wL1ADmIZyvd+qlUiOc68Hj6mngRNf8y5aDSBElZuPlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:00:00.911805Z"},"content_sha256":"ce07894e0486cf78791f545642bab9b8b8a5eeb7de39b1e1a5906938236c9480","schema_version":"1.0","event_id":"sha256:ce07894e0486cf78791f545642bab9b8b8a5eeb7de39b1e1a5906938236c9480"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GFHJPKP3TVPVV5PSI5PDL255BG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity analysis of quantum walk based search algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"B. L. Douglas, J. B. Wang","submitted_at":"2014-08-07T15:04:37Z","abstract_excerpt":"We present several families of graphs that allow both efficient quantum walk implementations and efficient quantum walk based search algorithms. For these graphs, we construct quantum circuits that explicitly implement the full quantum walk search algorithm, without reference to a `black box' oracle. These circuits provide a practically implementable method to explore quantum walk based search algorithms with the aim of eventual real-world applications. We also provide a numerical analysis of a quantum walk based search along a twisted toroid family of graphs, which requires O($\\sqrt{n}$ log($"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1616","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:45:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AqfpV1Td0eANGwqGVvafwB20tB6M3dwlZMogBNdt6cPavQR3DhwBJCKLunCUBiQjFkpLvnWhc+mEkOaebGTfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:00:00.912494Z"},"content_sha256":"d46eac9939f164ce39c5be644900764e99153017c666b2d4ee697adfdd7a53b9","schema_version":"1.0","event_id":"sha256:d46eac9939f164ce39c5be644900764e99153017c666b2d4ee697adfdd7a53b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFHJPKP3TVPVV5PSI5PDL255BG/bundle.json","state_url":"https://pith.science/pith/GFHJPKP3TVPVV5PSI5PDL255BG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFHJPKP3TVPVV5PSI5PDL255BG/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-27T01:00:00Z","links":{"resolver":"https://pith.science/pith/GFHJPKP3TVPVV5PSI5PDL255BG","bundle":"https://pith.science/pith/GFHJPKP3TVPVV5PSI5PDL255BG/bundle.json","state":"https://pith.science/pith/GFHJPKP3TVPVV5PSI5PDL255BG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFHJPKP3TVPVV5PSI5PDL255BG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GFHJPKP3TVPVV5PSI5PDL255BG","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":"0c1210c9df22bc542250449523ea18d2e480d45788ca4c42e7564e060d511a60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-08-07T15:04:37Z","title_canon_sha256":"0606c5ff1577e05ca7a12c6c4d1eecbe2b069dd0d330322361fa161c88878878"},"schema_version":"1.0","source":{"id":"1408.1616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.1616","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.1616v1","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.1616","created_at":"2026-05-18T02:45:40Z"},{"alias_kind":"pith_short_12","alias_value":"GFHJPKP3TVPV","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GFHJPKP3TVPVV5PS","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GFHJPKP3","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:d46eac9939f164ce39c5be644900764e99153017c666b2d4ee697adfdd7a53b9","target":"graph","created_at":"2026-05-18T02:45:40Z","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 present several families of graphs that allow both efficient quantum walk implementations and efficient quantum walk based search algorithms. For these graphs, we construct quantum circuits that explicitly implement the full quantum walk search algorithm, without reference to a `black box' oracle. These circuits provide a practically implementable method to explore quantum walk based search algorithms with the aim of eventual real-world applications. We also provide a numerical analysis of a quantum walk based search along a twisted toroid family of graphs, which requires O($\\sqrt{n}$ log($","authors_text":"B. L. Douglas, J. B. Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-08-07T15:04:37Z","title":"Complexity analysis of quantum walk based search algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1616","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:ce07894e0486cf78791f545642bab9b8b8a5eeb7de39b1e1a5906938236c9480","target":"record","created_at":"2026-05-18T02:45:40Z","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":"0c1210c9df22bc542250449523ea18d2e480d45788ca4c42e7564e060d511a60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-08-07T15:04:37Z","title_canon_sha256":"0606c5ff1577e05ca7a12c6c4d1eecbe2b069dd0d330322361fa161c88878878"},"schema_version":"1.0","source":{"id":"1408.1616","kind":"arxiv","version":1}},"canonical_sha256":"314e97a9fb9d5f5af5f2475e35ebbd09a436310d10a477fbb5448d766e635bbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"314e97a9fb9d5f5af5f2475e35ebbd09a436310d10a477fbb5448d766e635bbc","first_computed_at":"2026-05-18T02:45:40.063747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:40.063747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CwDolJ0Rqe5igN0ZGd1lFy36K/Hu+xf864JoA95pEYv/g2YMl6SdOlNHxTeYadzCwI6S6sze57rfaDWZjFJBAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:40.064244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.1616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce07894e0486cf78791f545642bab9b8b8a5eeb7de39b1e1a5906938236c9480","sha256:d46eac9939f164ce39c5be644900764e99153017c666b2d4ee697adfdd7a53b9"],"state_sha256":"97006cd7ee38c55ef9565946757d957893b84fff988090c147322031248153bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L169wY/mGLJuLDP19W6+MpEdc7PmL8pNrVg4Q1IzYL27pnB+PDgFyNE61C8pmD7rfYm0jFqCF5xLP64ch/RwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:00:00.916379Z","bundle_sha256":"a8fe0f7947280f695187641be6e673dbcfaef57c8078dbc2c062c14bc9abcaa6"}}