{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LONJLWX5YI5X5FTYQTPCPMTO4V","short_pith_number":"pith:LONJLWX5","schema_version":"1.0","canonical_sha256":"5b9a95dafdc23b7e967884de27b26ee569c3cc5459d3d2b47632e1f6c58a099a","source":{"kind":"arxiv","id":"2312.10776","version":2},"attestation_state":"computed","paper":{"title":"Improved bounds for five-term arithmetic progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Ashwin Sah, James Leng, Mehtaab Sawhney","submitted_at":"2023-12-17T17:53:11Z","abstract_excerpt":"Let $r_5(N)$ be the largest cardinality of a set in $\\{1,\\ldots,N\\}$ which does not contain $5$ elements in arithmetic progression. Then there exists a constant $c\\in (0,1)$ such that \\[r_5(N)\\ll \\frac{N}{\\exp((\\log\\log N)^{c})}.\\] Our work is a consequence of recent improved bounds on the $U^4$-inverse theorem of the first author and the fact that $3$-step nilsequences may be approximated by locally cubic functions on shifted Bohr sets. This combined with the density increment strategy of Heath-Brown and Szemer{\\'e}di, codified by Green and Tao, gives the desired result."},"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":"2312.10776","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2023-12-17T17:53:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bedfaf4f8ab6e656f0b67401d0c38406bc14b5bb0c159b32685d5a1a189d6376","abstract_canon_sha256":"719df14d885f9b505253ae0ce9a5fc7b5f9ca12944860bc5e453196ea3b9be1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:26.943432Z","signature_b64":"GFYBbScpa9B7yhLlUGFaTLwA+4jIdcbJTJRYh+F/kMfKt7ZLb2V1KdBah8IdfXNOS4Suf5eLs0Q0SNiRq3xYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b9a95dafdc23b7e967884de27b26ee569c3cc5459d3d2b47632e1f6c58a099a","last_reissued_at":"2026-07-05T08:06:26.943016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:26.943016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved bounds for five-term arithmetic progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Ashwin Sah, James Leng, Mehtaab Sawhney","submitted_at":"2023-12-17T17:53:11Z","abstract_excerpt":"Let $r_5(N)$ be the largest cardinality of a set in $\\{1,\\ldots,N\\}$ which does not contain $5$ elements in arithmetic progression. Then there exists a constant $c\\in (0,1)$ such that \\[r_5(N)\\ll \\frac{N}{\\exp((\\log\\log N)^{c})}.\\] Our work is a consequence of recent improved bounds on the $U^4$-inverse theorem of the first author and the fact that $3$-step nilsequences may be approximated by locally cubic functions on shifted Bohr sets. This combined with the density increment strategy of Heath-Brown and Szemer{\\'e}di, codified by Green and Tao, gives the desired result."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.10776","kind":"arxiv","version":2},"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/2312.10776/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":"2312.10776","created_at":"2026-07-05T08:06:26.943072+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.10776v2","created_at":"2026-07-05T08:06:26.943072+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.10776","created_at":"2026-07-05T08:06:26.943072+00:00"},{"alias_kind":"pith_short_12","alias_value":"LONJLWX5YI5X","created_at":"2026-07-05T08:06:26.943072+00:00"},{"alias_kind":"pith_short_16","alias_value":"LONJLWX5YI5X5FTY","created_at":"2026-07-05T08:06:26.943072+00:00"},{"alias_kind":"pith_short_8","alias_value":"LONJLWX5","created_at":"2026-07-05T08:06:26.943072+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15137","citing_title":"Reasonable Bounds for Combinatorial Lines of Length Three","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LONJLWX5YI5X5FTYQTPCPMTO4V","json":"https://pith.science/pith/LONJLWX5YI5X5FTYQTPCPMTO4V.json","graph_json":"https://pith.science/api/pith-number/LONJLWX5YI5X5FTYQTPCPMTO4V/graph.json","events_json":"https://pith.science/api/pith-number/LONJLWX5YI5X5FTYQTPCPMTO4V/events.json","paper":"https://pith.science/paper/LONJLWX5"},"agent_actions":{"view_html":"https://pith.science/pith/LONJLWX5YI5X5FTYQTPCPMTO4V","download_json":"https://pith.science/pith/LONJLWX5YI5X5FTYQTPCPMTO4V.json","view_paper":"https://pith.science/paper/LONJLWX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.10776&json=true","fetch_graph":"https://pith.science/api/pith-number/LONJLWX5YI5X5FTYQTPCPMTO4V/graph.json","fetch_events":"https://pith.science/api/pith-number/LONJLWX5YI5X5FTYQTPCPMTO4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LONJLWX5YI5X5FTYQTPCPMTO4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LONJLWX5YI5X5FTYQTPCPMTO4V/action/storage_attestation","attest_author":"https://pith.science/pith/LONJLWX5YI5X5FTYQTPCPMTO4V/action/author_attestation","sign_citation":"https://pith.science/pith/LONJLWX5YI5X5FTYQTPCPMTO4V/action/citation_signature","submit_replication":"https://pith.science/pith/LONJLWX5YI5X5FTYQTPCPMTO4V/action/replication_record"}},"created_at":"2026-07-05T08:06:26.943072+00:00","updated_at":"2026-07-05T08:06:26.943072+00:00"}