{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BHAKEDC7CBDEKLJ2II7SW4SWPP","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":"7be9f31f0db96d339ed23f1923b37787201b33b7600bec983e83e430ceffb863","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T18:55:23Z","title_canon_sha256":"438b532da9cbcebc2a2a5f46daf70b37cdf6ad9c99572908c5a2087d7b65db16"},"schema_version":"1.0","source":{"id":"1512.05279","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05279","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05279v2","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05279","created_at":"2026-05-18T00:49:34Z"},{"alias_kind":"pith_short_12","alias_value":"BHAKEDC7CBDE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BHAKEDC7CBDEKLJ2","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BHAKEDC7","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:90a6ef89a293ede17ef01570a804304c9104cb9ef63e022066b70cad395186e4","target":"graph","created_at":"2026-05-18T00:49:34Z","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":"Given a set of $n$ real numbers, the 3SUM problem is to decide whether there are three of them that sum to zero. Until a recent breakthrough by Gr{\\o}nlund and Pettie [FOCS'14], a simple $\\Theta(n^2)$-time deterministic algorithm for this problem was conjectured to be optimal. Over the years many algorithmic problems have been shown to be reducible from the 3SUM problem or its variants, including the more generalized forms of the problem, such as $k$-SUM and $k$-variate linear degeneracy testing ($k$-LDT). The conjectured hardness of these problems have become extremely popular for basing cond","authors_text":"Micha Sharir, Omer Gold","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T18:55:23Z","title":"Improved Bounds for 3SUM, $k$-SUM, and Linear Degeneracy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05279","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:6d4eebba4de9dceaedfe005ceb56440bc696ab2b76200f94ef2db8f0f68ec429","target":"record","created_at":"2026-05-18T00:49:34Z","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":"7be9f31f0db96d339ed23f1923b37787201b33b7600bec983e83e430ceffb863","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-16T18:55:23Z","title_canon_sha256":"438b532da9cbcebc2a2a5f46daf70b37cdf6ad9c99572908c5a2087d7b65db16"},"schema_version":"1.0","source":{"id":"1512.05279","kind":"arxiv","version":2}},"canonical_sha256":"09c0a20c5f1046452d3a423f2b72567bcd42e94bab8e9b9b924908aad0caad20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09c0a20c5f1046452d3a423f2b72567bcd42e94bab8e9b9b924908aad0caad20","first_computed_at":"2026-05-18T00:49:34.792792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:34.792792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QWhIKlugbF+f50vHvbh5N71xfmbp4GpqqQXHV4bjg2qyLHoNWFs25wXJLNuY14NzgUos6DJko/dcJPjkHq5vCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:34.793213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05279","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d4eebba4de9dceaedfe005ceb56440bc696ab2b76200f94ef2db8f0f68ec429","sha256:90a6ef89a293ede17ef01570a804304c9104cb9ef63e022066b70cad395186e4"],"state_sha256":"0a48cf780d9945b765918ab22762fa27dba6079c0232d994a24f331f68fba1f4"}