{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LFH4A2U63KNCL6PLPTZ6AERTNV","short_pith_number":"pith:LFH4A2U6","schema_version":"1.0","canonical_sha256":"594fc06a9eda9a25f9eb7cf3e012336d5c50eae05214314bfad27d8346c10cd8","source":{"kind":"arxiv","id":"1705.09673","version":3},"attestation_state":"computed","paper":{"title":"A New Lower Bound for van der Waerden Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jay Cummings, Thomas Blankenship, Vladislav Taranchuk","submitted_at":"2017-05-26T18:08:57Z","abstract_excerpt":"In this paper we prove a new recurrence relation on the van der Waerden numbers, $w(r,k)$. In particular, if $p$ is a prime and $p\\leq k$ then $w(r, k) > p \\cdot \\left(w\\left(r - \\left\\lceil \\frac{r}{p}\\right\\rceil, k\\right) -1\\right)$. This recurrence gives the lower bound $w(r, p+1) > p^{r-1}2^p$ when $r \\leq p$, which generalizes Berlekamp's theorem on 2-colorings, and gives the best known bound for a large interval of $r$. The recurrence can also be used to construct explicit valid colorings, and it improves known lower bounds on small van der Waerden numbers."},"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.09673","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-26T18:08:57Z","cross_cats_sorted":[],"title_canon_sha256":"3eb1e71b63057a04b863d400e9a823c3aac07215dcf478dbcd6d20dd77c7fec5","abstract_canon_sha256":"712fb94ef3440136bc6a7e4b9849767bcb788638aab3059d469dd1d333afec2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:47.864029Z","signature_b64":"/jcHnmOkULU/J9xstfJxv/Rgrr3MOTwvwzOMZxBRjDZmsd6pAEkzlOrl6DrKJUd6dFsQunFBXm00lVlDzHcACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"594fc06a9eda9a25f9eb7cf3e012336d5c50eae05214314bfad27d8346c10cd8","last_reissued_at":"2026-05-18T00:09:47.863420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:47.863420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Lower Bound for van der Waerden Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jay Cummings, Thomas Blankenship, Vladislav Taranchuk","submitted_at":"2017-05-26T18:08:57Z","abstract_excerpt":"In this paper we prove a new recurrence relation on the van der Waerden numbers, $w(r,k)$. In particular, if $p$ is a prime and $p\\leq k$ then $w(r, k) > p \\cdot \\left(w\\left(r - \\left\\lceil \\frac{r}{p}\\right\\rceil, k\\right) -1\\right)$. This recurrence gives the lower bound $w(r, p+1) > p^{r-1}2^p$ when $r \\leq p$, which generalizes Berlekamp's theorem on 2-colorings, and gives the best known bound for a large interval of $r$. The recurrence can also be used to construct explicit valid colorings, and it improves known lower bounds on small van der Waerden numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09673","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.09673","created_at":"2026-05-18T00:09:47.863514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09673v3","created_at":"2026-05-18T00:09:47.863514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09673","created_at":"2026-05-18T00:09:47.863514+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFH4A2U63KNC","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFH4A2U63KNCL6PL","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFH4A2U6","created_at":"2026-05-18T12:31:28.150371+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/LFH4A2U63KNCL6PLPTZ6AERTNV","json":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV.json","graph_json":"https://pith.science/api/pith-number/LFH4A2U63KNCL6PLPTZ6AERTNV/graph.json","events_json":"https://pith.science/api/pith-number/LFH4A2U63KNCL6PLPTZ6AERTNV/events.json","paper":"https://pith.science/paper/LFH4A2U6"},"agent_actions":{"view_html":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV","download_json":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV.json","view_paper":"https://pith.science/paper/LFH4A2U6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09673&json=true","fetch_graph":"https://pith.science/api/pith-number/LFH4A2U63KNCL6PLPTZ6AERTNV/graph.json","fetch_events":"https://pith.science/api/pith-number/LFH4A2U63KNCL6PLPTZ6AERTNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/action/storage_attestation","attest_author":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/action/author_attestation","sign_citation":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/action/citation_signature","submit_replication":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/action/replication_record"}},"created_at":"2026-05-18T00:09:47.863514+00:00","updated_at":"2026-05-18T00:09:47.863514+00:00"}