{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KFGHBHPW4R5SFQEW43V24NKZF3","short_pith_number":"pith:KFGHBHPW","schema_version":"1.0","canonical_sha256":"514c709df6e47b22c096e6ebae35592eff474bdf9734fdf94c6db018f9c713b3","source":{"kind":"arxiv","id":"2411.09321","version":2},"attestation_state":"computed","paper":{"title":"Upper bounds on diagonal Ramsey numbers [after Campos, Griffiths, Morris, and Sahasrabudhe]","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yuval Wigderson","submitted_at":"2024-11-14T10:03:26Z","abstract_excerpt":"Ramsey's theorem states that if $N$ is sufficiently large, then no matter how one colors the edges among $N$ vertices with two colors, there are always $k$ vertices spanning edges in only one color. Given this theorem, it is natural to ask ``how large is sufficiently large?'' Ramsey's original proof showed that $N=k!$ is sufficient, and five years later Erd\\H{o}s and Szekeres improved this bound to $N=4^k$. And then progress stalled for almost 90 years.\n  In this survey, I present the history of the problem and discuss some of the ideas used in the recent breakthrough of Campos--Griffiths--Mor"},"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":"2411.09321","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-14T10:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"2a1a718810caccc38dd7b156e81860fc25fdb8747682007e682f86843297339b","abstract_canon_sha256":"fec401287d49cb7e57eb2d35261a44c99c8acecbd8dba3f3f250c19b369b71dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:18.074088Z","signature_b64":"U21rD8/H/ylO4cUBsn7kfti+wPVVyjVPsPeXP0OT3yoYwh+qIw1IICCz5l5Y7SiMINPxFwK8tHCt32P9qHngAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"514c709df6e47b22c096e6ebae35592eff474bdf9734fdf94c6db018f9c713b3","last_reissued_at":"2026-07-05T09:52:18.073683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:18.073683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds on diagonal Ramsey numbers [after Campos, Griffiths, Morris, and Sahasrabudhe]","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yuval Wigderson","submitted_at":"2024-11-14T10:03:26Z","abstract_excerpt":"Ramsey's theorem states that if $N$ is sufficiently large, then no matter how one colors the edges among $N$ vertices with two colors, there are always $k$ vertices spanning edges in only one color. Given this theorem, it is natural to ask ``how large is sufficiently large?'' Ramsey's original proof showed that $N=k!$ is sufficient, and five years later Erd\\H{o}s and Szekeres improved this bound to $N=4^k$. And then progress stalled for almost 90 years.\n  In this survey, I present the history of the problem and discuss some of the ideas used in the recent breakthrough of Campos--Griffiths--Mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09321","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.09321/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.09321","created_at":"2026-07-05T09:52:18.073742+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.09321v2","created_at":"2026-07-05T09:52:18.073742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09321","created_at":"2026-07-05T09:52:18.073742+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFGHBHPW4R5S","created_at":"2026-07-05T09:52:18.073742+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFGHBHPW4R5SFQEW","created_at":"2026-07-05T09:52:18.073742+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFGHBHPW","created_at":"2026-07-05T09:52:18.073742+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/KFGHBHPW4R5SFQEW43V24NKZF3","json":"https://pith.science/pith/KFGHBHPW4R5SFQEW43V24NKZF3.json","graph_json":"https://pith.science/api/pith-number/KFGHBHPW4R5SFQEW43V24NKZF3/graph.json","events_json":"https://pith.science/api/pith-number/KFGHBHPW4R5SFQEW43V24NKZF3/events.json","paper":"https://pith.science/paper/KFGHBHPW"},"agent_actions":{"view_html":"https://pith.science/pith/KFGHBHPW4R5SFQEW43V24NKZF3","download_json":"https://pith.science/pith/KFGHBHPW4R5SFQEW43V24NKZF3.json","view_paper":"https://pith.science/paper/KFGHBHPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.09321&json=true","fetch_graph":"https://pith.science/api/pith-number/KFGHBHPW4R5SFQEW43V24NKZF3/graph.json","fetch_events":"https://pith.science/api/pith-number/KFGHBHPW4R5SFQEW43V24NKZF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFGHBHPW4R5SFQEW43V24NKZF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFGHBHPW4R5SFQEW43V24NKZF3/action/storage_attestation","attest_author":"https://pith.science/pith/KFGHBHPW4R5SFQEW43V24NKZF3/action/author_attestation","sign_citation":"https://pith.science/pith/KFGHBHPW4R5SFQEW43V24NKZF3/action/citation_signature","submit_replication":"https://pith.science/pith/KFGHBHPW4R5SFQEW43V24NKZF3/action/replication_record"}},"created_at":"2026-07-05T09:52:18.073742+00:00","updated_at":"2026-07-05T09:52:18.073742+00:00"}