{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C7VCMW3QR26RCFJY3ZXEIUF66Y","short_pith_number":"pith:C7VCMW3Q","schema_version":"1.0","canonical_sha256":"17ea265b708ebd111538de6e4450bef635841fd1a0bec27713f67e88c8f4026a","source":{"kind":"arxiv","id":"1711.04183","version":2},"attestation_state":"computed","paper":{"title":"A Constructive Lower Bound on Szemer\\'edi's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Vladislav Taranchuk","submitted_at":"2017-11-11T18:54:52Z","abstract_excerpt":"Let $r_k(n)$ denote the maximum cardinality of a set $A \\subset \\{1,2, \\dots, n \\}$ such that $A$ does not contain a $k$-term arithmetic progression. In this paper, we give a method of constructing such a set and prove the lower bound $n^{1-\\frac{c_k}{k \\ln k}} < r_k(n)$ where $k$ is prime, and $c_k \\rightarrow 1$ as $k \\rightarrow \\infty$. This bound is the best known for an increasingly large interval of $n$ as we choose larger and larger $k$. We also demonstrate that one can prove or disprove a conjecture of Erd\\H{o}s on arithmetic progressions in large sets once tight enough bounds on $r_k"},"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":"1711.04183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-11T18:54:52Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"e7f554941c3d48e00b050205fbb257f4f8874a6bbfc302fb92f179f825c3736f","abstract_canon_sha256":"2b2729cad9c617273f99e0a4478c0d4ece76a5316f18e321631e8a4e6963f161"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:16.091511Z","signature_b64":"+oCdKKdDZ3K50GziWCdZctustpqm0k2mrK9bUN4UhWmo1dONinr3vDC+ghbCtSGQW+p5O7MQWGKt9ThbnrbqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17ea265b708ebd111538de6e4450bef635841fd1a0bec27713f67e88c8f4026a","last_reissued_at":"2026-05-18T00:30:16.090652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:16.090652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constructive Lower Bound on Szemer\\'edi's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Vladislav Taranchuk","submitted_at":"2017-11-11T18:54:52Z","abstract_excerpt":"Let $r_k(n)$ denote the maximum cardinality of a set $A \\subset \\{1,2, \\dots, n \\}$ such that $A$ does not contain a $k$-term arithmetic progression. In this paper, we give a method of constructing such a set and prove the lower bound $n^{1-\\frac{c_k}{k \\ln k}} < r_k(n)$ where $k$ is prime, and $c_k \\rightarrow 1$ as $k \\rightarrow \\infty$. This bound is the best known for an increasingly large interval of $n$ as we choose larger and larger $k$. We also demonstrate that one can prove or disprove a conjecture of Erd\\H{o}s on arithmetic progressions in large sets once tight enough bounds on $r_k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04183","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":""},"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":"1711.04183","created_at":"2026-05-18T00:30:16.090792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04183v2","created_at":"2026-05-18T00:30:16.090792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04183","created_at":"2026-05-18T00:30:16.090792+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7VCMW3QR26R","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7VCMW3QR26RCFJY","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7VCMW3Q","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/C7VCMW3QR26RCFJY3ZXEIUF66Y","json":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y.json","graph_json":"https://pith.science/api/pith-number/C7VCMW3QR26RCFJY3ZXEIUF66Y/graph.json","events_json":"https://pith.science/api/pith-number/C7VCMW3QR26RCFJY3ZXEIUF66Y/events.json","paper":"https://pith.science/paper/C7VCMW3Q"},"agent_actions":{"view_html":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y","download_json":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y.json","view_paper":"https://pith.science/paper/C7VCMW3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04183&json=true","fetch_graph":"https://pith.science/api/pith-number/C7VCMW3QR26RCFJY3ZXEIUF66Y/graph.json","fetch_events":"https://pith.science/api/pith-number/C7VCMW3QR26RCFJY3ZXEIUF66Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/action/storage_attestation","attest_author":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/action/author_attestation","sign_citation":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/action/citation_signature","submit_replication":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/action/replication_record"}},"created_at":"2026-05-18T00:30:16.090792+00:00","updated_at":"2026-05-18T00:30:16.090792+00:00"}