{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UYUBBED4DWXJUNXFO7TL3DCZAX","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":"5cca33daae5cc719a52d61479582dc66fb64b24e8dec3051885498a6ca06c75c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-27T21:41:47Z","title_canon_sha256":"f5af17e54b651f39b7a913b23f7d09ef0a979708d9dd79674676daa6bc1b1e1c"},"schema_version":"1.0","source":{"id":"1206.6528","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6528","created_at":"2026-05-18T03:49:00Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6528v2","created_at":"2026-05-18T03:49:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6528","created_at":"2026-05-18T03:49:00Z"},{"alias_kind":"pith_short_12","alias_value":"UYUBBED4DWXJ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"UYUBBED4DWXJUNXF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"UYUBBED4","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:ee6de76cf350270ddf1058aa38fdaea1fcd0c81836783e64e8ce5d42c88e1cf3","target":"graph","created_at":"2026-05-18T03:49:00Z","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":"We prove a tight quantum query lower bound $\\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large.\n  This is an extended and simplified version of an earlier preprint of one of the authors arXiv:1204.5074.","authors_text":"Aleksandrs Belovs, Robert Spalek","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-27T21:41:47Z","title":"Adversary Lower Bound for the k-sum Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6528","kind":"arxiv","version":2},"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:0c28a16fede9ce156752a9b6a0c0dedfd825c918566b7587d2e65d885b1d164f","target":"record","created_at":"2026-05-18T03:49:00Z","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":"5cca33daae5cc719a52d61479582dc66fb64b24e8dec3051885498a6ca06c75c","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-27T21:41:47Z","title_canon_sha256":"f5af17e54b651f39b7a913b23f7d09ef0a979708d9dd79674676daa6bc1b1e1c"},"schema_version":"1.0","source":{"id":"1206.6528","kind":"arxiv","version":2}},"canonical_sha256":"a62810907c1dae9a36e577e6bd8c5905fc4e2ef6460b9bd4fa82eb98cacb8173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a62810907c1dae9a36e577e6bd8c5905fc4e2ef6460b9bd4fa82eb98cacb8173","first_computed_at":"2026-05-18T03:49:00.675563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:00.675563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T94YuLMCAi/94KzEnkjo+vcTJftBAuz/GUDaGzcxQKfrMiwep///tV7+QSRh0Fqk93zF7gHEfB/CmuxqOVzwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:00.676312Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6528","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c28a16fede9ce156752a9b6a0c0dedfd825c918566b7587d2e65d885b1d164f","sha256:ee6de76cf350270ddf1058aa38fdaea1fcd0c81836783e64e8ce5d42c88e1cf3"],"state_sha256":"354bb7cbaecf6e4fca2a30b8f1614d3956b38aa0204bacac34a799a3db533462"}