{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GXOGFYN7DZK2KUPVUAIKXKOBUX","short_pith_number":"pith:GXOGFYN7","schema_version":"1.0","canonical_sha256":"35dc62e1bf1e55a551f5a010aba9c1a5c8c75efbc95da6c62f3615c9bec7fc31","source":{"kind":"arxiv","id":"1912.04196","version":1},"attestation_state":"computed","paper":{"title":"Quantum walk search algorithms and effective resistance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stephen Piddock","submitted_at":"2019-12-09T17:22:18Z","abstract_excerpt":"We consider the problem of finding a marked vertex in a graph from an arbitrary starting distribution, using a quantum walk based algorithm. We work in the framework introduced by Belovs which showed how to detect the existence of a marked vertex in $O(\\sqrt{RW})$ quantum walk steps, where $R$ is the effective resistance and $W$ is the total weight of the graph. Our algorithm outputs a marked vertex in the same runtime up to a logarithmic factor in the number of marked vertices. When starting in the stationary distribution, this recovers the recent results of Ambainis et al. We also describe a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1912.04196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-12-09T17:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"cd0bab265e9d4d337c99c92df0926d9a6700e032ca8c8e2bd46bd12555e5f34b","abstract_canon_sha256":"5f17f98906898683c2ba69954a3e26eaa6a0b2a5c535bc32d93117997c849b31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:24:52.635742Z","signature_b64":"qdSCaXoaNxiI7bi/iakj+Q8sypjHuwXMwWyaIegg0fxErFrRs2XgxURwr7vI1GFOVoTJrSDCYDR5az6RwSKMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35dc62e1bf1e55a551f5a010aba9c1a5c8c75efbc95da6c62f3615c9bec7fc31","last_reissued_at":"2026-07-05T00:24:52.635351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:24:52.635351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum walk search algorithms and effective resistance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stephen Piddock","submitted_at":"2019-12-09T17:22:18Z","abstract_excerpt":"We consider the problem of finding a marked vertex in a graph from an arbitrary starting distribution, using a quantum walk based algorithm. We work in the framework introduced by Belovs which showed how to detect the existence of a marked vertex in $O(\\sqrt{RW})$ quantum walk steps, where $R$ is the effective resistance and $W$ is the total weight of the graph. Our algorithm outputs a marked vertex in the same runtime up to a logarithmic factor in the number of marked vertices. When starting in the stationary distribution, this recovers the recent results of Ambainis et al. We also describe a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.04196","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.04196/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1912.04196","created_at":"2026-07-05T00:24:52.635415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.04196v1","created_at":"2026-07-05T00:24:52.635415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.04196","created_at":"2026-07-05T00:24:52.635415+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXOGFYN7DZK2","created_at":"2026-07-05T00:24:52.635415+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXOGFYN7DZK2KUPV","created_at":"2026-07-05T00:24:52.635415+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXOGFYN7","created_at":"2026-07-05T00:24:52.635415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07890","citing_title":"Quantum Walks for Chemical Reaction Networks","ref_index":59,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXOGFYN7DZK2KUPVUAIKXKOBUX","json":"https://pith.science/pith/GXOGFYN7DZK2KUPVUAIKXKOBUX.json","graph_json":"https://pith.science/api/pith-number/GXOGFYN7DZK2KUPVUAIKXKOBUX/graph.json","events_json":"https://pith.science/api/pith-number/GXOGFYN7DZK2KUPVUAIKXKOBUX/events.json","paper":"https://pith.science/paper/GXOGFYN7"},"agent_actions":{"view_html":"https://pith.science/pith/GXOGFYN7DZK2KUPVUAIKXKOBUX","download_json":"https://pith.science/pith/GXOGFYN7DZK2KUPVUAIKXKOBUX.json","view_paper":"https://pith.science/paper/GXOGFYN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.04196&json=true","fetch_graph":"https://pith.science/api/pith-number/GXOGFYN7DZK2KUPVUAIKXKOBUX/graph.json","fetch_events":"https://pith.science/api/pith-number/GXOGFYN7DZK2KUPVUAIKXKOBUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXOGFYN7DZK2KUPVUAIKXKOBUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXOGFYN7DZK2KUPVUAIKXKOBUX/action/storage_attestation","attest_author":"https://pith.science/pith/GXOGFYN7DZK2KUPVUAIKXKOBUX/action/author_attestation","sign_citation":"https://pith.science/pith/GXOGFYN7DZK2KUPVUAIKXKOBUX/action/citation_signature","submit_replication":"https://pith.science/pith/GXOGFYN7DZK2KUPVUAIKXKOBUX/action/replication_record"}},"created_at":"2026-07-05T00:24:52.635415+00:00","updated_at":"2026-07-05T00:24:52.635415+00:00"}