{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UYUBBED4DWXJUNXFO7TL3DCZAX","short_pith_number":"pith:UYUBBED4","schema_version":"1.0","canonical_sha256":"a62810907c1dae9a36e577e6bd8c5905fc4e2ef6460b9bd4fa82eb98cacb8173","source":{"kind":"arxiv","id":"1206.6528","version":2},"attestation_state":"computed","paper":{"title":"Adversary Lower Bound for the k-sum Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Robert Spalek","submitted_at":"2012-06-27T21:41:47Z","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."},"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":"1206.6528","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-27T21:41:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f5af17e54b651f39b7a913b23f7d09ef0a979708d9dd79674676daa6bc1b1e1c","abstract_canon_sha256":"5cca33daae5cc719a52d61479582dc66fb64b24e8dec3051885498a6ca06c75c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:00.676312Z","signature_b64":"T94YuLMCAi/94KzEnkjo+vcTJftBAuz/GUDaGzcxQKfrMiwep///tV7+QSRh0Fqk93zF7gHEfB/CmuxqOVzwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a62810907c1dae9a36e577e6bd8c5905fc4e2ef6460b9bd4fa82eb98cacb8173","last_reissued_at":"2026-05-18T03:49:00.675563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:00.675563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversary Lower Bound for the k-sum Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Aleksandrs Belovs, Robert Spalek","submitted_at":"2012-06-27T21:41:47Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6528","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":"1206.6528","created_at":"2026-05-18T03:49:00.675689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6528v2","created_at":"2026-05-18T03:49:00.675689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6528","created_at":"2026-05-18T03:49:00.675689+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYUBBED4DWXJ","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYUBBED4DWXJUNXF","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYUBBED4","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05133","citing_title":"Tight Quantum Lower Bound for k-Distinctness","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UYUBBED4DWXJUNXFO7TL3DCZAX","json":"https://pith.science/pith/UYUBBED4DWXJUNXFO7TL3DCZAX.json","graph_json":"https://pith.science/api/pith-number/UYUBBED4DWXJUNXFO7TL3DCZAX/graph.json","events_json":"https://pith.science/api/pith-number/UYUBBED4DWXJUNXFO7TL3DCZAX/events.json","paper":"https://pith.science/paper/UYUBBED4"},"agent_actions":{"view_html":"https://pith.science/pith/UYUBBED4DWXJUNXFO7TL3DCZAX","download_json":"https://pith.science/pith/UYUBBED4DWXJUNXFO7TL3DCZAX.json","view_paper":"https://pith.science/paper/UYUBBED4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6528&json=true","fetch_graph":"https://pith.science/api/pith-number/UYUBBED4DWXJUNXFO7TL3DCZAX/graph.json","fetch_events":"https://pith.science/api/pith-number/UYUBBED4DWXJUNXFO7TL3DCZAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYUBBED4DWXJUNXFO7TL3DCZAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYUBBED4DWXJUNXFO7TL3DCZAX/action/storage_attestation","attest_author":"https://pith.science/pith/UYUBBED4DWXJUNXFO7TL3DCZAX/action/author_attestation","sign_citation":"https://pith.science/pith/UYUBBED4DWXJUNXFO7TL3DCZAX/action/citation_signature","submit_replication":"https://pith.science/pith/UYUBBED4DWXJUNXFO7TL3DCZAX/action/replication_record"}},"created_at":"2026-05-18T03:49:00.675689+00:00","updated_at":"2026-05-18T03:49:00.675689+00:00"}