{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C7VCMW3QR26RCFJY3ZXEIUF66Y","short_pith_number":"pith:C7VCMW3Q","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"},"canonical_sha256":"17ea265b708ebd111538de6e4450bef635841fd1a0bec27713f67e88c8f4026a","source":{"kind":"arxiv","id":"1711.04183","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04183","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04183v2","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04183","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"C7VCMW3QR26R","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"C7VCMW3QR26RCFJY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"C7VCMW3Q","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C7VCMW3QR26RCFJY3ZXEIUF66Y","target":"record","payload":{"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"},"canonical_sha256":"17ea265b708ebd111538de6e4450bef635841fd1a0bec27713f67e88c8f4026a","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"},"source_kind":"arxiv","source_id":"1711.04183","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oCbFlU8LEURvx2ibatJ4VNHLTMLp4u35znKnlINgXF9CyxSv60KEDnRlAZBfQi/s+F6lDVMIpAyrGScuDiNcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:52:10.678010Z"},"content_sha256":"e484544f9ec9b21722932f6fdcc3bb506e7beb13f12351722f3826660c551f78","schema_version":"1.0","event_id":"sha256:e484544f9ec9b21722932f6fdcc3bb506e7beb13f12351722f3826660c551f78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C7VCMW3QR26RCFJY3ZXEIUF66Y","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOhBikG9WuNET/GD82t+i1taUOKOC81g7hOiZTnCvV+uCe3eOXu/BUANt8Te/ZMrJbCNKY2ZXAGLb/JkSL0tCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:52:10.678365Z"},"content_sha256":"570826cb90581fd293aa55e55e6ceaf89a1678532f514a1bdd85509cad4ac15d","schema_version":"1.0","event_id":"sha256:570826cb90581fd293aa55e55e6ceaf89a1678532f514a1bdd85509cad4ac15d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/bundle.json","state_url":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T12:52:10Z","links":{"resolver":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y","bundle":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/bundle.json","state":"https://pith.science/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7VCMW3QR26RCFJY3ZXEIUF66Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C7VCMW3QR26RCFJY3ZXEIUF66Y","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2b2729cad9c617273f99e0a4478c0d4ece76a5316f18e321631e8a4e6963f161","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-11T18:54:52Z","title_canon_sha256":"e7f554941c3d48e00b050205fbb257f4f8874a6bbfc302fb92f179f825c3736f"},"schema_version":"1.0","source":{"id":"1711.04183","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04183","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04183v2","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04183","created_at":"2026-05-18T00:30:16Z"},{"alias_kind":"pith_short_12","alias_value":"C7VCMW3QR26R","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"C7VCMW3QR26RCFJY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"C7VCMW3Q","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:570826cb90581fd293aa55e55e6ceaf89a1678532f514a1bdd85509cad4ac15d","target":"graph","created_at":"2026-05-18T00:30:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Vladislav Taranchuk","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-11T18:54:52Z","title":"A Constructive Lower Bound on Szemer\\'edi's Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04183","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e484544f9ec9b21722932f6fdcc3bb506e7beb13f12351722f3826660c551f78","target":"record","created_at":"2026-05-18T00:30:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2b2729cad9c617273f99e0a4478c0d4ece76a5316f18e321631e8a4e6963f161","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-11T18:54:52Z","title_canon_sha256":"e7f554941c3d48e00b050205fbb257f4f8874a6bbfc302fb92f179f825c3736f"},"schema_version":"1.0","source":{"id":"1711.04183","kind":"arxiv","version":2}},"canonical_sha256":"17ea265b708ebd111538de6e4450bef635841fd1a0bec27713f67e88c8f4026a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17ea265b708ebd111538de6e4450bef635841fd1a0bec27713f67e88c8f4026a","first_computed_at":"2026-05-18T00:30:16.090652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:16.090652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+oCdKKdDZ3K50GziWCdZctustpqm0k2mrK9bUN4UhWmo1dONinr3vDC+ghbCtSGQW+p5O7MQWGKt9ThbnrbqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:16.091511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04183","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e484544f9ec9b21722932f6fdcc3bb506e7beb13f12351722f3826660c551f78","sha256:570826cb90581fd293aa55e55e6ceaf89a1678532f514a1bdd85509cad4ac15d"],"state_sha256":"293c84350acff9b47bd9de5e639b354a2a56f6e5028ef63dea4e7ecafb6a725b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9+R88aa7dCqy3YOqoWmJF2FbCA/gAG4FpaNZOjDeQ7swfPme7DbkPK+TXQJatPK6ZVJbsqzdsPyL7xIO8NtBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:52:10.680333Z","bundle_sha256":"c2e4fa1744180de163a74efc660fdb15de9e1b85be3e509202866325cba7ddd1"}}