{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HFYTRZAUA4DUYDUKCT7FDOVNIV","short_pith_number":"pith:HFYTRZAU","canonical_record":{"source":{"id":"1903.07493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-18T14:59:57Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"9187a2a0a24d6975f691a8f58cf3e0e02e53b51a461a5cd6921ba73546419863","abstract_canon_sha256":"aa033566fba4d7830b220e9576ae8386d6bdd99d2bb7ffa6894929c268f2688b"},"schema_version":"1.0"},"canonical_sha256":"397138e41407074c0e8a14fe51baad45599627b96291cbfc436fc545a04356c6","source":{"kind":"arxiv","id":"1903.07493","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07493","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07493v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07493","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"HFYTRZAUA4DU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HFYTRZAUA4DUYDUK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HFYTRZAU","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HFYTRZAUA4DUYDUKCT7FDOVNIV","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-18T14:59:57Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"9187a2a0a24d6975f691a8f58cf3e0e02e53b51a461a5cd6921ba73546419863","abstract_canon_sha256":"aa033566fba4d7830b220e9576ae8386d6bdd99d2bb7ffa6894929c268f2688b"},"schema_version":"1.0"},"canonical_sha256":"397138e41407074c0e8a14fe51baad45599627b96291cbfc436fc545a04356c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:01.262071Z","signature_b64":"DYUIqtimEwZFqgGcFLdfxYbLm7Rnu3eVesMTXmXx8PHhUEoyR2dV+G5YB+gqpnu9pLtEo+eDksx3w6sAtfllBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"397138e41407074c0e8a14fe51baad45599627b96291cbfc436fc545a04356c6","last_reissued_at":"2026-05-17T23:51:01.261581Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:01.261581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07493","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lrjl++6Xo1bbJjDSCxx37axq22gUv7KHmqzQ5eqJNUYhIxX//dOZhGTpw6xeYFRJJJWZHXe1x9TOa/bWRhtIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:03:31.905982Z"},"content_sha256":"fafd62ca49088ff89707fbb16b9f7caf50a7a039c58b36a71ef4a457c723bd8f","schema_version":"1.0","event_id":"sha256:fafd62ca49088ff89707fbb16b9f7caf50a7a039c58b36a71ef4a457c723bd8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HFYTRZAUA4DUYDUKCT7FDOVNIV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratic speedup for finding marked vertices by quantum walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Andris Ambainis, Martins Kokainis, Stacey Jeffery","submitted_at":"2019-03-18T14:59:57Z","abstract_excerpt":"A quantum walk algorithm can detect the presence of a marked vertex on a graph quadratically faster than the corresponding random walk algorithm (Szegedy, FOCS 2004). However, quantum algorithms that actually find a marked element quadratically faster than a classical random walk were only known for the special case when the marked set consists of just a single vertex, or in the case of some specific graphs. We present a new quantum algorithm for finding a marked vertex in any graph, with any set of marked vertices, that is (up to a log factor) quadratically faster than the corresponding class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07493","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nlDzvo8oA3baQwmO5KLUWEDgrziEYl70ZOvrFzwTbWnFXhhApawzYxWzM3GhOhFdYz/tN0bJXS99ImZaRRmMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:03:31.906583Z"},"content_sha256":"9a6003d3b4554dc491e9764a392ec0412db1f5afa870adf94d579050b8f4ac8f","schema_version":"1.0","event_id":"sha256:9a6003d3b4554dc491e9764a392ec0412db1f5afa870adf94d579050b8f4ac8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFYTRZAUA4DUYDUKCT7FDOVNIV/bundle.json","state_url":"https://pith.science/pith/HFYTRZAUA4DUYDUKCT7FDOVNIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFYTRZAUA4DUYDUKCT7FDOVNIV/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-27T10:03:31Z","links":{"resolver":"https://pith.science/pith/HFYTRZAUA4DUYDUKCT7FDOVNIV","bundle":"https://pith.science/pith/HFYTRZAUA4DUYDUKCT7FDOVNIV/bundle.json","state":"https://pith.science/pith/HFYTRZAUA4DUYDUKCT7FDOVNIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFYTRZAUA4DUYDUKCT7FDOVNIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HFYTRZAUA4DUYDUKCT7FDOVNIV","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":"aa033566fba4d7830b220e9576ae8386d6bdd99d2bb7ffa6894929c268f2688b","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-18T14:59:57Z","title_canon_sha256":"9187a2a0a24d6975f691a8f58cf3e0e02e53b51a461a5cd6921ba73546419863"},"schema_version":"1.0","source":{"id":"1903.07493","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07493","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07493v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07493","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"HFYTRZAUA4DU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HFYTRZAUA4DUYDUK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HFYTRZAU","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:9a6003d3b4554dc491e9764a392ec0412db1f5afa870adf94d579050b8f4ac8f","target":"graph","created_at":"2026-05-17T23:51:01Z","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":"A quantum walk algorithm can detect the presence of a marked vertex on a graph quadratically faster than the corresponding random walk algorithm (Szegedy, FOCS 2004). However, quantum algorithms that actually find a marked element quadratically faster than a classical random walk were only known for the special case when the marked set consists of just a single vertex, or in the case of some specific graphs. We present a new quantum algorithm for finding a marked vertex in any graph, with any set of marked vertices, that is (up to a log factor) quadratically faster than the corresponding class","authors_text":"Andr\\'as Gily\\'en, Andris Ambainis, Martins Kokainis, Stacey Jeffery","cross_cats":["cs.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-18T14:59:57Z","title":"Quadratic speedup for finding marked vertices by quantum walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07493","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:fafd62ca49088ff89707fbb16b9f7caf50a7a039c58b36a71ef4a457c723bd8f","target":"record","created_at":"2026-05-17T23:51:01Z","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":"aa033566fba4d7830b220e9576ae8386d6bdd99d2bb7ffa6894929c268f2688b","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-18T14:59:57Z","title_canon_sha256":"9187a2a0a24d6975f691a8f58cf3e0e02e53b51a461a5cd6921ba73546419863"},"schema_version":"1.0","source":{"id":"1903.07493","kind":"arxiv","version":1}},"canonical_sha256":"397138e41407074c0e8a14fe51baad45599627b96291cbfc436fc545a04356c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"397138e41407074c0e8a14fe51baad45599627b96291cbfc436fc545a04356c6","first_computed_at":"2026-05-17T23:51:01.261581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:01.261581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DYUIqtimEwZFqgGcFLdfxYbLm7Rnu3eVesMTXmXx8PHhUEoyR2dV+G5YB+gqpnu9pLtEo+eDksx3w6sAtfllBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:01.262071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07493","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fafd62ca49088ff89707fbb16b9f7caf50a7a039c58b36a71ef4a457c723bd8f","sha256:9a6003d3b4554dc491e9764a392ec0412db1f5afa870adf94d579050b8f4ac8f"],"state_sha256":"19c4f4142fb0b43f967f3543c1af37805f579355fcf459d8b10bd4727c430b07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hEfkQX8xzOYNHcaUtP1ikGTLP2aeH4oA4V2gVzvZNKi2h8KULt4xpC4Pbf5PR6Dr9Vu7eNP9lPV4FZmQVtqfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:03:31.910638Z","bundle_sha256":"89904924062f50b3a31392b613fb588a828d906b892604eec9998e39ce5dca64"}}