{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KCH2Z455BZIZ7CMOCO552MY4NN","short_pith_number":"pith:KCH2Z455","schema_version":"1.0","canonical_sha256":"508facf3bd0e519f898e13bbdd331c6b64838255d5849df8f0349c3f8cd6273f","source":{"kind":"arxiv","id":"1210.6917","version":1},"attestation_state":"computed","paper":{"title":"Sampling-based proofs of almost-periodicity results and algorithmic applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Eli Ben-Sasson, Julia Wolf, Madhur Tulsiani, Noga Ron-Zewi","submitted_at":"2012-10-25T17:24:57Z","abstract_excerpt":"We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has had far-reaching implications in additive combinatorics. We provide an alternative (and L^p-norm free) point of view, which allows for proofs to easily be converted to probabilistic algorithms that decide membership in almost-periodic sumsets of dense subsets of F_2^n.\n  As an application, we give a new algorithmic version of the quasipolynomial Bogolyubov-Ruzsa lemma recently proved by Sanders. Together with the resu"},"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":"1210.6917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-25T17:24:57Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"5885f640a43c0458ab86f233cadc1dee1389dccaf8cabb6042622d26fdf73a38","abstract_canon_sha256":"93909d9c0c1a9fc4d430041993988baad438c0842195e8e0d9e2201005d03921"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:28.903381Z","signature_b64":"Blpqsuw/slOowceQ7AU6FYKDj3ldcD3s4U9W80pX8Rm8CDoy6sxqwOaIvfuumyg5ThURf8GetURxwFlH7nylAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"508facf3bd0e519f898e13bbdd331c6b64838255d5849df8f0349c3f8cd6273f","last_reissued_at":"2026-05-17T23:43:28.902739Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:28.902739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling-based proofs of almost-periodicity results and algorithmic applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Eli Ben-Sasson, Julia Wolf, Madhur Tulsiani, Noga Ron-Zewi","submitted_at":"2012-10-25T17:24:57Z","abstract_excerpt":"We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has had far-reaching implications in additive combinatorics. We provide an alternative (and L^p-norm free) point of view, which allows for proofs to easily be converted to probabilistic algorithms that decide membership in almost-periodic sumsets of dense subsets of F_2^n.\n  As an application, we give a new algorithmic version of the quasipolynomial Bogolyubov-Ruzsa lemma recently proved by Sanders. Together with the resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6917","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":""},"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":"1210.6917","created_at":"2026-05-17T23:43:28.902834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6917v1","created_at":"2026-05-17T23:43:28.902834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6917","created_at":"2026-05-17T23:43:28.902834+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCH2Z455BZIZ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCH2Z455BZIZ7CMO","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCH2Z455","created_at":"2026-05-18T12:27:11.947152+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/KCH2Z455BZIZ7CMOCO552MY4NN","json":"https://pith.science/pith/KCH2Z455BZIZ7CMOCO552MY4NN.json","graph_json":"https://pith.science/api/pith-number/KCH2Z455BZIZ7CMOCO552MY4NN/graph.json","events_json":"https://pith.science/api/pith-number/KCH2Z455BZIZ7CMOCO552MY4NN/events.json","paper":"https://pith.science/paper/KCH2Z455"},"agent_actions":{"view_html":"https://pith.science/pith/KCH2Z455BZIZ7CMOCO552MY4NN","download_json":"https://pith.science/pith/KCH2Z455BZIZ7CMOCO552MY4NN.json","view_paper":"https://pith.science/paper/KCH2Z455","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6917&json=true","fetch_graph":"https://pith.science/api/pith-number/KCH2Z455BZIZ7CMOCO552MY4NN/graph.json","fetch_events":"https://pith.science/api/pith-number/KCH2Z455BZIZ7CMOCO552MY4NN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCH2Z455BZIZ7CMOCO552MY4NN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCH2Z455BZIZ7CMOCO552MY4NN/action/storage_attestation","attest_author":"https://pith.science/pith/KCH2Z455BZIZ7CMOCO552MY4NN/action/author_attestation","sign_citation":"https://pith.science/pith/KCH2Z455BZIZ7CMOCO552MY4NN/action/citation_signature","submit_replication":"https://pith.science/pith/KCH2Z455BZIZ7CMOCO552MY4NN/action/replication_record"}},"created_at":"2026-05-17T23:43:28.902834+00:00","updated_at":"2026-05-17T23:43:28.902834+00:00"}