{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3SPGUBQQNZJA554GAQXVEYTWPI","short_pith_number":"pith:3SPGUBQQ","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"},"canonical_sha256":"dc9e6a06106e520ef786042f5262767a2f3681f5f4cd5f182ee7994ff2c62f07","source":{"kind":"arxiv","id":"1407.6756","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6756","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6756v3","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6756","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"3SPGUBQQNZJA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3SPGUBQQNZJA554G","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3SPGUBQQ","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3SPGUBQQNZJA554GAQXVEYTWPI","target":"record","payload":{"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"},"canonical_sha256":"dc9e6a06106e520ef786042f5262767a2f3681f5f4cd5f182ee7994ff2c62f07","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"},"source_kind":"arxiv","source_id":"1407.6756","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRll6/lA62/chf83pi3imZGGN2O1A4waAtL82GN5KjZ96k1pZ4OA1twW/Lyj8W1eNniLApuCshZFZv8osQg1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:13:56.911205Z"},"content_sha256":"199415c6782100ef2b30437db5dd514d3f372433946c62ece667a093b64d9640","schema_version":"1.0","event_id":"sha256:199415c6782100ef2b30437db5dd514d3f372433946c62ece667a093b64d9640"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3SPGUBQQNZJA554GAQXVEYTWPI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqd8ahQn/zEF75NXavv5yXTCuubDvH3AzFBVH+8XyvZk2Ao9GRDbw89Ok+tElQGJo/e3PQ5xvdCcz6srS6ZsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:13:56.911557Z"},"content_sha256":"3e85a9cc7643543d2ab6610a3a2d029b6bb5bf6489a75f2afbd94d296c761646","schema_version":"1.0","event_id":"sha256:3e85a9cc7643543d2ab6610a3a2d029b6bb5bf6489a75f2afbd94d296c761646"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI/bundle.json","state_url":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SPGUBQQNZJA554GAQXVEYTWPI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T04:13:56Z","links":{"resolver":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI","bundle":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI/bundle.json","state":"https://pith.science/pith/3SPGUBQQNZJA554GAQXVEYTWPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SPGUBQQNZJA554GAQXVEYTWPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3SPGUBQQNZJA554GAQXVEYTWPI","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":"ae3027a15457222d056bf626c8e8568b88c09069356952125a04846858e7174c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T23:03:04Z","title_canon_sha256":"82aef31e36e1b82ba63d6eaccacfd830da27595ac1b8ad66ebba834cf6ab3761"},"schema_version":"1.0","source":{"id":"1407.6756","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6756","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6756v3","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6756","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"3SPGUBQQNZJA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3SPGUBQQNZJA554G","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3SPGUBQQ","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:3e85a9cc7643543d2ab6610a3a2d029b6bb5bf6489a75f2afbd94d296c761646","target":"graph","created_at":"2026-05-17T23:56:30Z","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":"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","authors_text":"Ely Porat, Seth Pettie, Tsvi Kopelowitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T23:03:04Z","title":"Higher Lower Bounds from the 3SUM Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6756","kind":"arxiv","version":3},"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:199415c6782100ef2b30437db5dd514d3f372433946c62ece667a093b64d9640","target":"record","created_at":"2026-05-17T23:56:30Z","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":"ae3027a15457222d056bf626c8e8568b88c09069356952125a04846858e7174c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T23:03:04Z","title_canon_sha256":"82aef31e36e1b82ba63d6eaccacfd830da27595ac1b8ad66ebba834cf6ab3761"},"schema_version":"1.0","source":{"id":"1407.6756","kind":"arxiv","version":3}},"canonical_sha256":"dc9e6a06106e520ef786042f5262767a2f3681f5f4cd5f182ee7994ff2c62f07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc9e6a06106e520ef786042f5262767a2f3681f5f4cd5f182ee7994ff2c62f07","first_computed_at":"2026-05-17T23:56:30.572007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:30.572007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dm20NO1MwXTDs0hfV/caRu81oLwCoYkGlERj/qIyZhPJFbRL8Qbci1nKd9z/FiZ6S8WUXjG1W9FjhEjUI3xvDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:30.572358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6756","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:199415c6782100ef2b30437db5dd514d3f372433946c62ece667a093b64d9640","sha256:3e85a9cc7643543d2ab6610a3a2d029b6bb5bf6489a75f2afbd94d296c761646"],"state_sha256":"68de43fc838e8c69da18f995af5ca40493342cc58e2f64d7593e53495ac8f8b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"woVUqz9YnpxA8NjY0gtuUenvzdznfevbRkp2ltR7fvpNB3bCSvtnNRfchg8J2cs/sPt2Lnc7h1j89hcXHEXHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:13:56.913445Z","bundle_sha256":"731f50e4d65667e2bb6174ac93e52a7dff91d5a5b4bb8fce10777f0106a15899"}}