{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YBYPDLNBGANNQE22DVJIPIEZBW","short_pith_number":"pith:YBYPDLNB","schema_version":"1.0","canonical_sha256":"c070f1ada1301ad8135a1d5287a0990da92b9bf5d3c8d654d92a63a96a56b9ab","source":{"kind":"arxiv","id":"1302.7316","version":1},"attestation_state":"computed","paper":{"title":"A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Frederic Magniez, Robin Kothari, Stacey Jeffery","submitted_at":"2013-02-28T20:54:56Z","abstract_excerpt":"We present an extension to the quantum walk search framework that facilitates quantum walks with nested updates. We apply it to give a quantum walk algorithm for 3-Distinctness with query complexity ~O(n^{5/7}), matching the best known upper bound (obtained via learning graphs) up to log factors. Furthermore, our algorithm has time complexity ~O(n^{5/7}), improving the previous ~O(n^{3/4})."},"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.7316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-28T20:54:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"29eefe18f65abf67ce568e260844e7c9e1a4e45c3709a02d5084515c83dce47e","abstract_canon_sha256":"d1bb81fa389d73ee46375317188526ce3ab722016dc01ca19c0e5c011096a6e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:16.225434Z","signature_b64":"nuPvojcdBQtCn3Ayw2S62SeylnH6E66IJO1V/O6dLjmpubsRg04XpYnTjRanpLqe0Zd4Ljck0Z6nkv93pG7YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c070f1ada1301ad8135a1d5287a0990da92b9bf5d3c8d654d92a63a96a56b9ab","last_reissued_at":"2026-05-18T03:32:16.224546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:16.224546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Frederic Magniez, Robin Kothari, Stacey Jeffery","submitted_at":"2013-02-28T20:54:56Z","abstract_excerpt":"We present an extension to the quantum walk search framework that facilitates quantum walks with nested updates. We apply it to give a quantum walk algorithm for 3-Distinctness with query complexity ~O(n^{5/7}), matching the best known upper bound (obtained via learning graphs) up to log factors. Furthermore, our algorithm has time complexity ~O(n^{5/7}), improving the previous ~O(n^{3/4})."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7316","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.7316","created_at":"2026-05-18T03:32:16.224677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.7316v1","created_at":"2026-05-18T03:32:16.224677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7316","created_at":"2026-05-18T03:32:16.224677+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBYPDLNBGANN","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBYPDLNBGANNQE22","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBYPDLNB","created_at":"2026-05-18T12:28:06.772260+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":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YBYPDLNBGANNQE22DVJIPIEZBW","json":"https://pith.science/pith/YBYPDLNBGANNQE22DVJIPIEZBW.json","graph_json":"https://pith.science/api/pith-number/YBYPDLNBGANNQE22DVJIPIEZBW/graph.json","events_json":"https://pith.science/api/pith-number/YBYPDLNBGANNQE22DVJIPIEZBW/events.json","paper":"https://pith.science/paper/YBYPDLNB"},"agent_actions":{"view_html":"https://pith.science/pith/YBYPDLNBGANNQE22DVJIPIEZBW","download_json":"https://pith.science/pith/YBYPDLNBGANNQE22DVJIPIEZBW.json","view_paper":"https://pith.science/paper/YBYPDLNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.7316&json=true","fetch_graph":"https://pith.science/api/pith-number/YBYPDLNBGANNQE22DVJIPIEZBW/graph.json","fetch_events":"https://pith.science/api/pith-number/YBYPDLNBGANNQE22DVJIPIEZBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBYPDLNBGANNQE22DVJIPIEZBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBYPDLNBGANNQE22DVJIPIEZBW/action/storage_attestation","attest_author":"https://pith.science/pith/YBYPDLNBGANNQE22DVJIPIEZBW/action/author_attestation","sign_citation":"https://pith.science/pith/YBYPDLNBGANNQE22DVJIPIEZBW/action/citation_signature","submit_replication":"https://pith.science/pith/YBYPDLNBGANNQE22DVJIPIEZBW/action/replication_record"}},"created_at":"2026-05-18T03:32:16.224677+00:00","updated_at":"2026-05-18T03:32:16.224677+00:00"}