{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JM5S3NM7K7MHYVGFIGW5BIDG2F","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":"03a1a8b6e21f7ecc8b577a602a28c968905a50810cb0aeb1dce0dc6f91f35d4a","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-23T19:11:32Z","title_canon_sha256":"fc1695c67a06e6c65389b54abafc7387df3e6ce8f1e33250ceefa4746880ef75"},"schema_version":"1.0","source":{"id":"2507.17878","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.17878","created_at":"2026-05-17T23:39:04Z"},{"alias_kind":"arxiv_version","alias_value":"2507.17878v4","created_at":"2026-05-17T23:39:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17878","created_at":"2026-05-17T23:39:04Z"},{"alias_kind":"pith_short_12","alias_value":"JM5S3NM7K7MH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JM5S3NM7K7MHYVGF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JM5S3NM7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:f6768b06732c1b9f2bdfa4cf5f34810c8e2af527f9733c8f4956486a972b7617","target":"graph","created_at":"2026-05-17T23:39:04Z","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":"We introduce a new notion of sparsification, called \\emph{strong sparsification}, in which constraints are not removed but variables can be merged. As our main result, we present a strong sparsification algorithm for 1-in-3-SAT. The correctness of the algorithm relies on establishing a sub-quadratic bound on the size of certain sets of vectors in $\\mathbb{F}_2^d$. This result, obtained using the recent \\emph{Polynomial Freiman-Ruzsa Theorem} (Gowers, Green, Manners and Tao, Ann. Math. 2025), could be of independent interest. As an application, we improve the state-of-the-art algorithm for appr","authors_text":"Benjamin Bedert, Karolina Okrasa, Stanislav \\v{Z}ivn\\'y, Tamio-Vesa Nakajima","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-23T19:11:32Z","title":"Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17878","kind":"arxiv","version":4},"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:eb6e6681cc0c0fed8abc64e5a69e5a79a2ce20a200529397e666d707b9686432","target":"record","created_at":"2026-05-17T23:39:04Z","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":"03a1a8b6e21f7ecc8b577a602a28c968905a50810cb0aeb1dce0dc6f91f35d4a","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-23T19:11:32Z","title_canon_sha256":"fc1695c67a06e6c65389b54abafc7387df3e6ce8f1e33250ceefa4746880ef75"},"schema_version":"1.0","source":{"id":"2507.17878","kind":"arxiv","version":4}},"canonical_sha256":"4b3b2db59f57d87c54c541add0a066d17654ac6029d23d62a0eb7344701080d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b3b2db59f57d87c54c541add0a066d17654ac6029d23d62a0eb7344701080d2","first_computed_at":"2026-05-17T23:39:04.855900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:04.855900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7bIqJeeSKKLtj1++KO/4n7gNm4XxzBLp43JZcNiW56E2YpqD7rd3Sc88QGsaKqd59JrIqQmVOLmFkKJotCmkCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:04.857562Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.17878","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb6e6681cc0c0fed8abc64e5a69e5a79a2ce20a200529397e666d707b9686432","sha256:f6768b06732c1b9f2bdfa4cf5f34810c8e2af527f9733c8f4956486a972b7617"],"state_sha256":"d78f6b1212c423546c840e99df2bc69627b2a28293ebfc6dec1837973db86f96"}