{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AMBYETWPT5N4MWRG3L2HVTMLKM","short_pith_number":"pith:AMBYETWP","schema_version":"1.0","canonical_sha256":"0303824ecf9f5bc65a26daf47acd8b5316ad86e27b676fdbac1ed0e09c06bb8a","source":{"kind":"arxiv","id":"2410.20764","version":1},"attestation_state":"computed","paper":{"title":"New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ce Jin, Nick Fischer, Yinzhan Xu","submitted_at":"2024-10-28T06:02:12Z","abstract_excerpt":"The 3SUM problem is one of the cornerstones of fine-grained complexity. Its study has led to countless lower bounds, but as has been sporadically observed before -- and as we will demonstrate again -- insights on 3SUM can also lead to algorithmic applications.\n  The starting point of our work is that we spend a lot of technical effort to develop new algorithms for 3SUM-type problems such as approximate 3SUM-counting, small-doubling 3SUM-counting, and a deterministic subquadratic-time algorithm for the celebrated Balog-Szemer\\'edi-Gowers theorem from additive combinatorics. As consequences of t"},"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":"2410.20764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-10-28T06:02:12Z","cross_cats_sorted":[],"title_canon_sha256":"19bde808edd740c17442c27f4c0b984e976bd0a8eefcd4fc277b0d8874e54fca","abstract_canon_sha256":"7f496a81d7962e55851f8a1aad451aa72147f2deaca09638e2f7da7c89bd987c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:10.674456Z","signature_b64":"tcCeOEpqLwVECymie3Y4+bNKxOkPvErTuRo4K8AC010d6btLULXZ+2NfIWquKibPxw2m7hrKZOuHs9x2H3DGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0303824ecf9f5bc65a26daf47acd8b5316ad86e27b676fdbac1ed0e09c06bb8a","last_reissued_at":"2026-07-05T09:27:10.673993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:10.673993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ce Jin, Nick Fischer, Yinzhan Xu","submitted_at":"2024-10-28T06:02:12Z","abstract_excerpt":"The 3SUM problem is one of the cornerstones of fine-grained complexity. Its study has led to countless lower bounds, but as has been sporadically observed before -- and as we will demonstrate again -- insights on 3SUM can also lead to algorithmic applications.\n  The starting point of our work is that we spend a lot of technical effort to develop new algorithms for 3SUM-type problems such as approximate 3SUM-counting, small-doubling 3SUM-counting, and a deterministic subquadratic-time algorithm for the celebrated Balog-Szemer\\'edi-Gowers theorem from additive combinatorics. As consequences of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20764","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.20764/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.20764","created_at":"2026-07-05T09:27:10.674050+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20764v1","created_at":"2026-07-05T09:27:10.674050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20764","created_at":"2026-07-05T09:27:10.674050+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMBYETWPT5N4","created_at":"2026-07-05T09:27:10.674050+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMBYETWPT5N4MWRG","created_at":"2026-07-05T09:27:10.674050+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMBYETWP","created_at":"2026-07-05T09:27:10.674050+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20017","citing_title":"All-Pairs Shortest Paths with Few Weights per Node","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AMBYETWPT5N4MWRG3L2HVTMLKM","json":"https://pith.science/pith/AMBYETWPT5N4MWRG3L2HVTMLKM.json","graph_json":"https://pith.science/api/pith-number/AMBYETWPT5N4MWRG3L2HVTMLKM/graph.json","events_json":"https://pith.science/api/pith-number/AMBYETWPT5N4MWRG3L2HVTMLKM/events.json","paper":"https://pith.science/paper/AMBYETWP"},"agent_actions":{"view_html":"https://pith.science/pith/AMBYETWPT5N4MWRG3L2HVTMLKM","download_json":"https://pith.science/pith/AMBYETWPT5N4MWRG3L2HVTMLKM.json","view_paper":"https://pith.science/paper/AMBYETWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20764&json=true","fetch_graph":"https://pith.science/api/pith-number/AMBYETWPT5N4MWRG3L2HVTMLKM/graph.json","fetch_events":"https://pith.science/api/pith-number/AMBYETWPT5N4MWRG3L2HVTMLKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMBYETWPT5N4MWRG3L2HVTMLKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMBYETWPT5N4MWRG3L2HVTMLKM/action/storage_attestation","attest_author":"https://pith.science/pith/AMBYETWPT5N4MWRG3L2HVTMLKM/action/author_attestation","sign_citation":"https://pith.science/pith/AMBYETWPT5N4MWRG3L2HVTMLKM/action/citation_signature","submit_replication":"https://pith.science/pith/AMBYETWPT5N4MWRG3L2HVTMLKM/action/replication_record"}},"created_at":"2026-07-05T09:27:10.674050+00:00","updated_at":"2026-07-05T09:27:10.674050+00:00"}