{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JJCWFT3GPT2XPV3MIFL6NXHLDZ","short_pith_number":"pith:JJCWFT3G","schema_version":"1.0","canonical_sha256":"4a4562cf667cf577d76c4157e6dceb1e48a504035d8d7dd302efb773f2490c3b","source":{"kind":"arxiv","id":"2211.07058","version":2},"attestation_state":"computed","paper":{"title":"Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Karl Bringmann, Nick Fischer","submitted_at":"2022-11-14T00:42:20Z","abstract_excerpt":"The \"short cycle removal\" technique was recently introduced by Abboud, Bringmann, Khoury and Zamir (STOC '22) to prove fine-grained hardness of approximation. Its main technical result is that listing all triangles in an $n^{1/2}$-regular graph is $n^{2-o(1)}$-hard under the 3-SUM conjecture even when the number of short cycles is small; namely, when the number of $k$-cycles is $O(n^{k/2+\\gamma})$ for $\\gamma<1/2$.\n  Abboud et al. achieve $\\gamma\\geq 1/4$ by applying structure vs. randomness arguments on graphs. In this paper, we take a step back and apply conceptually similar arguments on the"},"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":"2211.07058","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-14T00:42:20Z","cross_cats_sorted":[],"title_canon_sha256":"89e7986643242a4b0af4e323013bdf65d83926d214e417c1462fa3d8bd4fbc37","abstract_canon_sha256":"3da4915cb77dcc0f70badef7e920da60e9cae88122d57fcaaa6b5b4e13c57e57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:19.350536Z","signature_b64":"xHjrycEztx/P5vDncgtBxrd+gj+xWTMpbsMVlqPPwWr+jFrORTRL//TgDQ69mLmbylu9Ws0hCxM6n6FFAybqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a4562cf667cf577d76c4157e6dceb1e48a504035d8d7dd302efb773f2490c3b","last_reissued_at":"2026-07-05T07:03:19.350138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:19.350138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Karl Bringmann, Nick Fischer","submitted_at":"2022-11-14T00:42:20Z","abstract_excerpt":"The \"short cycle removal\" technique was recently introduced by Abboud, Bringmann, Khoury and Zamir (STOC '22) to prove fine-grained hardness of approximation. Its main technical result is that listing all triangles in an $n^{1/2}$-regular graph is $n^{2-o(1)}$-hard under the 3-SUM conjecture even when the number of short cycles is small; namely, when the number of $k$-cycles is $O(n^{k/2+\\gamma})$ for $\\gamma<1/2$.\n  Abboud et al. achieve $\\gamma\\geq 1/4$ by applying structure vs. randomness arguments on graphs. In this paper, we take a step back and apply conceptually similar arguments on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07058","kind":"arxiv","version":2},"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/2211.07058/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":"2211.07058","created_at":"2026-07-05T07:03:19.350189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.07058v2","created_at":"2026-07-05T07:03:19.350189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07058","created_at":"2026-07-05T07:03:19.350189+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJCWFT3GPT2X","created_at":"2026-07-05T07:03:19.350189+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJCWFT3GPT2XPV3M","created_at":"2026-07-05T07:03:19.350189+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJCWFT3G","created_at":"2026-07-05T07:03:19.350189+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/JJCWFT3GPT2XPV3MIFL6NXHLDZ","json":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ.json","graph_json":"https://pith.science/api/pith-number/JJCWFT3GPT2XPV3MIFL6NXHLDZ/graph.json","events_json":"https://pith.science/api/pith-number/JJCWFT3GPT2XPV3MIFL6NXHLDZ/events.json","paper":"https://pith.science/paper/JJCWFT3G"},"agent_actions":{"view_html":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ","download_json":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ.json","view_paper":"https://pith.science/paper/JJCWFT3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.07058&json=true","fetch_graph":"https://pith.science/api/pith-number/JJCWFT3GPT2XPV3MIFL6NXHLDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JJCWFT3GPT2XPV3MIFL6NXHLDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/action/storage_attestation","attest_author":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/action/author_attestation","sign_citation":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/action/citation_signature","submit_replication":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/action/replication_record"}},"created_at":"2026-07-05T07:03:19.350189+00:00","updated_at":"2026-07-05T07:03:19.350189+00:00"}