{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LFH4A2U63KNCL6PLPTZ6AERTNV","short_pith_number":"pith:LFH4A2U6","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"},"canonical_sha256":"594fc06a9eda9a25f9eb7cf3e012336d5c50eae05214314bfad27d8346c10cd8","source":{"kind":"arxiv","id":"1705.09673","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09673","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09673v3","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09673","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"LFH4A2U63KNC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LFH4A2U63KNCL6PL","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LFH4A2U6","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LFH4A2U63KNCL6PLPTZ6AERTNV","target":"record","payload":{"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"},"canonical_sha256":"594fc06a9eda9a25f9eb7cf3e012336d5c50eae05214314bfad27d8346c10cd8","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"},"source_kind":"arxiv","source_id":"1705.09673","source_version":3,"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:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66LK/QgJeTPw3MRVkCfyP9dnP2uWVr3ev7dL1hYeKetimIoGS7G96gUE9l3KFpoBTgmjKrJCCRZhD36Zb5RLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:03:06.506918Z"},"content_sha256":"ada0fea2cea0c4d8d5d65643fff99780a310053a1731403981012022275a4e7b","schema_version":"1.0","event_id":"sha256:ada0fea2cea0c4d8d5d65643fff99780a310053a1731403981012022275a4e7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LFH4A2U63KNCL6PLPTZ6AERTNV","target":"graph","payload":{"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"},"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:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qiDX9GlN0H6bZbr7cxKq63hNt0ja0wIIC9eaQiBqKxK7OEkMput/MdNBtH8XGXE3aZRxM1R5zfTBtpwn6xyEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:03:06.507258Z"},"content_sha256":"ebbabbfa4886751eccde82fb49102f8358d1ba86ac98f67d9d8c83be864cb357","schema_version":"1.0","event_id":"sha256:ebbabbfa4886751eccde82fb49102f8358d1ba86ac98f67d9d8c83be864cb357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/bundle.json","state_url":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/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-28T03:03:06Z","links":{"resolver":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV","bundle":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/bundle.json","state":"https://pith.science/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFH4A2U63KNCL6PLPTZ6AERTNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LFH4A2U63KNCL6PLPTZ6AERTNV","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":"712fb94ef3440136bc6a7e4b9849767bcb788638aab3059d469dd1d333afec2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-26T18:08:57Z","title_canon_sha256":"3eb1e71b63057a04b863d400e9a823c3aac07215dcf478dbcd6d20dd77c7fec5"},"schema_version":"1.0","source":{"id":"1705.09673","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09673","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09673v3","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09673","created_at":"2026-05-18T00:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"LFH4A2U63KNC","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LFH4A2U63KNCL6PL","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LFH4A2U6","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:ebbabbfa4886751eccde82fb49102f8358d1ba86ac98f67d9d8c83be864cb357","target":"graph","created_at":"2026-05-18T00:09:47Z","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":"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.","authors_text":"Jay Cummings, Thomas Blankenship, Vladislav Taranchuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-26T18:08:57Z","title":"A New Lower Bound for van der Waerden Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09673","kind":"arxiv","version":3},"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:ada0fea2cea0c4d8d5d65643fff99780a310053a1731403981012022275a4e7b","target":"record","created_at":"2026-05-18T00:09:47Z","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":"712fb94ef3440136bc6a7e4b9849767bcb788638aab3059d469dd1d333afec2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-26T18:08:57Z","title_canon_sha256":"3eb1e71b63057a04b863d400e9a823c3aac07215dcf478dbcd6d20dd77c7fec5"},"schema_version":"1.0","source":{"id":"1705.09673","kind":"arxiv","version":3}},"canonical_sha256":"594fc06a9eda9a25f9eb7cf3e012336d5c50eae05214314bfad27d8346c10cd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"594fc06a9eda9a25f9eb7cf3e012336d5c50eae05214314bfad27d8346c10cd8","first_computed_at":"2026-05-18T00:09:47.863420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:47.863420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/jcHnmOkULU/J9xstfJxv/Rgrr3MOTwvwzOMZxBRjDZmsd6pAEkzlOrl6DrKJUd6dFsQunFBXm00lVlDzHcACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:47.864029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09673","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ada0fea2cea0c4d8d5d65643fff99780a310053a1731403981012022275a4e7b","sha256:ebbabbfa4886751eccde82fb49102f8358d1ba86ac98f67d9d8c83be864cb357"],"state_sha256":"cfa5ccfe1262f716bd87e47ee3d06c75aff6a7043d90cb135a782495b267f3f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqSBISNjLau8n2hefLeVEN/0AxPOttobPCjA1drhBWNGvT1Zr8qqyyvyGgK4INAXTHAxXlCqEQ7W7wvoPRuqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:03:06.509360Z","bundle_sha256":"d5559df270b37c14cfd75a274dda423e2898abc9d4b38fe39749658ad8df1b10"}}