{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:25EZIVYLBQIIBQFORUFVTA5HBG","short_pith_number":"pith:25EZIVYL","schema_version":"1.0","canonical_sha256":"d74994570b0c1080c0ae8d0b5983a7098b52fd42fed9501e6f2e1e87a3a244f2","source":{"kind":"arxiv","id":"1107.1940","version":1},"attestation_state":"computed","paper":{"title":"Multi-query quantum sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"2) ((1) Mathematics Department, (2) Mathematics Department, David A. Meyer (1), James Pommersheim (1, Reed), UCSD","submitted_at":"2011-07-11T05:55:09Z","abstract_excerpt":"PARITY is the problem of determining the parity of a string $f$ of $n$ bits given access to an oracle that responds to a query $x\\in\\{0,1,...,n-1\\}$ with the $x^{\\rm th}$ bit of the string, $f(x)$. Classically, $n$ queries are required to succeed with probability greater than 1/2 (assuming equal prior probabilities for all length $n$ bitstrings), but only $\\lceil n/2\\rceil$ quantum queries suffice to determine the parity with probability 1. We consider a generalization to strings $f$ of $n$ elements of $\\Z_k$ and the problem of determining $\\sum f(x)$. By constructing an explicit algorithm, we"},"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":"1107.1940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-07-11T05:55:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0fbe0bfb6976b6e38fde60e74fb209f53f24ce42b0babf6225358f0fb8e1f870","abstract_canon_sha256":"7ff8ba489990c7f4a95d62da543458a98c888d4c43fd1295bd93a360c920e0a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:33.821299Z","signature_b64":"ss4gjKk0hjkdwYGwH0f2cHHGiy9QpmdpbpWekX0kAjkjLHgrso43/CsCdrB4jxY3bQ9z5eeboR5oAp0vdQ0NDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d74994570b0c1080c0ae8d0b5983a7098b52fd42fed9501e6f2e1e87a3a244f2","last_reissued_at":"2026-05-18T04:18:33.820746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:33.820746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-query quantum sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"2) ((1) Mathematics Department, (2) Mathematics Department, David A. Meyer (1), James Pommersheim (1, Reed), UCSD","submitted_at":"2011-07-11T05:55:09Z","abstract_excerpt":"PARITY is the problem of determining the parity of a string $f$ of $n$ bits given access to an oracle that responds to a query $x\\in\\{0,1,...,n-1\\}$ with the $x^{\\rm th}$ bit of the string, $f(x)$. Classically, $n$ queries are required to succeed with probability greater than 1/2 (assuming equal prior probabilities for all length $n$ bitstrings), but only $\\lceil n/2\\rceil$ quantum queries suffice to determine the parity with probability 1. We consider a generalization to strings $f$ of $n$ elements of $\\Z_k$ and the problem of determining $\\sum f(x)$. By constructing an explicit algorithm, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1940","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":"1107.1940","created_at":"2026-05-18T04:18:33.820849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1940v1","created_at":"2026-05-18T04:18:33.820849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1940","created_at":"2026-05-18T04:18:33.820849+00:00"},{"alias_kind":"pith_short_12","alias_value":"25EZIVYLBQII","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"25EZIVYLBQIIBQFO","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"25EZIVYL","created_at":"2026-05-18T12:26:18.847500+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/25EZIVYLBQIIBQFORUFVTA5HBG","json":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG.json","graph_json":"https://pith.science/api/pith-number/25EZIVYLBQIIBQFORUFVTA5HBG/graph.json","events_json":"https://pith.science/api/pith-number/25EZIVYLBQIIBQFORUFVTA5HBG/events.json","paper":"https://pith.science/paper/25EZIVYL"},"agent_actions":{"view_html":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG","download_json":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG.json","view_paper":"https://pith.science/paper/25EZIVYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1940&json=true","fetch_graph":"https://pith.science/api/pith-number/25EZIVYLBQIIBQFORUFVTA5HBG/graph.json","fetch_events":"https://pith.science/api/pith-number/25EZIVYLBQIIBQFORUFVTA5HBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG/action/storage_attestation","attest_author":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG/action/author_attestation","sign_citation":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG/action/citation_signature","submit_replication":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG/action/replication_record"}},"created_at":"2026-05-18T04:18:33.820849+00:00","updated_at":"2026-05-18T04:18:33.820849+00:00"}