{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GCUAWIDXUXDTDNR6IF6CTIII4N","short_pith_number":"pith:GCUAWIDX","canonical_record":{"source":{"id":"1801.01305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-04T10:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"8e8b5b3b226f55f01aa7fe11c909d4cce796dc3fd2beca74aab035b9d5ec7da5","abstract_canon_sha256":"bd5cef192196b9df127627544c5048b8eae9c46553b46bdb1799253e4086c562"},"schema_version":"1.0"},"canonical_sha256":"30a80b2077a5c731b63e417c29a108e34ca74de95a1b9becf993377a74b73c64","source":{"kind":"arxiv","id":"1801.01305","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01305","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01305v2","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01305","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"GCUAWIDXUXDT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GCUAWIDXUXDTDNR6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GCUAWIDX","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GCUAWIDXUXDTDNR6IF6CTIII4N","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-04T10:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"8e8b5b3b226f55f01aa7fe11c909d4cce796dc3fd2beca74aab035b9d5ec7da5","abstract_canon_sha256":"bd5cef192196b9df127627544c5048b8eae9c46553b46bdb1799253e4086c562"},"schema_version":"1.0"},"canonical_sha256":"30a80b2077a5c731b63e417c29a108e34ca74de95a1b9becf993377a74b73c64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:14.704676Z","signature_b64":"Aqv7KuvZh8r1C/JP/qZVylwdcketeWaWBC3XZK9Z61cpPy+drER//o1wn0LoxB2HQgj8sPr4IWB+uKIh6fsbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a80b2077a5c731b63e417c29a108e34ca74de95a1b9becf993377a74b73c64","last_reissued_at":"2026-05-17T23:58:14.704167Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:14.704167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01305","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-17T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+a8Bi+u7IYjlhRyKjqsjxKQQ/mXgk1U/ahy4SbY0xS60seOO+8v+a764Ppcrd2wbEOwnc/AnoYgiD1y1iIeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T04:19:14.668779Z"},"content_sha256":"478450aebbf7c711d7e0b4e4bf89fd253872af5a7a744ffde09e10ba341411be","schema_version":"1.0","event_id":"sha256:478450aebbf7c711d7e0b4e4bf89fd253872af5a7a744ffde09e10ba341411be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GCUAWIDXUXDTDNR6IF6CTIII4N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spatial Search on Graphs with Multiple Targets using Flip-flop Quantum Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhijith J., Apoorva Patel","submitted_at":"2018-01-04T10:58:24Z","abstract_excerpt":"We analyse the eigenvalue and eigenvector structure of the flip-flop quantum walk on regular graphs, explicitly demonstrating how it is quadratically faster than the classical random walk. Then we use it in a controlled spatial search algorithm with multiple target states, and determine the oracle complexity as a function of the spectral gap and the number of target states. The oracle complexity is optimal as a function of the graph size and the number of target states, when the spectral gap of the adjacency matrix is $\\Theta(1)$. It is also optimal for spatial search on $D>4$ dimensional hype"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01305","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-17T23:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugkt0Cr/gkdtZRWXYMKFF8gW4cfrNcxxTsJK4bQszXiwjG5vFSm0hNhOjnNjBByu/PxKfnCr3ZeQAOJ9BzJpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T04:19:14.669122Z"},"content_sha256":"8feee4fccfb739cbc137817ec3703d218abe34eb992f6d0733b263403b77107b","schema_version":"1.0","event_id":"sha256:8feee4fccfb739cbc137817ec3703d218abe34eb992f6d0733b263403b77107b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/bundle.json","state_url":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/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-12T04:19:14Z","links":{"resolver":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N","bundle":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/bundle.json","state":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GCUAWIDXUXDTDNR6IF6CTIII4N","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":"bd5cef192196b9df127627544c5048b8eae9c46553b46bdb1799253e4086c562","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-04T10:58:24Z","title_canon_sha256":"8e8b5b3b226f55f01aa7fe11c909d4cce796dc3fd2beca74aab035b9d5ec7da5"},"schema_version":"1.0","source":{"id":"1801.01305","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01305","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01305v2","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01305","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"GCUAWIDXUXDT","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GCUAWIDXUXDTDNR6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GCUAWIDX","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:8feee4fccfb739cbc137817ec3703d218abe34eb992f6d0733b263403b77107b","target":"graph","created_at":"2026-05-17T23:58:14Z","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 analyse the eigenvalue and eigenvector structure of the flip-flop quantum walk on regular graphs, explicitly demonstrating how it is quadratically faster than the classical random walk. Then we use it in a controlled spatial search algorithm with multiple target states, and determine the oracle complexity as a function of the spectral gap and the number of target states. The oracle complexity is optimal as a function of the graph size and the number of target states, when the spectral gap of the adjacency matrix is $\\Theta(1)$. It is also optimal for spatial search on $D>4$ dimensional hype","authors_text":"Abhijith J., Apoorva Patel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-04T10:58:24Z","title":"Spatial Search on Graphs with Multiple Targets using Flip-flop Quantum Walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01305","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:478450aebbf7c711d7e0b4e4bf89fd253872af5a7a744ffde09e10ba341411be","target":"record","created_at":"2026-05-17T23:58:14Z","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":"bd5cef192196b9df127627544c5048b8eae9c46553b46bdb1799253e4086c562","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-04T10:58:24Z","title_canon_sha256":"8e8b5b3b226f55f01aa7fe11c909d4cce796dc3fd2beca74aab035b9d5ec7da5"},"schema_version":"1.0","source":{"id":"1801.01305","kind":"arxiv","version":2}},"canonical_sha256":"30a80b2077a5c731b63e417c29a108e34ca74de95a1b9becf993377a74b73c64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30a80b2077a5c731b63e417c29a108e34ca74de95a1b9becf993377a74b73c64","first_computed_at":"2026-05-17T23:58:14.704167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:14.704167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aqv7KuvZh8r1C/JP/qZVylwdcketeWaWBC3XZK9Z61cpPy+drER//o1wn0LoxB2HQgj8sPr4IWB+uKIh6fsbBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:14.704676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01305","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:478450aebbf7c711d7e0b4e4bf89fd253872af5a7a744ffde09e10ba341411be","sha256:8feee4fccfb739cbc137817ec3703d218abe34eb992f6d0733b263403b77107b"],"state_sha256":"53a7a527d3334f815e0fba643ff708821f673e1b69cf7f358f5a8344503e21e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hUhIyMIPjzneK26T05ysX+h76z9kJ3LMd8q4A4gnAlJ1au2yaQjthgaHoA79stGLCG8Gicya81/f2ZGOjvhkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T04:19:14.671297Z","bundle_sha256":"eb42c7176f9d35afdce4ecf2a0fd5c083009c0de523eb4742dfabb3443feabec"}}