{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:25EZIVYLBQIIBQFORUFVTA5HBG","short_pith_number":"pith:25EZIVYL","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"},"canonical_sha256":"d74994570b0c1080c0ae8d0b5983a7098b52fd42fed9501e6f2e1e87a3a244f2","source":{"kind":"arxiv","id":"1107.1940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1940","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1940v1","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1940","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"25EZIVYLBQII","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"25EZIVYLBQIIBQFO","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"25EZIVYL","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:25EZIVYLBQIIBQFORUFVTA5HBG","target":"record","payload":{"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"},"canonical_sha256":"d74994570b0c1080c0ae8d0b5983a7098b52fd42fed9501e6f2e1e87a3a244f2","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"},"source_kind":"arxiv","source_id":"1107.1940","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-18T04:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpMYkJKQrH6sihcQdySHjslYcUrYC8DRlVG3c2G8xL+1/9N/ggNc0SVsAAMbt7cYNKNiktWJRuGUwPeMWdRaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:10:37.616468Z"},"content_sha256":"3295336b8530ad338bd90a048661366e189f00a430f8e83f3d22ed682ec889a9","schema_version":"1.0","event_id":"sha256:3295336b8530ad338bd90a048661366e189f00a430f8e83f3d22ed682ec889a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:25EZIVYLBQIIBQFORUFVTA5HBG","target":"graph","payload":{"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"},"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-18T04:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7SLpYudqoT9StCQpn+VoBTkWxUWFXzoHxUv69BSeIc79kE0zbO1ZGjsFL5Ylj21A8v8XljAM5MJtSD2+OY5vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:10:37.616845Z"},"content_sha256":"085297ae026d54599a801ec0e85900474cba8d525c925260a6ef54790254d398","schema_version":"1.0","event_id":"sha256:085297ae026d54599a801ec0e85900474cba8d525c925260a6ef54790254d398"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG/bundle.json","state_url":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25EZIVYLBQIIBQFORUFVTA5HBG/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-06-04T20:10:37Z","links":{"resolver":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG","bundle":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG/bundle.json","state":"https://pith.science/pith/25EZIVYLBQIIBQFORUFVTA5HBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25EZIVYLBQIIBQFORUFVTA5HBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:25EZIVYLBQIIBQFORUFVTA5HBG","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":"7ff8ba489990c7f4a95d62da543458a98c888d4c43fd1295bd93a360c920e0a4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-07-11T05:55:09Z","title_canon_sha256":"0fbe0bfb6976b6e38fde60e74fb209f53f24ce42b0babf6225358f0fb8e1f870"},"schema_version":"1.0","source":{"id":"1107.1940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1940","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1940v1","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1940","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"25EZIVYLBQII","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"25EZIVYLBQIIBQFO","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"25EZIVYL","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:085297ae026d54599a801ec0e85900474cba8d525c925260a6ef54790254d398","target":"graph","created_at":"2026-05-18T04:18:33Z","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":"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","authors_text":"2) ((1) Mathematics Department, (2) Mathematics Department, David A. Meyer (1), James Pommersheim (1, Reed), UCSD","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-07-11T05:55:09Z","title":"Multi-query quantum sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1940","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:3295336b8530ad338bd90a048661366e189f00a430f8e83f3d22ed682ec889a9","target":"record","created_at":"2026-05-18T04:18:33Z","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":"7ff8ba489990c7f4a95d62da543458a98c888d4c43fd1295bd93a360c920e0a4","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-07-11T05:55:09Z","title_canon_sha256":"0fbe0bfb6976b6e38fde60e74fb209f53f24ce42b0babf6225358f0fb8e1f870"},"schema_version":"1.0","source":{"id":"1107.1940","kind":"arxiv","version":1}},"canonical_sha256":"d74994570b0c1080c0ae8d0b5983a7098b52fd42fed9501e6f2e1e87a3a244f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d74994570b0c1080c0ae8d0b5983a7098b52fd42fed9501e6f2e1e87a3a244f2","first_computed_at":"2026-05-18T04:18:33.820746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:33.820746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ss4gjKk0hjkdwYGwH0f2cHHGiy9QpmdpbpWekX0kAjkjLHgrso43/CsCdrB4jxY3bQ9z5eeboR5oAp0vdQ0NDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:33.821299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3295336b8530ad338bd90a048661366e189f00a430f8e83f3d22ed682ec889a9","sha256:085297ae026d54599a801ec0e85900474cba8d525c925260a6ef54790254d398"],"state_sha256":"d2af6621f76c9d98cd1040102b13d9290964e913563e8dde437fa31abe06c552"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqYWiZZE6D4HeLvf1EsuH71RdWu/zGCCpSIlkYntSby9vuSCGF1OXqF3PDIWWp6Mcgdu0MUU3z5nUVQ0CwTeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:10:37.619013Z","bundle_sha256":"fda5d3bed9333c30b678ae3be483489732cccce4b5c096e3e22c7010b4cc2a0e"}}