{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BUU3BFPGYTXOM7OC3F22YHIEEE","short_pith_number":"pith:BUU3BFPG","schema_version":"1.0","canonical_sha256":"0d29b095e6c4eee67dc2d975ac1d04212158527880204188eb74c98ab7610905","source":{"kind":"arxiv","id":"2605.13628","version":1},"attestation_state":"computed","paper":{"title":"A note on arithmetic progressions with restricted differences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"When S is a large subset of the finite field containing zero, any subset of the n-dimensional vector space over the field that avoids three-term arithmetic progressions with differences in S to the n has size at most q to the power (1 minus","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"David Conlon, Huy Tuan Pham, Jacob Fox","submitted_at":"2026-05-13T14:55:15Z","abstract_excerpt":"In this note, we show how to adapt Tao's slice rank method to extend the Ellenberg--Gijswijt theorem on cap sets to the problem of forbidding arithmetic progressions with restricted differences. In particular, we show that if $q$ is an odd prime power, there is $\\varepsilon_q>0$ such that if $S \\subseteq \\mathbb{F}_q$ with $0 \\in S$ and $|S|>(q+1)/2$ and $A \\subseteq \\mathbb{F}_q^n$ contains no three-term arithmetic progression whose common difference is in $S^n$, then $|A| \\leq q^{(1-\\varepsilon_q)n}$."},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T14:55:15Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"5d55817c2d909f340d60333c7112be10af9d7ba0e09b2f25121503f04d33d7ba","abstract_canon_sha256":"fd89253f7df6642c7e44dba1933648e95f3df67b502b957ef8ee61bac9d75e99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:17.782195Z","signature_b64":"qGxGsmJjqT3jHYB/qcVub0Inxt/Kt215oF1a6rpXVPbQGGscLGqiHNRRB1hvx+I8aKIrz20kBb9xrVnb9YESCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d29b095e6c4eee67dc2d975ac1d04212158527880204188eb74c98ab7610905","last_reissued_at":"2026-05-18T02:44:17.781766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:17.781766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on arithmetic progressions with restricted differences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"When S is a large subset of the finite field containing zero, any subset of the n-dimensional vector space over the field that avoids three-term arithmetic progressions with differences in S to the n has size at most q to the power (1 minus","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"David Conlon, Huy Tuan Pham, Jacob Fox","submitted_at":"2026-05-13T14:55:15Z","abstract_excerpt":"In this note, we show how to adapt Tao's slice rank method to extend the Ellenberg--Gijswijt theorem on cap sets to the problem of forbidding arithmetic progressions with restricted differences. In particular, we show that if $q$ is an odd prime power, there is $\\varepsilon_q>0$ such that if $S \\subseteq \\mathbb{F}_q$ with $0 \\in S$ and $|S|>(q+1)/2$ and $A \\subseteq \\mathbb{F}_q^n$ contains no three-term arithmetic progression whose common difference is in $S^n$, then $|A| \\leq q^{(1-\\varepsilon_q)n}$."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"if q is an odd prime power, there is ε_q>0 such that if S ⊆ F_q with 0 ∈ S and |S|>(q+1)/2 and A ⊆ F_q^n contains no three-term arithmetic progression whose common difference is in S^n, then |A| ≤ q^{(1-ε_q)n}.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That Tao's slice rank method can be directly adapted to the setting of restricted differences without losing the polynomial rank bounds or requiring additional unstated conditions on S or q.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Adapting the slice rank method yields that sets in F_q^n without 3-APs with differences in S^n have size at most q^{(1-ε_q)n} when |S|>(q+1)/2 and q is an odd prime power.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"When S is a large subset of the finite field containing zero, any subset of the n-dimensional vector space over the field that avoids three-term arithmetic progressions with differences in S to the n has size at most q to the power (1 minus","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6012f011326620c9658b27defdd6e5bc194d043ad0a2a755bb8b855c80cf5fbb"},"source":{"id":"2605.13628","kind":"arxiv","version":1},"verdict":{"id":"47331c4b-97c8-4031-90ba-d1b3bd75f613","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:47:29.202143Z","strongest_claim":"if q is an odd prime power, there is ε_q>0 such that if S ⊆ F_q with 0 ∈ S and |S|>(q+1)/2 and A ⊆ F_q^n contains no three-term arithmetic progression whose common difference is in S^n, then |A| ≤ q^{(1-ε_q)n}.","one_line_summary":"Adapting the slice rank method yields that sets in F_q^n without 3-APs with differences in S^n have size at most q^{(1-ε_q)n} when |S|>(q+1)/2 and q is an odd prime power.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That Tao's slice rank method can be directly adapted to the setting of restricted differences without losing the polynomial rank bounds or requiring additional unstated conditions on S or q.","pith_extraction_headline":"When S is a large subset of the finite field containing zero, any subset of the n-dimensional vector space over the field that avoids three-term arithmetic progressions with differences in S to the n has size at most q to the power (1 minus"},"references":{"count":16,"sample":[{"doi":"","year":2025,"title":"A. Bhangale, S. Khot, Y. P. Liu, and D. Minzer, On inverse theorems and combinatorial lines,FOCS 2025, 1672–1684","work_id":"21a60064-74aa-47f2-879a-c1d24d1a596c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"A. Bhangale, S. Khot, and D. Minzer, Effective bounds for restricted 3-arithmetic progressions inFn p, Discrete Anal.2024, Paper No. 16, 22 pp","work_id":"fd36ba77-6168-4997-9123-69a3e0276210","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"J. Blasiak, T. Church, H. Cohn, J. A. Grochow, E. Naslund, W. F. Sawin, and C. Umans, On cap sets and the group-theoretic approach to matrix multiplication,Discrete Anal.2017, Paper No. 3, 27 pp","work_id":"dbcfabb5-d858-45fb-965f-b8dd562d96cc","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"E. Croot, V. F. Lev, and P. P. Pach, Progression-free sets inZn 4 are exponentially small,Ann. of Math.185(2017), 331–337","work_id":"c3b6dcf2-6037-45ef-a893-81bef04eb154","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"J. S. Ellenberg and D. Gijswijt, On large subsets ofFn q with no three-term arithmetic progression, Ann. of Math.185(2017), 339–343","work_id":"bff001af-e58f-4af9-baa0-659028ade260","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":16,"snapshot_sha256":"2254809aa286acca99c60e62e0dfea86cbb56eab4d0fb86d23ba33fcfa520ff5","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":"2605.13628","created_at":"2026-05-18T02:44:17.781829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13628v1","created_at":"2026-05-18T02:44:17.781829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13628","created_at":"2026-05-18T02:44:17.781829+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUU3BFPGYTXO","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUU3BFPGYTXOM7OC","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUU3BFPG","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/BUU3BFPGYTXOM7OC3F22YHIEEE","json":"https://pith.science/pith/BUU3BFPGYTXOM7OC3F22YHIEEE.json","graph_json":"https://pith.science/api/pith-number/BUU3BFPGYTXOM7OC3F22YHIEEE/graph.json","events_json":"https://pith.science/api/pith-number/BUU3BFPGYTXOM7OC3F22YHIEEE/events.json","paper":"https://pith.science/paper/BUU3BFPG"},"agent_actions":{"view_html":"https://pith.science/pith/BUU3BFPGYTXOM7OC3F22YHIEEE","download_json":"https://pith.science/pith/BUU3BFPGYTXOM7OC3F22YHIEEE.json","view_paper":"https://pith.science/paper/BUU3BFPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13628&json=true","fetch_graph":"https://pith.science/api/pith-number/BUU3BFPGYTXOM7OC3F22YHIEEE/graph.json","fetch_events":"https://pith.science/api/pith-number/BUU3BFPGYTXOM7OC3F22YHIEEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUU3BFPGYTXOM7OC3F22YHIEEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUU3BFPGYTXOM7OC3F22YHIEEE/action/storage_attestation","attest_author":"https://pith.science/pith/BUU3BFPGYTXOM7OC3F22YHIEEE/action/author_attestation","sign_citation":"https://pith.science/pith/BUU3BFPGYTXOM7OC3F22YHIEEE/action/citation_signature","submit_replication":"https://pith.science/pith/BUU3BFPGYTXOM7OC3F22YHIEEE/action/replication_record"}},"created_at":"2026-05-18T02:44:17.781829+00:00","updated_at":"2026-05-18T02:44:17.781829+00:00"}