{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DFUCMJOWSH27UMANNMUQ3G3DA4","short_pith_number":"pith:DFUCMJOW","schema_version":"1.0","canonical_sha256":"19682625d691f5fa300d6b290d9b6307381903d95be2c5504b92ac54103b3c76","source":{"kind":"arxiv","id":"1706.05815","version":1},"attestation_state":"computed","paper":{"title":"How Hard is it to Find (Honest) Witnesses?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Isaac Goldstein, Moshe Lewenstein, Tsvi Kopelowitz","submitted_at":"2017-06-19T07:53:40Z","abstract_excerpt":"In recent years much effort was put into developing polynomial-time conditional lower bounds for algorithms and data structures in both static and dynamic settings. Along these lines we suggest a framework for proving conditional lower bounds based on the well-known 3SUM conjecture. Our framework creates a \\emph{compact representation} of an instance of the 3SUM problem using hashing and domain specific encoding. This compact representation admits false solutions to the original 3SUM problem instance which we reveal and eliminate until we find a true solution. In other words, from all \\emph{wi"},"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":"1706.05815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T07:53:40Z","cross_cats_sorted":[],"title_canon_sha256":"6e72824e57a814ae394301e8c055b78b4bf6c4f5e84f2ea2763313b541c90ec6","abstract_canon_sha256":"522bd41c0eda80673413235f0b43da7d55d9e33272f920a3124dd3869997bfbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:08.816447Z","signature_b64":"x2H5zfWLEM0EOKgq2bgq8j33X4uQz2Tvq7WGlEFDZHPv2nNgupgAB8OEXw8eXFt+kdxjOU2GRHNzqfNICjxNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19682625d691f5fa300d6b290d9b6307381903d95be2c5504b92ac54103b3c76","last_reissued_at":"2026-05-18T00:42:08.815844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:08.815844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Hard is it to Find (Honest) Witnesses?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Isaac Goldstein, Moshe Lewenstein, Tsvi Kopelowitz","submitted_at":"2017-06-19T07:53:40Z","abstract_excerpt":"In recent years much effort was put into developing polynomial-time conditional lower bounds for algorithms and data structures in both static and dynamic settings. Along these lines we suggest a framework for proving conditional lower bounds based on the well-known 3SUM conjecture. Our framework creates a \\emph{compact representation} of an instance of the 3SUM problem using hashing and domain specific encoding. This compact representation admits false solutions to the original 3SUM problem instance which we reveal and eliminate until we find a true solution. In other words, from all \\emph{wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05815","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":"1706.05815","created_at":"2026-05-18T00:42:08.815928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05815v1","created_at":"2026-05-18T00:42:08.815928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05815","created_at":"2026-05-18T00:42:08.815928+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFUCMJOWSH27","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFUCMJOWSH27UMAN","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFUCMJOW","created_at":"2026-05-18T12:31:10.602751+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/DFUCMJOWSH27UMANNMUQ3G3DA4","json":"https://pith.science/pith/DFUCMJOWSH27UMANNMUQ3G3DA4.json","graph_json":"https://pith.science/api/pith-number/DFUCMJOWSH27UMANNMUQ3G3DA4/graph.json","events_json":"https://pith.science/api/pith-number/DFUCMJOWSH27UMANNMUQ3G3DA4/events.json","paper":"https://pith.science/paper/DFUCMJOW"},"agent_actions":{"view_html":"https://pith.science/pith/DFUCMJOWSH27UMANNMUQ3G3DA4","download_json":"https://pith.science/pith/DFUCMJOWSH27UMANNMUQ3G3DA4.json","view_paper":"https://pith.science/paper/DFUCMJOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05815&json=true","fetch_graph":"https://pith.science/api/pith-number/DFUCMJOWSH27UMANNMUQ3G3DA4/graph.json","fetch_events":"https://pith.science/api/pith-number/DFUCMJOWSH27UMANNMUQ3G3DA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFUCMJOWSH27UMANNMUQ3G3DA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFUCMJOWSH27UMANNMUQ3G3DA4/action/storage_attestation","attest_author":"https://pith.science/pith/DFUCMJOWSH27UMANNMUQ3G3DA4/action/author_attestation","sign_citation":"https://pith.science/pith/DFUCMJOWSH27UMANNMUQ3G3DA4/action/citation_signature","submit_replication":"https://pith.science/pith/DFUCMJOWSH27UMANNMUQ3G3DA4/action/replication_record"}},"created_at":"2026-05-18T00:42:08.815928+00:00","updated_at":"2026-05-18T00:42:08.815928+00:00"}