{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y6UTWCCNSHG5UGO3OEVQO5IBFY","short_pith_number":"pith:Y6UTWCCN","canonical_record":{"source":{"id":"1710.04046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-11T13:04:05Z","cross_cats_sorted":[],"title_canon_sha256":"c84847a4dcda7570a96a877e7e7382bcd955f0c85a98a6e0f9baec3a260d3355","abstract_canon_sha256":"ebd18edb9451fac60a214109293382aed2bbe3c7d4925891c3fc11197b74c298"},"schema_version":"1.0"},"canonical_sha256":"c7a93b084d91cdda19db712b0775012e140a6a9ab8eec51d40b88298a437f942","source":{"kind":"arxiv","id":"1710.04046","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04046","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04046v2","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04046","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"pith_short_12","alias_value":"Y6UTWCCNSHG5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y6UTWCCNSHG5UGO3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y6UTWCCN","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y6UTWCCNSHG5UGO3OEVQO5IBFY","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-11T13:04:05Z","cross_cats_sorted":[],"title_canon_sha256":"c84847a4dcda7570a96a877e7e7382bcd955f0c85a98a6e0f9baec3a260d3355","abstract_canon_sha256":"ebd18edb9451fac60a214109293382aed2bbe3c7d4925891c3fc11197b74c298"},"schema_version":"1.0"},"canonical_sha256":"c7a93b084d91cdda19db712b0775012e140a6a9ab8eec51d40b88298a437f942","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:08.588380Z","signature_b64":"tQLkNI71YSUBHAAkqIn3ZS5UBapuWIuImdJPqvH4hiYGrG6hJag/BgLXPYjyYDCOkmDUEuaAx+WuXEmrBHuDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7a93b084d91cdda19db712b0775012e140a6a9ab8eec51d40b88298a437f942","last_reissued_at":"2026-05-18T00:16:08.587689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:08.587689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04046","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:16:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AWO3FkyRGmudWDkaL6rkj5vuiiAY+H7nw5QK4/tsSdnPBlnW8wGpMTWPLN2Wukk5AJ7SY40VZWI8yNFHvceDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:41:23.963217Z"},"content_sha256":"cd8055d32a73465e7e5f8a64c00b72269923b9bf8f1a170dad8b9b0e28553fbb","schema_version":"1.0","event_id":"sha256:cd8055d32a73465e7e5f8a64c00b72269923b9bf8f1a170dad8b9b0e28553fbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y6UTWCCNSHG5UGO3OEVQO5IBFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the probability of finding marked connected components using quantum walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kamil Khadiev, Nikolajs Nahimovs, Raqueline A. M. Santos","submitted_at":"2017-10-11T13:04:05Z","abstract_excerpt":"Finding a marked vertex in a graph can be a complicated task when using quantum walks. Recent results show that for two or more adjacent marked vertices search by quantum walk with Grover's coin may have no speed-up over classical exhaustive search. In this paper, we analyze the probability of finding a marked vertex for a set of connected components of marked vertices. We prove two upper bounds on the probability of finding a marked vertex and sketch further research directions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04046","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:16:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZcFCrPzvkLNN05joJfx5OpeJIFRc7zi6+K/8K2PR1nyEBpziGBjlqQNCp7oTvfyVvAmDPw4PtnUCFK07Jp1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:41:23.963579Z"},"content_sha256":"f071cd8f39624a887163c5183800222c8d5d64c8b752a73619074652ed341ae4","schema_version":"1.0","event_id":"sha256:f071cd8f39624a887163c5183800222c8d5d64c8b752a73619074652ed341ae4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6UTWCCNSHG5UGO3OEVQO5IBFY/bundle.json","state_url":"https://pith.science/pith/Y6UTWCCNSHG5UGO3OEVQO5IBFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6UTWCCNSHG5UGO3OEVQO5IBFY/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-08T13:41:23Z","links":{"resolver":"https://pith.science/pith/Y6UTWCCNSHG5UGO3OEVQO5IBFY","bundle":"https://pith.science/pith/Y6UTWCCNSHG5UGO3OEVQO5IBFY/bundle.json","state":"https://pith.science/pith/Y6UTWCCNSHG5UGO3OEVQO5IBFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6UTWCCNSHG5UGO3OEVQO5IBFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y6UTWCCNSHG5UGO3OEVQO5IBFY","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":"ebd18edb9451fac60a214109293382aed2bbe3c7d4925891c3fc11197b74c298","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-11T13:04:05Z","title_canon_sha256":"c84847a4dcda7570a96a877e7e7382bcd955f0c85a98a6e0f9baec3a260d3355"},"schema_version":"1.0","source":{"id":"1710.04046","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04046","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04046v2","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04046","created_at":"2026-05-18T00:16:08Z"},{"alias_kind":"pith_short_12","alias_value":"Y6UTWCCNSHG5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y6UTWCCNSHG5UGO3","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y6UTWCCN","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:f071cd8f39624a887163c5183800222c8d5d64c8b752a73619074652ed341ae4","target":"graph","created_at":"2026-05-18T00:16:08Z","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":"Finding a marked vertex in a graph can be a complicated task when using quantum walks. Recent results show that for two or more adjacent marked vertices search by quantum walk with Grover's coin may have no speed-up over classical exhaustive search. In this paper, we analyze the probability of finding a marked vertex for a set of connected components of marked vertices. We prove two upper bounds on the probability of finding a marked vertex and sketch further research directions.","authors_text":"Kamil Khadiev, Nikolajs Nahimovs, Raqueline A. M. Santos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-11T13:04:05Z","title":"On the probability of finding marked connected components using quantum walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04046","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:cd8055d32a73465e7e5f8a64c00b72269923b9bf8f1a170dad8b9b0e28553fbb","target":"record","created_at":"2026-05-18T00:16:08Z","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":"ebd18edb9451fac60a214109293382aed2bbe3c7d4925891c3fc11197b74c298","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-11T13:04:05Z","title_canon_sha256":"c84847a4dcda7570a96a877e7e7382bcd955f0c85a98a6e0f9baec3a260d3355"},"schema_version":"1.0","source":{"id":"1710.04046","kind":"arxiv","version":2}},"canonical_sha256":"c7a93b084d91cdda19db712b0775012e140a6a9ab8eec51d40b88298a437f942","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7a93b084d91cdda19db712b0775012e140a6a9ab8eec51d40b88298a437f942","first_computed_at":"2026-05-18T00:16:08.587689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:08.587689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQLkNI71YSUBHAAkqIn3ZS5UBapuWIuImdJPqvH4hiYGrG6hJag/BgLXPYjyYDCOkmDUEuaAx+WuXEmrBHuDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:08.588380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04046","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd8055d32a73465e7e5f8a64c00b72269923b9bf8f1a170dad8b9b0e28553fbb","sha256:f071cd8f39624a887163c5183800222c8d5d64c8b752a73619074652ed341ae4"],"state_sha256":"8d141dc23d1ae25d34361a2b947433520123e473ec5fb3325a78d08a4fa95aa0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfHs0Mkh+SyAgGhrCjSqTdiPVFPIPnh8270aPdfC/SyD9LeSnHEwd3TKw9S8jDODnquAzsMdU55fcJWP73+NAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:41:23.965705Z","bundle_sha256":"a7b6e045ff9b82641bf764c2a4b1f11d7ee3aa7cbc7c449c30361e82cdee6531"}}