{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7F3YHO3XQPV4D6A3AYT7S6C3GA","short_pith_number":"pith:7F3YHO3X","schema_version":"1.0","canonical_sha256":"f97783bb7783ebc1f81b0627f9785b302cf71fd01b462bd99566ae1a1135baa4","source":{"kind":"arxiv","id":"1502.05204","version":1},"attestation_state":"computed","paper":{"title":"Clustered Integer 3SUM via Additive Combinatorics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moshe Lewenstein, Timothy M. Chan","submitted_at":"2015-02-18T12:49:06Z","abstract_excerpt":"We present a collection of new results on problems related to 3SUM, including:\n  1. The first truly subquadratic algorithm for\n  $\\ \\ \\ \\ \\ $ 1a. computing the (min,+) convolution for monotone increasing sequences with integer values bounded by $O(n)$,\n  $\\ \\ \\ \\ \\ $1b. solving 3SUM for monotone sets in 2D with integer coordinates bounded by $O(n)$, and\n  $\\ \\ \\ \\ \\ $1c. preprocessing a binary string for histogram indexing (also called jumbled indexing).\n  The running time is: $O(n^{(9+\\sqrt{177})/12}\\,\\textrm{polylog}\\,n)=O(n^{1.859})$ with randomization, or $O(n^{1.864})$ deterministically. "},"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":"1502.05204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-18T12:49:06Z","cross_cats_sorted":[],"title_canon_sha256":"f68672d8fc877bc5fd59032003313c46db2fb33f5661c6d4cf4a0ae1bdde1e83","abstract_canon_sha256":"8394af56a79bf05ab13da5b6d9387c7dcc26edb976db95c5be6175c3eb5e30a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:52.187454Z","signature_b64":"hMcMHbrXj5+uqLvI1m40EVs2MpwUlem7LmqyP5Zn1LQLu3XiL2knQZgxizYIu2KpghG/sSq4/4/PGfEILHZfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f97783bb7783ebc1f81b0627f9785b302cf71fd01b462bd99566ae1a1135baa4","last_reissued_at":"2026-05-18T02:26:52.187076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:52.187076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustered Integer 3SUM via Additive Combinatorics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moshe Lewenstein, Timothy M. Chan","submitted_at":"2015-02-18T12:49:06Z","abstract_excerpt":"We present a collection of new results on problems related to 3SUM, including:\n  1. The first truly subquadratic algorithm for\n  $\\ \\ \\ \\ \\ $ 1a. computing the (min,+) convolution for monotone increasing sequences with integer values bounded by $O(n)$,\n  $\\ \\ \\ \\ \\ $1b. solving 3SUM for monotone sets in 2D with integer coordinates bounded by $O(n)$, and\n  $\\ \\ \\ \\ \\ $1c. preprocessing a binary string for histogram indexing (also called jumbled indexing).\n  The running time is: $O(n^{(9+\\sqrt{177})/12}\\,\\textrm{polylog}\\,n)=O(n^{1.859})$ with randomization, or $O(n^{1.864})$ deterministically. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05204","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":"1502.05204","created_at":"2026-05-18T02:26:52.187137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05204v1","created_at":"2026-05-18T02:26:52.187137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05204","created_at":"2026-05-18T02:26:52.187137+00:00"},{"alias_kind":"pith_short_12","alias_value":"7F3YHO3XQPV4","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7F3YHO3XQPV4D6A3","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7F3YHO3X","created_at":"2026-05-18T12:29:10.953037+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/7F3YHO3XQPV4D6A3AYT7S6C3GA","json":"https://pith.science/pith/7F3YHO3XQPV4D6A3AYT7S6C3GA.json","graph_json":"https://pith.science/api/pith-number/7F3YHO3XQPV4D6A3AYT7S6C3GA/graph.json","events_json":"https://pith.science/api/pith-number/7F3YHO3XQPV4D6A3AYT7S6C3GA/events.json","paper":"https://pith.science/paper/7F3YHO3X"},"agent_actions":{"view_html":"https://pith.science/pith/7F3YHO3XQPV4D6A3AYT7S6C3GA","download_json":"https://pith.science/pith/7F3YHO3XQPV4D6A3AYT7S6C3GA.json","view_paper":"https://pith.science/paper/7F3YHO3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05204&json=true","fetch_graph":"https://pith.science/api/pith-number/7F3YHO3XQPV4D6A3AYT7S6C3GA/graph.json","fetch_events":"https://pith.science/api/pith-number/7F3YHO3XQPV4D6A3AYT7S6C3GA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7F3YHO3XQPV4D6A3AYT7S6C3GA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7F3YHO3XQPV4D6A3AYT7S6C3GA/action/storage_attestation","attest_author":"https://pith.science/pith/7F3YHO3XQPV4D6A3AYT7S6C3GA/action/author_attestation","sign_citation":"https://pith.science/pith/7F3YHO3XQPV4D6A3AYT7S6C3GA/action/citation_signature","submit_replication":"https://pith.science/pith/7F3YHO3XQPV4D6A3AYT7S6C3GA/action/replication_record"}},"created_at":"2026-05-18T02:26:52.187137+00:00","updated_at":"2026-05-18T02:26:52.187137+00:00"}