{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C7WSY4NHGJBUES4PUR4I32KH32","short_pith_number":"pith:C7WSY4NH","schema_version":"1.0","canonical_sha256":"17ed2c71a73243424b8fa4788de947deb2b2b6e74a331e86109a627fc5c3f9be","source":{"kind":"arxiv","id":"1705.01703","version":3},"attestation_state":"computed","paper":{"title":"New bounds for Szemer\\'edi's theorem, III: A polylogarithmic bound for $r_4(N)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Green, Terence Tao","submitted_at":"2017-05-04T04:40:39Z","abstract_excerpt":"Define $r_4(N)$ to be the largest cardinality of a set $A \\subset \\{1,\\dots,N\\}$ which does not contain four elements in arithmetic progression. In 1998 Gowers proved that \\[ r_4(N) \\ll N(\\log \\log N)^{-c}\\] for some absolute constant $c>0$. In 2005, the authors improved this to \\[ r_4(N) \\ll N e^{-c\\sqrt{\\log\\log N}}.\\] In this paper we further improve this to \\[ r_4(N) \\ll N(\\log N)^{-c},\\] which appears to be the limit of our methods."},"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":"1705.01703","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-04T04:40:39Z","cross_cats_sorted":[],"title_canon_sha256":"962a29f207663e628ff6ba82b5c0ff91360c68ded0a4496bb4c213bb9e9c4c71","abstract_canon_sha256":"9c688c42b4908ee9b7e7caff3a25697daafa50548f6ec41eea9bb958ee62a1a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:18.057841Z","signature_b64":"CDki2On9ckUUF1mW1VrvSEjbK+k04hQLtHhpnPZOf9uLnhEWPGmhvv535E5Y5qVgam6J9CWgVdIayQovvPvWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17ed2c71a73243424b8fa4788de947deb2b2b6e74a331e86109a627fc5c3f9be","last_reissued_at":"2026-05-18T00:38:18.057245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:18.057245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds for Szemer\\'edi's theorem, III: A polylogarithmic bound for $r_4(N)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Green, Terence Tao","submitted_at":"2017-05-04T04:40:39Z","abstract_excerpt":"Define $r_4(N)$ to be the largest cardinality of a set $A \\subset \\{1,\\dots,N\\}$ which does not contain four elements in arithmetic progression. In 1998 Gowers proved that \\[ r_4(N) \\ll N(\\log \\log N)^{-c}\\] for some absolute constant $c>0$. In 2005, the authors improved this to \\[ r_4(N) \\ll N e^{-c\\sqrt{\\log\\log N}}.\\] In this paper we further improve this to \\[ r_4(N) \\ll N(\\log N)^{-c},\\] which appears to be the limit of our methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01703","kind":"arxiv","version":3},"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":"1705.01703","created_at":"2026-05-18T00:38:18.057341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01703v3","created_at":"2026-05-18T00:38:18.057341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01703","created_at":"2026-05-18T00:38:18.057341+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7WSY4NHGJBU","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7WSY4NHGJBUES4P","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7WSY4NH","created_at":"2026-05-18T12:31:10.602751+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/C7WSY4NHGJBUES4PUR4I32KH32","json":"https://pith.science/pith/C7WSY4NHGJBUES4PUR4I32KH32.json","graph_json":"https://pith.science/api/pith-number/C7WSY4NHGJBUES4PUR4I32KH32/graph.json","events_json":"https://pith.science/api/pith-number/C7WSY4NHGJBUES4PUR4I32KH32/events.json","paper":"https://pith.science/paper/C7WSY4NH"},"agent_actions":{"view_html":"https://pith.science/pith/C7WSY4NHGJBUES4PUR4I32KH32","download_json":"https://pith.science/pith/C7WSY4NHGJBUES4PUR4I32KH32.json","view_paper":"https://pith.science/paper/C7WSY4NH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01703&json=true","fetch_graph":"https://pith.science/api/pith-number/C7WSY4NHGJBUES4PUR4I32KH32/graph.json","fetch_events":"https://pith.science/api/pith-number/C7WSY4NHGJBUES4PUR4I32KH32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7WSY4NHGJBUES4PUR4I32KH32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7WSY4NHGJBUES4PUR4I32KH32/action/storage_attestation","attest_author":"https://pith.science/pith/C7WSY4NHGJBUES4PUR4I32KH32/action/author_attestation","sign_citation":"https://pith.science/pith/C7WSY4NHGJBUES4PUR4I32KH32/action/citation_signature","submit_replication":"https://pith.science/pith/C7WSY4NHGJBUES4PUR4I32KH32/action/replication_record"}},"created_at":"2026-05-18T00:38:18.057341+00:00","updated_at":"2026-05-18T00:38:18.057341+00:00"}