{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PJGBDRTGAZT5M5GDF2ZTSAKGDC","short_pith_number":"pith:PJGBDRTG","schema_version":"1.0","canonical_sha256":"7a4c11c6660667d674c32eb339014618b6e13c5a263e2153c513141925b3db53","source":{"kind":"arxiv","id":"1807.05957","version":3},"attestation_state":"computed","paper":{"title":"Finding a marked node on any graph by continuous-time quantum walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Roland, Leonardo Novo, Shantanav Chakraborty","submitted_at":"2018-07-16T16:34:44Z","abstract_excerpt":"Spatial search by discrete-time quantum walk can find a marked node on any ergodic, reversible Markov chain $P$ quadratically faster than its classical counterpart, i.e.\\ in a time that is in the square root of the hitting time of $P$. However, in the framework of continuous-time quantum walks, it was previously unknown whether such general speed-up is possible. In fact, in this framework, the widely used quantum algorithm by Childs and Goldstone fails to achieve such a speedup. Furthermore, it is not clear how to apply this algorithm for searching any Markov chain $P$. In this article, we aim"},"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":"1807.05957","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-16T16:34:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"672791c68e9f8be797b5ab8985bd347fa9815483b86b291b41c6cd8d0dbb589f","abstract_canon_sha256":"a326798614423ddf2522bbd3e81eb5d56519b620fd686cdf381e449d9c879dc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:47.343221Z","signature_b64":"ESRR6GVhGXSYW94rWES6o4DYfFHBQdBkReKSDUm6akrYaSnwqjOHVbhh6M6TVH4JarvhwJ+AtqmQjnmvU5N6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a4c11c6660667d674c32eb339014618b6e13c5a263e2153c513141925b3db53","last_reissued_at":"2026-07-05T01:31:47.342737Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:47.342737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a marked node on any graph by continuous-time quantum walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Roland, Leonardo Novo, Shantanav Chakraborty","submitted_at":"2018-07-16T16:34:44Z","abstract_excerpt":"Spatial search by discrete-time quantum walk can find a marked node on any ergodic, reversible Markov chain $P$ quadratically faster than its classical counterpart, i.e.\\ in a time that is in the square root of the hitting time of $P$. However, in the framework of continuous-time quantum walks, it was previously unknown whether such general speed-up is possible. In fact, in this framework, the widely used quantum algorithm by Childs and Goldstone fails to achieve such a speedup. Furthermore, it is not clear how to apply this algorithm for searching any Markov chain $P$. In this article, we aim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05957","kind":"arxiv","version":3},"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/1807.05957/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":"1807.05957","created_at":"2026-07-05T01:31:47.342798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05957v3","created_at":"2026-07-05T01:31:47.342798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05957","created_at":"2026-07-05T01:31:47.342798+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJGBDRTGAZT5","created_at":"2026-07-05T01:31:47.342798+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJGBDRTGAZT5M5GD","created_at":"2026-07-05T01:31:47.342798+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJGBDRTG","created_at":"2026-07-05T01:31:47.342798+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJGBDRTGAZT5M5GDF2ZTSAKGDC","json":"https://pith.science/pith/PJGBDRTGAZT5M5GDF2ZTSAKGDC.json","graph_json":"https://pith.science/api/pith-number/PJGBDRTGAZT5M5GDF2ZTSAKGDC/graph.json","events_json":"https://pith.science/api/pith-number/PJGBDRTGAZT5M5GDF2ZTSAKGDC/events.json","paper":"https://pith.science/paper/PJGBDRTG"},"agent_actions":{"view_html":"https://pith.science/pith/PJGBDRTGAZT5M5GDF2ZTSAKGDC","download_json":"https://pith.science/pith/PJGBDRTGAZT5M5GDF2ZTSAKGDC.json","view_paper":"https://pith.science/paper/PJGBDRTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05957&json=true","fetch_graph":"https://pith.science/api/pith-number/PJGBDRTGAZT5M5GDF2ZTSAKGDC/graph.json","fetch_events":"https://pith.science/api/pith-number/PJGBDRTGAZT5M5GDF2ZTSAKGDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJGBDRTGAZT5M5GDF2ZTSAKGDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJGBDRTGAZT5M5GDF2ZTSAKGDC/action/storage_attestation","attest_author":"https://pith.science/pith/PJGBDRTGAZT5M5GDF2ZTSAKGDC/action/author_attestation","sign_citation":"https://pith.science/pith/PJGBDRTGAZT5M5GDF2ZTSAKGDC/action/citation_signature","submit_replication":"https://pith.science/pith/PJGBDRTGAZT5M5GDF2ZTSAKGDC/action/replication_record"}},"created_at":"2026-07-05T01:31:47.342798+00:00","updated_at":"2026-07-05T01:31:47.342798+00:00"}