{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NLSBL5GQW73U42BDAH54BGVUN7","short_pith_number":"pith:NLSBL5GQ","schema_version":"1.0","canonical_sha256":"6ae415f4d0b7f74e682301fbc09ab46fc779a4778c4ee7899eb12b6c8cbf36b7","source":{"kind":"arxiv","id":"1509.02374","version":2},"attestation_state":"computed","paper":{"title":"Quantum walk speedup of backtracking algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro","submitted_at":"2015-09-08T14:02:43Z","abstract_excerpt":"We describe a general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs). Backtracking algorithms explore a tree whose vertices are partial solutions to a CSP in an attempt to find a complete solution. Assume there is a classical backtracking algorithm which finds a solution to a CSP on n variables, or outputs that none exists, and whose corresponding tree contains T vertices, each vertex corresponding to a test of a partial solution. Then we show that there is a bou"},"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":"1509.02374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-09-08T14:02:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bcd090dee4fafb0a3beaf10418bd043967ac599287f46d875e775e9661bf7878","abstract_canon_sha256":"e4f9e37d6e2f87a1f9df07d4dfad730b1434014474f7bc38df1a9ee6826cf166"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:28.986182Z","signature_b64":"021o6iSsnu5UnKP2QABph2EF/R5r1IlKfcmt8lgA5UH7CEjKFcYkxip0IFjv2kazG1ZHAI/45Mgo4+oZBWC1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ae415f4d0b7f74e682301fbc09ab46fc779a4778c4ee7899eb12b6c8cbf36b7","last_reissued_at":"2026-05-18T01:23:28.985394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:28.985394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum walk speedup of backtracking algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro","submitted_at":"2015-09-08T14:02:43Z","abstract_excerpt":"We describe a general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking, a standard approach for solving constraint satisfaction problems (CSPs). Backtracking algorithms explore a tree whose vertices are partial solutions to a CSP in an attempt to find a complete solution. Assume there is a classical backtracking algorithm which finds a solution to a CSP on n variables, or outputs that none exists, and whose corresponding tree contains T vertices, each vertex corresponding to a test of a partial solution. Then we show that there is a bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02374","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.02374","created_at":"2026-05-18T01:23:28.985546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02374v2","created_at":"2026-05-18T01:23:28.985546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02374","created_at":"2026-05-18T01:23:28.985546+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLSBL5GQW73U","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLSBL5GQW73U42BD","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLSBL5GQ","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.25728","citing_title":"Q-LEAK: Quantum-Based LEAKage Verification for Side-Channel Countermeasures","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2605.25756","citing_title":"QGCL: Quantum-Guided Clause Learning for Cryptanalytic SAT","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLSBL5GQW73U42BDAH54BGVUN7","json":"https://pith.science/pith/NLSBL5GQW73U42BDAH54BGVUN7.json","graph_json":"https://pith.science/api/pith-number/NLSBL5GQW73U42BDAH54BGVUN7/graph.json","events_json":"https://pith.science/api/pith-number/NLSBL5GQW73U42BDAH54BGVUN7/events.json","paper":"https://pith.science/paper/NLSBL5GQ"},"agent_actions":{"view_html":"https://pith.science/pith/NLSBL5GQW73U42BDAH54BGVUN7","download_json":"https://pith.science/pith/NLSBL5GQW73U42BDAH54BGVUN7.json","view_paper":"https://pith.science/paper/NLSBL5GQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02374&json=true","fetch_graph":"https://pith.science/api/pith-number/NLSBL5GQW73U42BDAH54BGVUN7/graph.json","fetch_events":"https://pith.science/api/pith-number/NLSBL5GQW73U42BDAH54BGVUN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLSBL5GQW73U42BDAH54BGVUN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLSBL5GQW73U42BDAH54BGVUN7/action/storage_attestation","attest_author":"https://pith.science/pith/NLSBL5GQW73U42BDAH54BGVUN7/action/author_attestation","sign_citation":"https://pith.science/pith/NLSBL5GQW73U42BDAH54BGVUN7/action/citation_signature","submit_replication":"https://pith.science/pith/NLSBL5GQW73U42BDAH54BGVUN7/action/replication_record"}},"created_at":"2026-05-18T01:23:28.985546+00:00","updated_at":"2026-05-18T01:23:28.985546+00:00"}