{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:F2TKRF2DVUIKXW3PY2WSYGLGGK","short_pith_number":"pith:F2TKRF2D","schema_version":"1.0","canonical_sha256":"2ea6a89743ad10abdb6fc6ad2c1966328cd3148532568c31c62bd3d9f89af426","source":{"kind":"arxiv","id":"1302.3143","version":1},"attestation_state":"computed","paper":{"title":"Quantum Walks and Electric Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs","submitted_at":"2013-02-13T15:44:34Z","abstract_excerpt":"We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective resistance. This generalizes the result by Szegedy that is only applicable if the initial distribution is stationary. We describe a time-efficient quantum algorithm for 3-distinctness based on these ideas."},"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":"1302.3143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-13T15:44:34Z","cross_cats_sorted":[],"title_canon_sha256":"a9b93cd8f93e7c108553bab05409a1725363cea12ba7155255121dcc9b1e0134","abstract_canon_sha256":"e70aa2a7f3a45d5445fe594573e138daa0e0c6403016d7845ad6db04b7eecf6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:48.586519Z","signature_b64":"ZIvbF83IE6Av/S5qqlbl4xfxpvhc80KdHU3u6SBA+9vcYrErrrRd7ebOKeTc50Q/05CPzMRIps6Qw16Br+cUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea6a89743ad10abdb6fc6ad2c1966328cd3148532568c31c62bd3d9f89af426","last_reissued_at":"2026-05-18T03:33:48.585689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:48.585689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Walks and Electric Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs","submitted_at":"2013-02-13T15:44:34Z","abstract_excerpt":"We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective resistance. This generalizes the result by Szegedy that is only applicable if the initial distribution is stationary. We describe a time-efficient quantum algorithm for 3-distinctness based on these ideas."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3143","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.3143","created_at":"2026-05-18T03:33:48.585838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3143v1","created_at":"2026-05-18T03:33:48.585838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3143","created_at":"2026-05-18T03:33:48.585838+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2TKRF2DVUIK","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2TKRF2DVUIKXW3P","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2TKRF2D","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F2TKRF2DVUIKXW3PY2WSYGLGGK","json":"https://pith.science/pith/F2TKRF2DVUIKXW3PY2WSYGLGGK.json","graph_json":"https://pith.science/api/pith-number/F2TKRF2DVUIKXW3PY2WSYGLGGK/graph.json","events_json":"https://pith.science/api/pith-number/F2TKRF2DVUIKXW3PY2WSYGLGGK/events.json","paper":"https://pith.science/paper/F2TKRF2D"},"agent_actions":{"view_html":"https://pith.science/pith/F2TKRF2DVUIKXW3PY2WSYGLGGK","download_json":"https://pith.science/pith/F2TKRF2DVUIKXW3PY2WSYGLGGK.json","view_paper":"https://pith.science/paper/F2TKRF2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3143&json=true","fetch_graph":"https://pith.science/api/pith-number/F2TKRF2DVUIKXW3PY2WSYGLGGK/graph.json","fetch_events":"https://pith.science/api/pith-number/F2TKRF2DVUIKXW3PY2WSYGLGGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2TKRF2DVUIKXW3PY2WSYGLGGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2TKRF2DVUIKXW3PY2WSYGLGGK/action/storage_attestation","attest_author":"https://pith.science/pith/F2TKRF2DVUIKXW3PY2WSYGLGGK/action/author_attestation","sign_citation":"https://pith.science/pith/F2TKRF2DVUIKXW3PY2WSYGLGGK/action/citation_signature","submit_replication":"https://pith.science/pith/F2TKRF2DVUIKXW3PY2WSYGLGGK/action/replication_record"}},"created_at":"2026-05-18T03:33:48.585838+00:00","updated_at":"2026-05-18T03:33:48.585838+00:00"}