{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LUXIUWXXAPEMXOJGYZQKNDCQAO","short_pith_number":"pith:LUXIUWXX","canonical_record":{"source":{"id":"1404.0799","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T08:30:03Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"bd937b5d7cf8f37c0dd775d32e4611efc29f2fd524d9bd8f82d68b99edbb9537","abstract_canon_sha256":"afd100ad4715b3713e6df60a1de4a7a934b26e4645794eb65d9568cf9f8f8677"},"schema_version":"1.0"},"canonical_sha256":"5d2e8a5af703c8cbb926c660a68c5003ac8df0edc616dbae0bfc760ec3a2cc0a","source":{"kind":"arxiv","id":"1404.0799","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0799","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0799v3","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0799","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"LUXIUWXXAPEM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LUXIUWXXAPEMXOJG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LUXIUWXX","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LUXIUWXXAPEMXOJGYZQKNDCQAO","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0799","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T08:30:03Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"bd937b5d7cf8f37c0dd775d32e4611efc29f2fd524d9bd8f82d68b99edbb9537","abstract_canon_sha256":"afd100ad4715b3713e6df60a1de4a7a934b26e4645794eb65d9568cf9f8f8677"},"schema_version":"1.0"},"canonical_sha256":"5d2e8a5af703c8cbb926c660a68c5003ac8df0edc616dbae0bfc760ec3a2cc0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:50.160216Z","signature_b64":"fl/7pBGjU2RuKuqguGImEz6UK+blK90gfffyME9k+CrU9XgaRl9kdp6sg74wL0aw+no9tco8w62TENrJDYdUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d2e8a5af703c8cbb926c660a68c5003ac8df0edc616dbae0bfc760ec3a2cc0a","last_reissued_at":"2026-05-18T02:50:50.159688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:50.159688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0799","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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yb2U8znq39Baa+5jwGklQsc6JeAUQg208pILSE5dU8eMoJD16KQvQZOCQQVbwOHVSbarBhrBXeR2E02yxwKrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:15:58.982725Z"},"content_sha256":"c9a91e1c907f84f58355b48b0c355bcbe54a19fb63465749c8a20d30c9e73a82","schema_version":"1.0","event_id":"sha256:c9a91e1c907f84f58355b48b0c355bcbe54a19fb63465749c8a20d30c9e73a82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LUXIUWXXAPEMXOJGYZQKNDCQAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Threesomes, Degenerates, and Love Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Allan Gr{\\o}nlund, Seth Pettie","submitted_at":"2014-04-03T08:30:03Z","abstract_excerpt":"The 3SUM problem is to decide, given a set of $n$ real numbers, whether any three sum to zero. It is widely conjectured that a trivial $O(n^2)$-time algorithm is optimal and over the years the consequences of this conjecture have been revealed. This 3SUM conjecture implies $\\Omega(n^2)$ lower bounds on numerous problems in computational geometry and a variant of the conjecture implies strong lower bounds on triangle enumeration, dynamic graph algorithms, and string matching data structures.\n  In this paper we refute the 3SUM conjecture. We prove that the decision tree complexity of 3SUM is $O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0799","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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1CxU0+8T8SbOCh6CIkn7F9tMhoREQi1SuYxZhLomFsMM7i9NIVM4yl9UY7h+MZLp37wD1jHGtqKmC3gLTznDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:15:58.983060Z"},"content_sha256":"bb671a388d9186306bff6d3bb90d09225b4e24ee219b4198c8cf0ac5b749568a","schema_version":"1.0","event_id":"sha256:bb671a388d9186306bff6d3bb90d09225b4e24ee219b4198c8cf0ac5b749568a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUXIUWXXAPEMXOJGYZQKNDCQAO/bundle.json","state_url":"https://pith.science/pith/LUXIUWXXAPEMXOJGYZQKNDCQAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUXIUWXXAPEMXOJGYZQKNDCQAO/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-23T01:15:58Z","links":{"resolver":"https://pith.science/pith/LUXIUWXXAPEMXOJGYZQKNDCQAO","bundle":"https://pith.science/pith/LUXIUWXXAPEMXOJGYZQKNDCQAO/bundle.json","state":"https://pith.science/pith/LUXIUWXXAPEMXOJGYZQKNDCQAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUXIUWXXAPEMXOJGYZQKNDCQAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LUXIUWXXAPEMXOJGYZQKNDCQAO","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":"afd100ad4715b3713e6df60a1de4a7a934b26e4645794eb65d9568cf9f8f8677","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T08:30:03Z","title_canon_sha256":"bd937b5d7cf8f37c0dd775d32e4611efc29f2fd524d9bd8f82d68b99edbb9537"},"schema_version":"1.0","source":{"id":"1404.0799","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0799","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0799v3","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0799","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"LUXIUWXXAPEM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LUXIUWXXAPEMXOJG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LUXIUWXX","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:bb671a388d9186306bff6d3bb90d09225b4e24ee219b4198c8cf0ac5b749568a","target":"graph","created_at":"2026-05-18T02:50:50Z","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 problem is to decide, given a set of $n$ real numbers, whether any three sum to zero. It is widely conjectured that a trivial $O(n^2)$-time algorithm is optimal and over the years the consequences of this conjecture have been revealed. This 3SUM conjecture implies $\\Omega(n^2)$ lower bounds on numerous problems in computational geometry and a variant of the conjecture implies strong lower bounds on triangle enumeration, dynamic graph algorithms, and string matching data structures.\n  In this paper we refute the 3SUM conjecture. We prove that the decision tree complexity of 3SUM is $O(","authors_text":"Allan Gr{\\o}nlund, Seth Pettie","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T08:30:03Z","title":"Threesomes, Degenerates, and Love Triangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0799","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:c9a91e1c907f84f58355b48b0c355bcbe54a19fb63465749c8a20d30c9e73a82","target":"record","created_at":"2026-05-18T02:50:50Z","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":"afd100ad4715b3713e6df60a1de4a7a934b26e4645794eb65d9568cf9f8f8677","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T08:30:03Z","title_canon_sha256":"bd937b5d7cf8f37c0dd775d32e4611efc29f2fd524d9bd8f82d68b99edbb9537"},"schema_version":"1.0","source":{"id":"1404.0799","kind":"arxiv","version":3}},"canonical_sha256":"5d2e8a5af703c8cbb926c660a68c5003ac8df0edc616dbae0bfc760ec3a2cc0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d2e8a5af703c8cbb926c660a68c5003ac8df0edc616dbae0bfc760ec3a2cc0a","first_computed_at":"2026-05-18T02:50:50.159688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:50.159688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fl/7pBGjU2RuKuqguGImEz6UK+blK90gfffyME9k+CrU9XgaRl9kdp6sg74wL0aw+no9tco8w62TENrJDYdUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:50.160216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0799","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9a91e1c907f84f58355b48b0c355bcbe54a19fb63465749c8a20d30c9e73a82","sha256:bb671a388d9186306bff6d3bb90d09225b4e24ee219b4198c8cf0ac5b749568a"],"state_sha256":"e9a9b84f30bdf9eacd144450006d87db9e96bc5d78fc19abb29bd1818e188ad5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQnOkioV26+8Q8gocMgrXIwMVP4TOJUC44DNT+wYO8fgVJl6ZVBVrfCl8kG9fPUwD2gaizWUtfvW+mCDGJu8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T01:15:58.984985Z","bundle_sha256":"342c201ae5d808407452a8bc89f4a9386337bd96042108950314823395568122"}}