{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HWZKA3PXEZCVZBQVVHPOKICIJW","short_pith_number":"pith:HWZKA3PX","schema_version":"1.0","canonical_sha256":"3db2a06df726455c8615a9dee520484da929059efb5a8e8773c9d008d83a8ae7","source":{"kind":"arxiv","id":"1302.1235","version":1},"attestation_state":"computed","paper":{"title":"Exact quantum query complexity of EXACT and THRESHOLD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, J\\=anis Iraids, Juris Smotrovs","submitted_at":"2013-02-06T00:22:56Z","abstract_excerpt":"A quantum algorithm is exact if it always produces the correct answer, on any input. Coming up with exact quantum algorithms that substantially outperform the best classical algorithm has been a quite challenging task. In this paper, we present two new exact quantum algorithms for natural problems: 1) for the problem EXACT_k^n in which we have to determine whether the sequence of input bits x_1, ..., x_n contains exactly k values x_i=1; 2) for the problem THRESHOLD_k^n in which we have to determine if at least k of n input bits are equal to 1."},"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.1235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-06T00:22:56Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"45b166345bb591bc1c91ac660f372d893a88682d179c850d41e6df9871a81c22","abstract_canon_sha256":"009ae42a6be0c0b87cde5629a67c9085a98edabcb0c6336f1d47df7003b9291d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:24.804351Z","signature_b64":"bCy5hK4jrlI+QeABqci3UxnDwTkXy18HsIFnnVV5CXR7m0qsvGuVadCBLtSf4DgZ65H+2OfKxZtUBOHqn8dTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3db2a06df726455c8615a9dee520484da929059efb5a8e8773c9d008d83a8ae7","last_reissued_at":"2026-05-18T03:34:24.803709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:24.803709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact quantum query complexity of EXACT and THRESHOLD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, J\\=anis Iraids, Juris Smotrovs","submitted_at":"2013-02-06T00:22:56Z","abstract_excerpt":"A quantum algorithm is exact if it always produces the correct answer, on any input. Coming up with exact quantum algorithms that substantially outperform the best classical algorithm has been a quite challenging task. In this paper, we present two new exact quantum algorithms for natural problems: 1) for the problem EXACT_k^n in which we have to determine whether the sequence of input bits x_1, ..., x_n contains exactly k values x_i=1; 2) for the problem THRESHOLD_k^n in which we have to determine if at least k of n input bits are equal to 1."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1235","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.1235","created_at":"2026-05-18T03:34:24.803812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1235v1","created_at":"2026-05-18T03:34:24.803812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1235","created_at":"2026-05-18T03:34:24.803812+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWZKA3PXEZCV","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWZKA3PXEZCVZBQV","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWZKA3PX","created_at":"2026-05-18T12:27:46.883200+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/HWZKA3PXEZCVZBQVVHPOKICIJW","json":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW.json","graph_json":"https://pith.science/api/pith-number/HWZKA3PXEZCVZBQVVHPOKICIJW/graph.json","events_json":"https://pith.science/api/pith-number/HWZKA3PXEZCVZBQVVHPOKICIJW/events.json","paper":"https://pith.science/paper/HWZKA3PX"},"agent_actions":{"view_html":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW","download_json":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW.json","view_paper":"https://pith.science/paper/HWZKA3PX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1235&json=true","fetch_graph":"https://pith.science/api/pith-number/HWZKA3PXEZCVZBQVVHPOKICIJW/graph.json","fetch_events":"https://pith.science/api/pith-number/HWZKA3PXEZCVZBQVVHPOKICIJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/action/storage_attestation","attest_author":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/action/author_attestation","sign_citation":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/action/citation_signature","submit_replication":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/action/replication_record"}},"created_at":"2026-05-18T03:34:24.803812+00:00","updated_at":"2026-05-18T03:34:24.803812+00:00"}