{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OBUG6CGCQJ3I5WMY5P6QT7VLTY","short_pith_number":"pith:OBUG6CGC","canonical_record":{"source":{"id":"1605.05598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-18T14:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"63f6dfa4fbdeecb3ff7df691efde443c7ab862dc09530611470a7810875bc25d","abstract_canon_sha256":"47e21d927a19896efba31c92e511cdf83c09a740d9f6c885c6e4f682ba454058"},"schema_version":"1.0"},"canonical_sha256":"70686f08c282768ed998ebfd09feab9e148c054f37fbc868288e2b10f7463f2f","source":{"kind":"arxiv","id":"1605.05598","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05598","created_at":"2026-05-18T00:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05598v2","created_at":"2026-05-18T00:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05598","created_at":"2026-05-18T00:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"OBUG6CGCQJ3I","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OBUG6CGCQJ3I5WMY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OBUG6CGC","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OBUG6CGCQJ3I5WMY5P6QT7VLTY","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05598","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-18T14:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"63f6dfa4fbdeecb3ff7df691efde443c7ab862dc09530611470a7810875bc25d","abstract_canon_sha256":"47e21d927a19896efba31c92e511cdf83c09a740d9f6c885c6e4f682ba454058"},"schema_version":"1.0"},"canonical_sha256":"70686f08c282768ed998ebfd09feab9e148c054f37fbc868288e2b10f7463f2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:07.224815Z","signature_b64":"q/LfbAY2JMnA2ma+n3KbEuEtODy+vdJSYWNfF5djBUWOCziECI+bQ5Jg4T6Vf69DsAkrwnS3TdA1dB9d50sgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70686f08c282768ed998ebfd09feab9e148c054f37fbc868288e2b10f7463f2f","last_reissued_at":"2026-05-18T00:33:07.224096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:07.224096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05598","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:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cC0WAx7UEFJprHYsYd2Xm7sHwhAJMg/u90wnjkSgb70YZyDgjNiCIeGSi6LV+X2AaFoW3w+UAP2KcXiZImnmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:45:39.300839Z"},"content_sha256":"1c6078b7fc3ffefa559934f5a64079c3be825f002a653290e8f56fda0ee466db","schema_version":"1.0","event_id":"sha256:1c6078b7fc3ffefa559934f5a64079c3be825f002a653290e8f56fda0ee466db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OBUG6CGCQJ3I5WMY5P6QT7VLTY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adjacent vertices can be hard to find by quantum walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nikolajs Nahimovs, Raqueline A. M. Santos","submitted_at":"2016-05-18T14:23:21Z","abstract_excerpt":"Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element only. We show that if the search space contains more than one marked element, their placement may drastically affect the performance of the search. More specifically, we study search by quantum walks on general graphs and show a wide class of configurations of marked vertices, for which search by quantum walk needs $\\Omega(N)$ steps, that is, it has no speed-up over the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05598","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:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yxmvb/XnG7CfLv+7jvRUDaiEMWFXqFatuHd+jjfzVzjeyz8vrZEa+Irig52X7msIzmJZPchR4wkr9pch8cRcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:45:39.301180Z"},"content_sha256":"430ed96ed8b939be2183894114df94b0a113145492936e41fa3132d37cad9256","schema_version":"1.0","event_id":"sha256:430ed96ed8b939be2183894114df94b0a113145492936e41fa3132d37cad9256"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBUG6CGCQJ3I5WMY5P6QT7VLTY/bundle.json","state_url":"https://pith.science/pith/OBUG6CGCQJ3I5WMY5P6QT7VLTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBUG6CGCQJ3I5WMY5P6QT7VLTY/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-10T21:45:39Z","links":{"resolver":"https://pith.science/pith/OBUG6CGCQJ3I5WMY5P6QT7VLTY","bundle":"https://pith.science/pith/OBUG6CGCQJ3I5WMY5P6QT7VLTY/bundle.json","state":"https://pith.science/pith/OBUG6CGCQJ3I5WMY5P6QT7VLTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBUG6CGCQJ3I5WMY5P6QT7VLTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OBUG6CGCQJ3I5WMY5P6QT7VLTY","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":"47e21d927a19896efba31c92e511cdf83c09a740d9f6c885c6e4f682ba454058","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-18T14:23:21Z","title_canon_sha256":"63f6dfa4fbdeecb3ff7df691efde443c7ab862dc09530611470a7810875bc25d"},"schema_version":"1.0","source":{"id":"1605.05598","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05598","created_at":"2026-05-18T00:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05598v2","created_at":"2026-05-18T00:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05598","created_at":"2026-05-18T00:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"OBUG6CGCQJ3I","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OBUG6CGCQJ3I5WMY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OBUG6CGC","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:430ed96ed8b939be2183894114df94b0a113145492936e41fa3132d37cad9256","target":"graph","created_at":"2026-05-18T00:33:07Z","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":"Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element only. We show that if the search space contains more than one marked element, their placement may drastically affect the performance of the search. More specifically, we study search by quantum walks on general graphs and show a wide class of configurations of marked vertices, for which search by quantum walk needs $\\Omega(N)$ steps, that is, it has no speed-up over the ","authors_text":"Nikolajs Nahimovs, Raqueline A. M. Santos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-18T14:23:21Z","title":"Adjacent vertices can be hard to find by quantum walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05598","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:1c6078b7fc3ffefa559934f5a64079c3be825f002a653290e8f56fda0ee466db","target":"record","created_at":"2026-05-18T00:33:07Z","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":"47e21d927a19896efba31c92e511cdf83c09a740d9f6c885c6e4f682ba454058","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-18T14:23:21Z","title_canon_sha256":"63f6dfa4fbdeecb3ff7df691efde443c7ab862dc09530611470a7810875bc25d"},"schema_version":"1.0","source":{"id":"1605.05598","kind":"arxiv","version":2}},"canonical_sha256":"70686f08c282768ed998ebfd09feab9e148c054f37fbc868288e2b10f7463f2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70686f08c282768ed998ebfd09feab9e148c054f37fbc868288e2b10f7463f2f","first_computed_at":"2026-05-18T00:33:07.224096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:07.224096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q/LfbAY2JMnA2ma+n3KbEuEtODy+vdJSYWNfF5djBUWOCziECI+bQ5Jg4T6Vf69DsAkrwnS3TdA1dB9d50sgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:07.224815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05598","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c6078b7fc3ffefa559934f5a64079c3be825f002a653290e8f56fda0ee466db","sha256:430ed96ed8b939be2183894114df94b0a113145492936e41fa3132d37cad9256"],"state_sha256":"da78f9533b14b770fe37b49108386fbda1483956fecbac7129a587e0e7543ddd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7It+FCD9b88h4SSmOsPH9+jpO3ffgNCxJD5ld4eNbPL0SuMVJkreDr0noRGpM8xMmQwNXnd/wXYiRAfOumzQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:45:39.303038Z","bundle_sha256":"34a09d90716d9a13e09990e455afae4daf952e8e0b539f00789cf9f9429a3fd9"}}