{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JJCWFT3GPT2XPV3MIFL6NXHLDZ","short_pith_number":"pith:JJCWFT3G","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"},"canonical_sha256":"4a4562cf667cf577d76c4157e6dceb1e48a504035d8d7dd302efb773f2490c3b","source":{"kind":"arxiv","id":"2211.07058","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.07058","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"2211.07058v2","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07058","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"JJCWFT3GPT2X","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"pith_short_16","alias_value":"JJCWFT3GPT2XPV3M","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"pith_short_8","alias_value":"JJCWFT3G","created_at":"2026-07-05T07:03:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JJCWFT3GPT2XPV3MIFL6NXHLDZ","target":"record","payload":{"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"},"canonical_sha256":"4a4562cf667cf577d76c4157e6dceb1e48a504035d8d7dd302efb773f2490c3b","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"},"source_kind":"arxiv","source_id":"2211.07058","source_version":2,"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-07-05T07:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Ymv4rymJBrojA7oCp1B3Qi4SH9hUtnbMFZmXhno0sliEtl9eUjwGQBWlWjWjA8XyT1fOLwovPT9RUlutSDqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:53:35.656764Z"},"content_sha256":"1acb194d244ca186b20236d1a60040bdd5f4996cea1e70c2cc26998b311ea881","schema_version":"1.0","event_id":"sha256:1acb194d244ca186b20236d1a60040bdd5f4996cea1e70c2cc26998b311ea881"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JJCWFT3GPT2XPV3MIFL6NXHLDZ","target":"graph","payload":{"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"},"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-07-05T07:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvLp5+bjSX6n9DzUWoawoSQPTyE5UsTqTT2rdqmZDalR6DZulea90ZZgaMEjv+eJha9YnSXDiqw3lMNWjzzhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:53:35.657416Z"},"content_sha256":"09aabf1b55e42c8d2c80a5747490372c6605e074566e21647a9750f6dd14f429","schema_version":"1.0","event_id":"sha256:09aabf1b55e42c8d2c80a5747490372c6605e074566e21647a9750f6dd14f429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/bundle.json","state_url":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/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-08-15T13:53:35Z","links":{"resolver":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ","bundle":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/bundle.json","state":"https://pith.science/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJCWFT3GPT2XPV3MIFL6NXHLDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JJCWFT3GPT2XPV3MIFL6NXHLDZ","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":"3da4915cb77dcc0f70badef7e920da60e9cae88122d57fcaaa6b5b4e13c57e57","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-14T00:42:20Z","title_canon_sha256":"89e7986643242a4b0af4e323013bdf65d83926d214e417c1462fa3d8bd4fbc37"},"schema_version":"1.0","source":{"id":"2211.07058","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.07058","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"2211.07058v2","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07058","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"JJCWFT3GPT2X","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"pith_short_16","alias_value":"JJCWFT3GPT2XPV3M","created_at":"2026-07-05T07:03:19Z"},{"alias_kind":"pith_short_8","alias_value":"JJCWFT3G","created_at":"2026-07-05T07:03:19Z"}],"graph_snapshots":[{"event_id":"sha256:09aabf1b55e42c8d2c80a5747490372c6605e074566e21647a9750f6dd14f429","target":"graph","created_at":"2026-07-05T07:03:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.07058/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amir Abboud, Karl Bringmann, Nick Fischer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-14T00:42:20Z","title":"Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07058","kind":"arxiv","version":2},"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:1acb194d244ca186b20236d1a60040bdd5f4996cea1e70c2cc26998b311ea881","target":"record","created_at":"2026-07-05T07:03:19Z","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":"3da4915cb77dcc0f70badef7e920da60e9cae88122d57fcaaa6b5b4e13c57e57","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-14T00:42:20Z","title_canon_sha256":"89e7986643242a4b0af4e323013bdf65d83926d214e417c1462fa3d8bd4fbc37"},"schema_version":"1.0","source":{"id":"2211.07058","kind":"arxiv","version":2}},"canonical_sha256":"4a4562cf667cf577d76c4157e6dceb1e48a504035d8d7dd302efb773f2490c3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a4562cf667cf577d76c4157e6dceb1e48a504035d8d7dd302efb773f2490c3b","first_computed_at":"2026-07-05T07:03:19.350138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:03:19.350138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xHjrycEztx/P5vDncgtBxrd+gj+xWTMpbsMVlqPPwWr+jFrORTRL//TgDQ69mLmbylu9Ws0hCxM6n6FFAybqAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:03:19.350536Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.07058","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1acb194d244ca186b20236d1a60040bdd5f4996cea1e70c2cc26998b311ea881","sha256:09aabf1b55e42c8d2c80a5747490372c6605e074566e21647a9750f6dd14f429"],"state_sha256":"83af1177443025bf70de983e6b63d15d4da304ba172972d8c86132da9a0aa58d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+zoDL56CbISzCqt4n2UuMVd1XoDzEB+oDXSDA53C/gtsldE2424BUaqHmYTW+psQEvCBuCwIK4rJ/8jwNQgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T13:53:35.662850Z","bundle_sha256":"0b9f11892d55e09862e31565c987688e66c1a344a170d8316a534e870501825e"}}