{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QQHZBIWNML7S2UGY5IVKDQ72M2","short_pith_number":"pith:QQHZBIWN","schema_version":"1.0","canonical_sha256":"840f90a2cd62ff2d50d8ea2aa1c3fa66a6397c62118477c7c7427bac41be626e","source":{"kind":"arxiv","id":"1605.07285","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Time-Space Tradeoffs for k-SUM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Lincoln, Joshua R. Wang, R. Ryan Williams, Virginia Vassilevska Williams","submitted_at":"2016-05-24T04:43:14Z","abstract_excerpt":"Given a set of numbers, the $k$-SUM problem asks for a subset of $k$ numbers that sums to zero. When the numbers are integers, the time and space complexity of $k$-SUM is generally studied in the word-RAM model; when the numbers are reals, the complexity is studied in the real-RAM model, and space is measured by the number of reals held in memory at any point.\n  We present a time and space efficient deterministic self-reduction for the $k$-SUM problem which holds for both models, and has many interesting consequences. To illustrate:\n  * $3$-SUM is in deterministic time $O(n^2 \\lg\\lg(n)/\\lg(n))"},"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":"1605.07285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-24T04:43:14Z","cross_cats_sorted":[],"title_canon_sha256":"c4f1f7e8d2f8bc6585dd3b1a36175d5bc0f74725d38af0876d3356b2ac011bbf","abstract_canon_sha256":"657cb33ee1a7a3f7eb74e13a0b9c07d9517c8baae5227fbcec3943d5da2b415c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:46.458463Z","signature_b64":"1sX1bD2lbf5ri3fJ3qBvWIdH58/IZ+crbi0tc6hXbnLA2sgRlnD75BzU4HJoPCQ20MF7sTDVT8PIyFROlTtSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"840f90a2cd62ff2d50d8ea2aa1c3fa66a6397c62118477c7c7427bac41be626e","last_reissued_at":"2026-05-18T01:13:46.457836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:46.457836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Time-Space Tradeoffs for k-SUM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Lincoln, Joshua R. Wang, R. Ryan Williams, Virginia Vassilevska Williams","submitted_at":"2016-05-24T04:43:14Z","abstract_excerpt":"Given a set of numbers, the $k$-SUM problem asks for a subset of $k$ numbers that sums to zero. When the numbers are integers, the time and space complexity of $k$-SUM is generally studied in the word-RAM model; when the numbers are reals, the complexity is studied in the real-RAM model, and space is measured by the number of reals held in memory at any point.\n  We present a time and space efficient deterministic self-reduction for the $k$-SUM problem which holds for both models, and has many interesting consequences. To illustrate:\n  * $3$-SUM is in deterministic time $O(n^2 \\lg\\lg(n)/\\lg(n))"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07285","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":"1605.07285","created_at":"2026-05-18T01:13:46.457941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07285v1","created_at":"2026-05-18T01:13:46.457941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07285","created_at":"2026-05-18T01:13:46.457941+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQHZBIWNML7S","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQHZBIWNML7S2UGY","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQHZBIWN","created_at":"2026-05-18T12:30:41.710351+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/QQHZBIWNML7S2UGY5IVKDQ72M2","json":"https://pith.science/pith/QQHZBIWNML7S2UGY5IVKDQ72M2.json","graph_json":"https://pith.science/api/pith-number/QQHZBIWNML7S2UGY5IVKDQ72M2/graph.json","events_json":"https://pith.science/api/pith-number/QQHZBIWNML7S2UGY5IVKDQ72M2/events.json","paper":"https://pith.science/paper/QQHZBIWN"},"agent_actions":{"view_html":"https://pith.science/pith/QQHZBIWNML7S2UGY5IVKDQ72M2","download_json":"https://pith.science/pith/QQHZBIWNML7S2UGY5IVKDQ72M2.json","view_paper":"https://pith.science/paper/QQHZBIWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07285&json=true","fetch_graph":"https://pith.science/api/pith-number/QQHZBIWNML7S2UGY5IVKDQ72M2/graph.json","fetch_events":"https://pith.science/api/pith-number/QQHZBIWNML7S2UGY5IVKDQ72M2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQHZBIWNML7S2UGY5IVKDQ72M2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQHZBIWNML7S2UGY5IVKDQ72M2/action/storage_attestation","attest_author":"https://pith.science/pith/QQHZBIWNML7S2UGY5IVKDQ72M2/action/author_attestation","sign_citation":"https://pith.science/pith/QQHZBIWNML7S2UGY5IVKDQ72M2/action/citation_signature","submit_replication":"https://pith.science/pith/QQHZBIWNML7S2UGY5IVKDQ72M2/action/replication_record"}},"created_at":"2026-05-18T01:13:46.457941+00:00","updated_at":"2026-05-18T01:13:46.457941+00:00"}