{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BGCO5D746ZOUNGHE6GOCDVCVU2","short_pith_number":"pith:BGCO5D74","canonical_record":{"source":{"id":"1907.11206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T17:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"c486c46e341e6a2b91d44c205b64011739bf64e721979e56b15141094758db6d","abstract_canon_sha256":"c33c3ce5aad5184ee3cd144f3debf87882af18df7bc30114d629eefd748f8df5"},"schema_version":"1.0"},"canonical_sha256":"0984ee8ffcf65d4698e4f19c21d455a6ba36d2e199360e41f97af94500585c95","source":{"kind":"arxiv","id":"1907.11206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11206","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11206v1","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11206","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"BGCO5D746ZOU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BGCO5D746ZOUNGHE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BGCO5D74","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BGCO5D746ZOUNGHE6GOCDVCVU2","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T17:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"c486c46e341e6a2b91d44c205b64011739bf64e721979e56b15141094758db6d","abstract_canon_sha256":"c33c3ce5aad5184ee3cd144f3debf87882af18df7bc30114d629eefd748f8df5"},"schema_version":"1.0"},"canonical_sha256":"0984ee8ffcf65d4698e4f19c21d455a6ba36d2e199360e41f97af94500585c95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:32.951844Z","signature_b64":"vB4eNSrrTRUttO3sKCNnZrbz8yWYpD6JA0+mSfagzUQPs5IH+v5rslm88uUiP0laKNHLLDabT+k3ossnn0I6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0984ee8ffcf65d4698e4f19c21d455a6ba36d2e199360e41f97af94500585c95","last_reissued_at":"2026-05-17T23:39:32.951126Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:32.951126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11206","source_version":1,"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:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SprblWxt5SzlboZlW3M6cpFDpU7nI+Gtjw7NITlDzGv93KmaxIO0YpHafQ3joUt5KtPY89R+HhBFXcXNTwQjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:23:36.626629Z"},"content_sha256":"3baaed61d9a049b781e435458bb30ebc24dc1278a311ea9d4c53593682d81b95","schema_version":"1.0","event_id":"sha256:3baaed61d9a049b781e435458bb30ebc24dc1278a311ea9d4c53593682d81b95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BGCO5D746ZOUNGHE6GOCDVCVU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Strong 3SUM-INDEXING Conjecture is False","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Tsvi Kopelowitz","submitted_at":"2019-07-25T17:11:11Z","abstract_excerpt":"In the 3SUM-Indexing problem the goal is to preprocess two lists of elements from $U$, $A=(a_1,a_2,\\ldots,a_n)$ and $B=(b_1,b_2,...,b_n)$, such that given an element $c\\in U$ one can quickly determine whether there exists a pair $(a,b)\\in A \\times B$ where $a+b=c$. Goldstein et al.~[WADS'2017] conjectured that there is no algorithm for 3SUM-Indexing which uses $n^{2-\\Omega(1)}$ space and $n^{1-\\Omega(1)}$ query time.\n  We show that the conjecture is false by reducing the 3SUM-Indexing problem to the problem of inverting functions, and then applying an algorithm of Fiat and Naor [SICOMP'1999] f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11206","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"},"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:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdFjmgowFUY1kjDyXqJHN3RpiMjBqKwHGVOP2S3SXo0Z0Mbj4psdyRnxIhwM4L1LkN6+Rvff31aBfCdMC5TzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:23:36.626979Z"},"content_sha256":"5dca8914aa1e0348ccc7acc5401b18e3dfc8fbb8f548cbbc0c2abce9b485cd92","schema_version":"1.0","event_id":"sha256:5dca8914aa1e0348ccc7acc5401b18e3dfc8fbb8f548cbbc0c2abce9b485cd92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGCO5D746ZOUNGHE6GOCDVCVU2/bundle.json","state_url":"https://pith.science/pith/BGCO5D746ZOUNGHE6GOCDVCVU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGCO5D746ZOUNGHE6GOCDVCVU2/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-05-19T22:23:36Z","links":{"resolver":"https://pith.science/pith/BGCO5D746ZOUNGHE6GOCDVCVU2","bundle":"https://pith.science/pith/BGCO5D746ZOUNGHE6GOCDVCVU2/bundle.json","state":"https://pith.science/pith/BGCO5D746ZOUNGHE6GOCDVCVU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGCO5D746ZOUNGHE6GOCDVCVU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BGCO5D746ZOUNGHE6GOCDVCVU2","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":"c33c3ce5aad5184ee3cd144f3debf87882af18df7bc30114d629eefd748f8df5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T17:11:11Z","title_canon_sha256":"c486c46e341e6a2b91d44c205b64011739bf64e721979e56b15141094758db6d"},"schema_version":"1.0","source":{"id":"1907.11206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11206","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11206v1","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11206","created_at":"2026-05-17T23:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"BGCO5D746ZOU","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BGCO5D746ZOUNGHE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BGCO5D74","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:5dca8914aa1e0348ccc7acc5401b18e3dfc8fbb8f548cbbc0c2abce9b485cd92","target":"graph","created_at":"2026-05-17T23:39:32Z","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":"In the 3SUM-Indexing problem the goal is to preprocess two lists of elements from $U$, $A=(a_1,a_2,\\ldots,a_n)$ and $B=(b_1,b_2,...,b_n)$, such that given an element $c\\in U$ one can quickly determine whether there exists a pair $(a,b)\\in A \\times B$ where $a+b=c$. Goldstein et al.~[WADS'2017] conjectured that there is no algorithm for 3SUM-Indexing which uses $n^{2-\\Omega(1)}$ space and $n^{1-\\Omega(1)}$ query time.\n  We show that the conjecture is false by reducing the 3SUM-Indexing problem to the problem of inverting functions, and then applying an algorithm of Fiat and Naor [SICOMP'1999] f","authors_text":"Ely Porat, Tsvi Kopelowitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T17:11:11Z","title":"The Strong 3SUM-INDEXING Conjecture is False"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11206","kind":"arxiv","version":1},"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:3baaed61d9a049b781e435458bb30ebc24dc1278a311ea9d4c53593682d81b95","target":"record","created_at":"2026-05-17T23:39:32Z","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":"c33c3ce5aad5184ee3cd144f3debf87882af18df7bc30114d629eefd748f8df5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T17:11:11Z","title_canon_sha256":"c486c46e341e6a2b91d44c205b64011739bf64e721979e56b15141094758db6d"},"schema_version":"1.0","source":{"id":"1907.11206","kind":"arxiv","version":1}},"canonical_sha256":"0984ee8ffcf65d4698e4f19c21d455a6ba36d2e199360e41f97af94500585c95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0984ee8ffcf65d4698e4f19c21d455a6ba36d2e199360e41f97af94500585c95","first_computed_at":"2026-05-17T23:39:32.951126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:32.951126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vB4eNSrrTRUttO3sKCNnZrbz8yWYpD6JA0+mSfagzUQPs5IH+v5rslm88uUiP0laKNHLLDabT+k3ossnn0I6Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:32.951844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3baaed61d9a049b781e435458bb30ebc24dc1278a311ea9d4c53593682d81b95","sha256:5dca8914aa1e0348ccc7acc5401b18e3dfc8fbb8f548cbbc0c2abce9b485cd92"],"state_sha256":"aeb07fd66bfcb04b04c60a93c28113d1f4a0bd04edadf01f251650bb2f3828c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZ3hvZSfqS1tyDdHIqhg5UWFhH/zMSgaTmtj2BbEGlmrz6uuA6fBdGOdexuklKeaXvGkHhY74vTHwVpYjka/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T22:23:36.628995Z","bundle_sha256":"85bc1dc6bafb648acab08629ba6e79a2457b81dad1ac9fc2b10e9ab59e4af33e"}}