{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HWZKA3PXEZCVZBQVVHPOKICIJW","short_pith_number":"pith:HWZKA3PX","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"},"canonical_sha256":"3db2a06df726455c8615a9dee520484da929059efb5a8e8773c9d008d83a8ae7","source":{"kind":"arxiv","id":"1302.1235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1235","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1235v1","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1235","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"HWZKA3PXEZCV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HWZKA3PXEZCVZBQV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HWZKA3PX","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HWZKA3PXEZCVZBQVVHPOKICIJW","target":"record","payload":{"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"},"canonical_sha256":"3db2a06df726455c8615a9dee520484da929059efb5a8e8773c9d008d83a8ae7","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"},"source_kind":"arxiv","source_id":"1302.1235","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTIgoIBUa2QhOpHX0YboFHnAyv7of4TkFpfYQTlcCtz6mcSG6a96OFcKWzgfdp7JapEPnKDIMlCFsk59eVgnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:58:04.408862Z"},"content_sha256":"0d34673b4b8cc6f76a619de8b055afd8c6d599d03d0d19510e31b4e6386843c9","schema_version":"1.0","event_id":"sha256:0d34673b4b8cc6f76a619de8b055afd8c6d599d03d0d19510e31b4e6386843c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HWZKA3PXEZCVZBQVVHPOKICIJW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Obc2ohBLfDDnBE+bMgIC/K/AcDN/QPTUyAjcID2GuO7cKr+8xcvxiab84RKhobN0MDlgT3eH356SIEmeHyAtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:58:04.409211Z"},"content_sha256":"20ebaa09f271820242dfe0480f0187ad7e2e67876d00816ece6aeac34cba862b","schema_version":"1.0","event_id":"sha256:20ebaa09f271820242dfe0480f0187ad7e2e67876d00816ece6aeac34cba862b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/bundle.json","state_url":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T02:58:04Z","links":{"resolver":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW","bundle":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/bundle.json","state":"https://pith.science/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWZKA3PXEZCVZBQVVHPOKICIJW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HWZKA3PXEZCVZBQVVHPOKICIJW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"009ae42a6be0c0b87cde5629a67c9085a98edabcb0c6336f1d47df7003b9291d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-06T00:22:56Z","title_canon_sha256":"45b166345bb591bc1c91ac660f372d893a88682d179c850d41e6df9871a81c22"},"schema_version":"1.0","source":{"id":"1302.1235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1235","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1235v1","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1235","created_at":"2026-05-18T03:34:24Z"},{"alias_kind":"pith_short_12","alias_value":"HWZKA3PXEZCV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HWZKA3PXEZCVZBQV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HWZKA3PX","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:20ebaa09f271820242dfe0480f0187ad7e2e67876d00816ece6aeac34cba862b","target":"graph","created_at":"2026-05-18T03:34:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Andris Ambainis, J\\=anis Iraids, Juris Smotrovs","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-06T00:22:56Z","title":"Exact quantum query complexity of EXACT and THRESHOLD"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1235","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d34673b4b8cc6f76a619de8b055afd8c6d599d03d0d19510e31b4e6386843c9","target":"record","created_at":"2026-05-18T03:34:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"009ae42a6be0c0b87cde5629a67c9085a98edabcb0c6336f1d47df7003b9291d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-06T00:22:56Z","title_canon_sha256":"45b166345bb591bc1c91ac660f372d893a88682d179c850d41e6df9871a81c22"},"schema_version":"1.0","source":{"id":"1302.1235","kind":"arxiv","version":1}},"canonical_sha256":"3db2a06df726455c8615a9dee520484da929059efb5a8e8773c9d008d83a8ae7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3db2a06df726455c8615a9dee520484da929059efb5a8e8773c9d008d83a8ae7","first_computed_at":"2026-05-18T03:34:24.803709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:24.803709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bCy5hK4jrlI+QeABqci3UxnDwTkXy18HsIFnnVV5CXR7m0qsvGuVadCBLtSf4DgZ65H+2OfKxZtUBOHqn8dTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:24.804351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d34673b4b8cc6f76a619de8b055afd8c6d599d03d0d19510e31b4e6386843c9","sha256:20ebaa09f271820242dfe0480f0187ad7e2e67876d00816ece6aeac34cba862b"],"state_sha256":"3a9c631aff16ea849b2107a0e26778785e655a28c08c25e91091e7063eb211d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+rt22KzcAaStreqBJMq7s8EPszpYPFMZNuOt6aSgwS9TvdEeJeWE8wC0xNp1UNfb13oj7laOCOcuGCFv3dqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:58:04.411435Z","bundle_sha256":"fa11f03abbc56fcec3a5fde1d419f84149d082d73a9f789118f3bfbf18b86673"}}