{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3SPGUBQQNZJA554GAQXVEYTWPI","short_pith_number":"pith:3SPGUBQQ","schema_version":"1.0","canonical_sha256":"dc9e6a06106e520ef786042f5262767a2f3681f5f4cd5f182ee7994ff2c62f07","source":{"kind":"arxiv","id":"1407.6756","version":3},"attestation_state":"computed","paper":{"title":"Higher Lower Bounds from the 3SUM Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Seth Pettie, Tsvi Kopelowitz","submitted_at":"2014-07-24T23:03:04Z","abstract_excerpt":"The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds on dynamic data structures and graph problems. This line of work was initiated by P\\v{a}tra\\c{s}cu (STOC 2010) who reduced 3SUM to an offline SetDisjointness problem. However, the reduction introduced by P\\v{a}tra\\c{s}cu suffers from several inefficiencies, making it difficult to obtain tight conditional lower bounds from the 3SUM conjecture.\n  In this paper we address many of the deficiencies of P\\v{a}tra\\c{s}cu's framework. We give new and efficient reductions from 3SUM to offline SetDisjointness and of"},"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":"1407.6756","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T23:03:04Z","cross_cats_sorted":[],"title_canon_sha256":"82aef31e36e1b82ba63d6eaccacfd830da27595ac1b8ad66ebba834cf6ab3761","abstract_canon_sha256":"ae3027a15457222d056bf626c8e8568b88c09069356952125a04846858e7174c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.572358Z","signature_b64":"Dm20NO1MwXTDs0hfV/caRu81oLwCoYkGlERj/qIyZhPJFbRL8Qbci1nKd9z/FiZ6S8WUXjG1W9FjhEjUI3xvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc9e6a06106e520ef786042f5262767a2f3681f5f4cd5f182ee7994ff2c62f07","last_reissued_at":"2026-05-17T23:56:30.572007Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.572007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher Lower Bounds from the 3SUM Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Seth Pettie, Tsvi Kopelowitz","submitted_at":"2014-07-24T23:03:04Z","abstract_excerpt":"The 3SUM conjecture has proven to be a valuable tool for proving conditional lower bounds on dynamic data structures and graph problems. This line of work was initiated by P\\v{a}tra\\c{s}cu (STOC 2010) who reduced 3SUM to an offline SetDisjointness problem. However, the reduction introduced by P\\v{a}tra\\c{s}cu suffers from several inefficiencies, making it difficult to obtain tight conditional lower bounds from the 3SUM conjecture.\n  In this paper we address many of the deficiencies of P\\v{a}tra\\c{s}cu's framework. We give new and efficient reductions from 3SUM to offline SetDisjointness and of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6756","kind":"arxiv","version":3},"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":"1407.6756","created_at":"2026-05-17T23:56:30.572063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6756v3","created_at":"2026-05-17T23:56:30.572063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6756","created_at":"2026-05-17T23:56:30.572063+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SPGUBQQNZJA","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SPGUBQQNZJA554G","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SPGUBQQ","created_at":"2026-05-18T12:28:11.866339+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/3SPGUBQQNZJA554GAQXVEYTWPI","json":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI.json","graph_json":"https://pith.science/api/pith-number/3SPGUBQQNZJA554GAQXVEYTWPI/graph.json","events_json":"https://pith.science/api/pith-number/3SPGUBQQNZJA554GAQXVEYTWPI/events.json","paper":"https://pith.science/paper/3SPGUBQQ"},"agent_actions":{"view_html":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI","download_json":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI.json","view_paper":"https://pith.science/paper/3SPGUBQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6756&json=true","fetch_graph":"https://pith.science/api/pith-number/3SPGUBQQNZJA554GAQXVEYTWPI/graph.json","fetch_events":"https://pith.science/api/pith-number/3SPGUBQQNZJA554GAQXVEYTWPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI/action/storage_attestation","attest_author":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI/action/author_attestation","sign_citation":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI/action/citation_signature","submit_replication":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI/action/replication_record"}},"created_at":"2026-05-17T23:56:30.572063+00:00","updated_at":"2026-05-17T23:56:30.572063+00:00"}