{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XKOGU3NYBQSGO6ERTK3ERVRT7Q","short_pith_number":"pith:XKOGU3NY","schema_version":"1.0","canonical_sha256":"ba9c6a6db80c246778919ab648d633fc05ab8f34e9a8f6b091a446ce06776beb","source":{"kind":"arxiv","id":"2302.05537","version":6},"attestation_state":"computed","paper":{"title":"Strong Bounds for 3-Progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Raghu Meka, Zander Kelley","submitted_at":"2023-02-10T22:40:05Z","abstract_excerpt":"We show that for some constant $\\beta > 0$, any subset $A$ of integers $\\{1,\\ldots,N\\}$ of size at least $2^{-O((\\log N)^\\beta)} \\cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic progressions were known to exist only for sets of size at least $N/(\\log N)^{1 + c}$ for a constant $c > 0$.\n  Our approach is first to develop new analytic techniques for addressing some related questions in the finite-field setting and then to apply some analogous variants of these same techniques, suitably adapted for the more complicated setting of integers."},"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":"2302.05537","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2023-02-10T22:40:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"63dc16f3680302687053576d7576eee2bd9a71653dcf76b8493432c8569eafd9","abstract_canon_sha256":"43eb3a98294f4907db2821fd8299cd3a9cdc931158cd930caef9f969598ab07b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:18.616338Z","signature_b64":"zXKvFTl16zCGDUgqF/IrN2AGawUKLRiXoiYkcJOQEmKgb8pm6iQNO0w3rgPlMr3T6Xxc+vGjIh/PqVbjRSD1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba9c6a6db80c246778919ab648d633fc05ab8f34e9a8f6b091a446ce06776beb","last_reissued_at":"2026-07-05T09:27:18.615814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:18.615814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Bounds for 3-Progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Raghu Meka, Zander Kelley","submitted_at":"2023-02-10T22:40:05Z","abstract_excerpt":"We show that for some constant $\\beta > 0$, any subset $A$ of integers $\\{1,\\ldots,N\\}$ of size at least $2^{-O((\\log N)^\\beta)} \\cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic progressions were known to exist only for sets of size at least $N/(\\log N)^{1 + c}$ for a constant $c > 0$.\n  Our approach is first to develop new analytic techniques for addressing some related questions in the finite-field setting and then to apply some analogous variants of these same techniques, suitably adapted for the more complicated setting of integers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05537","kind":"arxiv","version":6},"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/2302.05537/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.05537","created_at":"2026-07-05T09:27:18.615875+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.05537v6","created_at":"2026-07-05T09:27:18.615875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05537","created_at":"2026-07-05T09:27:18.615875+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKOGU3NYBQSG","created_at":"2026-07-05T09:27:18.615875+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKOGU3NYBQSGO6ER","created_at":"2026-07-05T09:27:18.615875+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKOGU3NY","created_at":"2026-07-05T09:27:18.615875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01780","citing_title":"Hitting Arithmetic Progressions at the Square-Root Scale","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04016","citing_title":"Witness-split + window-cardinality refinement for $r_3(N)$: Architecture, empirical results, and a structural hard pocket","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XKOGU3NYBQSGO6ERTK3ERVRT7Q","json":"https://pith.science/pith/XKOGU3NYBQSGO6ERTK3ERVRT7Q.json","graph_json":"https://pith.science/api/pith-number/XKOGU3NYBQSGO6ERTK3ERVRT7Q/graph.json","events_json":"https://pith.science/api/pith-number/XKOGU3NYBQSGO6ERTK3ERVRT7Q/events.json","paper":"https://pith.science/paper/XKOGU3NY"},"agent_actions":{"view_html":"https://pith.science/pith/XKOGU3NYBQSGO6ERTK3ERVRT7Q","download_json":"https://pith.science/pith/XKOGU3NYBQSGO6ERTK3ERVRT7Q.json","view_paper":"https://pith.science/paper/XKOGU3NY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.05537&json=true","fetch_graph":"https://pith.science/api/pith-number/XKOGU3NYBQSGO6ERTK3ERVRT7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/XKOGU3NYBQSGO6ERTK3ERVRT7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKOGU3NYBQSGO6ERTK3ERVRT7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKOGU3NYBQSGO6ERTK3ERVRT7Q/action/storage_attestation","attest_author":"https://pith.science/pith/XKOGU3NYBQSGO6ERTK3ERVRT7Q/action/author_attestation","sign_citation":"https://pith.science/pith/XKOGU3NYBQSGO6ERTK3ERVRT7Q/action/citation_signature","submit_replication":"https://pith.science/pith/XKOGU3NYBQSGO6ERTK3ERVRT7Q/action/replication_record"}},"created_at":"2026-07-05T09:27:18.615875+00:00","updated_at":"2026-07-05T09:27:18.615875+00:00"}