{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JM5S3NM7K7MHYVGFIGW5BIDG2F","short_pith_number":"pith:JM5S3NM7","schema_version":"1.0","canonical_sha256":"4b3b2db59f57d87c54c541add0a066d17654ac6029d23d62a0eb7344701080d2","source":{"kind":"arxiv","id":"2507.17878","version":4},"attestation_state":"computed","paper":{"title":"Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Benjamin Bedert, Karolina Okrasa, Stanislav \\v{Z}ivn\\'y, Tamio-Vesa Nakajima","submitted_at":"2025-07-23T19:11:32Z","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"},"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":"2507.17878","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-23T19:11:32Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"fc1695c67a06e6c65389b54abafc7387df3e6ce8f1e33250ceefa4746880ef75","abstract_canon_sha256":"03a1a8b6e21f7ecc8b577a602a28c968905a50810cb0aeb1dce0dc6f91f35d4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:04.857562Z","signature_b64":"7bIqJeeSKKLtj1++KO/4n7gNm4XxzBLp43JZcNiW56E2YpqD7rd3Sc88QGsaKqd59JrIqQmVOLmFkKJotCmkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b3b2db59f57d87c54c541add0a066d17654ac6029d23d62a0eb7344701080d2","last_reissued_at":"2026-05-17T23:39:04.855900Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:04.855900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Benjamin Bedert, Karolina Okrasa, Stanislav \\v{Z}ivn\\'y, Tamio-Vesa Nakajima","submitted_at":"2025-07-23T19:11:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17878","kind":"arxiv","version":4},"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":"2507.17878","created_at":"2026-05-17T23:39:04.856363+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.17878v4","created_at":"2026-05-17T23:39:04.856363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17878","created_at":"2026-05-17T23:39:04.856363+00:00"},{"alias_kind":"pith_short_12","alias_value":"JM5S3NM7K7MH","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"JM5S3NM7K7MHYVGF","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"JM5S3NM7","created_at":"2026-05-18T12:33:37.589309+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/JM5S3NM7K7MHYVGFIGW5BIDG2F","json":"https://pith.science/pith/JM5S3NM7K7MHYVGFIGW5BIDG2F.json","graph_json":"https://pith.science/api/pith-number/JM5S3NM7K7MHYVGFIGW5BIDG2F/graph.json","events_json":"https://pith.science/api/pith-number/JM5S3NM7K7MHYVGFIGW5BIDG2F/events.json","paper":"https://pith.science/paper/JM5S3NM7"},"agent_actions":{"view_html":"https://pith.science/pith/JM5S3NM7K7MHYVGFIGW5BIDG2F","download_json":"https://pith.science/pith/JM5S3NM7K7MHYVGFIGW5BIDG2F.json","view_paper":"https://pith.science/paper/JM5S3NM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.17878&json=true","fetch_graph":"https://pith.science/api/pith-number/JM5S3NM7K7MHYVGFIGW5BIDG2F/graph.json","fetch_events":"https://pith.science/api/pith-number/JM5S3NM7K7MHYVGFIGW5BIDG2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JM5S3NM7K7MHYVGFIGW5BIDG2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JM5S3NM7K7MHYVGFIGW5BIDG2F/action/storage_attestation","attest_author":"https://pith.science/pith/JM5S3NM7K7MHYVGFIGW5BIDG2F/action/author_attestation","sign_citation":"https://pith.science/pith/JM5S3NM7K7MHYVGFIGW5BIDG2F/action/citation_signature","submit_replication":"https://pith.science/pith/JM5S3NM7K7MHYVGFIGW5BIDG2F/action/replication_record"}},"created_at":"2026-05-17T23:39:04.856363+00:00","updated_at":"2026-05-17T23:39:04.856363+00:00"}