{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6MKFKJ7TWMEXNCOB544L4ONJNE","short_pith_number":"pith:6MKFKJ7T","schema_version":"1.0","canonical_sha256":"f3145527f3b3097689c1ef38be39a969338ea31dbb59b236f454452dd921ddb3","source":{"kind":"arxiv","id":"1608.02374","version":2},"attestation_state":"computed","paper":{"title":"Exact quantum query complexity of $\\rm{EXACT}_{k,l}^n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Daniel Nagaj, J\\=anis Iraids","submitted_at":"2016-08-08T10:34:45Z","abstract_excerpt":"In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly $k$ or $l$ of the $n$ input bits given by an oracle are 1. We find an optimal algorithm (for some cases), and a nontrivial general lower and upper bound on the minimum number of queries to the black box."},"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":"1608.02374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-08T10:34:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1615ba1e74cd3069448e6ce3afa48df82097388f2e55f9d87390277fb1c3232c","abstract_canon_sha256":"2a9bf5ac6ac12637ac0ef23b5950f34795d4e425744ad6669a7b18da086747a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:18.519929Z","signature_b64":"HX9Y4nxoCu25EsLxcM7gc9Z32VEQ8/oJtcWH7ay2BvS35JIaYLnbtQVA0IYXBY9Pt72LgzIFNGDvEI2Il1dgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3145527f3b3097689c1ef38be39a969338ea31dbb59b236f454452dd921ddb3","last_reissued_at":"2026-05-18T00:26:18.519423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:18.519423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact quantum query complexity of $\\rm{EXACT}_{k,l}^n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Daniel Nagaj, J\\=anis Iraids","submitted_at":"2016-08-08T10:34:45Z","abstract_excerpt":"In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly $k$ or $l$ of the $n$ input bits given by an oracle are 1. We find an optimal algorithm (for some cases), and a nontrivial general lower and upper bound on the minimum number of queries to the black box."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.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":"1608.02374","created_at":"2026-05-18T00:26:18.519496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.02374v2","created_at":"2026-05-18T00:26:18.519496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02374","created_at":"2026-05-18T00:26:18.519496+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MKFKJ7TWMEX","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MKFKJ7TWMEXNCOB","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MKFKJ7T","created_at":"2026-05-18T12:30:01.593930+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/6MKFKJ7TWMEXNCOB544L4ONJNE","json":"https://pith.science/pith/6MKFKJ7TWMEXNCOB544L4ONJNE.json","graph_json":"https://pith.science/api/pith-number/6MKFKJ7TWMEXNCOB544L4ONJNE/graph.json","events_json":"https://pith.science/api/pith-number/6MKFKJ7TWMEXNCOB544L4ONJNE/events.json","paper":"https://pith.science/paper/6MKFKJ7T"},"agent_actions":{"view_html":"https://pith.science/pith/6MKFKJ7TWMEXNCOB544L4ONJNE","download_json":"https://pith.science/pith/6MKFKJ7TWMEXNCOB544L4ONJNE.json","view_paper":"https://pith.science/paper/6MKFKJ7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.02374&json=true","fetch_graph":"https://pith.science/api/pith-number/6MKFKJ7TWMEXNCOB544L4ONJNE/graph.json","fetch_events":"https://pith.science/api/pith-number/6MKFKJ7TWMEXNCOB544L4ONJNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MKFKJ7TWMEXNCOB544L4ONJNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MKFKJ7TWMEXNCOB544L4ONJNE/action/storage_attestation","attest_author":"https://pith.science/pith/6MKFKJ7TWMEXNCOB544L4ONJNE/action/author_attestation","sign_citation":"https://pith.science/pith/6MKFKJ7TWMEXNCOB544L4ONJNE/action/citation_signature","submit_replication":"https://pith.science/pith/6MKFKJ7TWMEXNCOB544L4ONJNE/action/replication_record"}},"created_at":"2026-05-18T00:26:18.519496+00:00","updated_at":"2026-05-18T00:26:18.519496+00:00"}