{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A4LE5TDDAPS5R3XGZAMIASH3GW","short_pith_number":"pith:A4LE5TDD","schema_version":"1.0","canonical_sha256":"07164ecc6303e5d8eee6c8188048fb35a755020347d778c62548233a79a004f6","source":{"kind":"arxiv","id":"2303.09521","version":2},"attestation_state":"computed","paper":{"title":"An exponential improvement for diagonal Ramsey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julian Sahasrabudhe, Marcelo Campos, Robert Morris, Simon Griffiths","submitted_at":"2023-03-16T17:38:08Z","abstract_excerpt":"The Ramsey number $R(k)$ is the minimum $n \\in \\mathbb{N}$ such that every red-blue colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove that \\[ R(k) \\leqslant (4 - \\varepsilon)^k \\] for some constant $\\varepsilon > 0$. This is the first exponential improvement over the upper bound of Erd\\H{o}s and Szekeres, proved in 1935."},"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":"2303.09521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-16T17:38:08Z","cross_cats_sorted":[],"title_canon_sha256":"dd0c1ebebab886c93dd8f03ad9636c268f267d5facfa940f295c28704db5efec","abstract_canon_sha256":"05f577768ba456556969093ae3694e141b9c43809df2a3a0c1adf92de23ca8ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:19.081866Z","signature_b64":"+rMflcgWzc62lwtQhzCrso4PwHjS5WWp95gFx+f+EUf+hISEx+gu+qEyYtVzXexQLw0g3MZvj9+VBIedlD4RBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07164ecc6303e5d8eee6c8188048fb35a755020347d778c62548233a79a004f6","last_reissued_at":"2026-07-05T11:48:19.081385Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:19.081385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An exponential improvement for diagonal Ramsey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julian Sahasrabudhe, Marcelo Campos, Robert Morris, Simon Griffiths","submitted_at":"2023-03-16T17:38:08Z","abstract_excerpt":"The Ramsey number $R(k)$ is the minimum $n \\in \\mathbb{N}$ such that every red-blue colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove that \\[ R(k) \\leqslant (4 - \\varepsilon)^k \\] for some constant $\\varepsilon > 0$. This is the first exponential improvement over the upper bound of Erd\\H{o}s and Szekeres, proved in 1935."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.09521","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/2303.09521/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":"2303.09521","created_at":"2026-07-05T11:48:19.081443+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.09521v2","created_at":"2026-07-05T11:48:19.081443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.09521","created_at":"2026-07-05T11:48:19.081443+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4LE5TDDAPS5","created_at":"2026-07-05T11:48:19.081443+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4LE5TDDAPS5R3XG","created_at":"2026-07-05T11:48:19.081443+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4LE5TDD","created_at":"2026-07-05T11:48:19.081443+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02389","citing_title":"A degree version of the Burr-Erd\\H{o}s conjecture on trees","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2412.16637","citing_title":"A lower bound on the Ramsey number $R_k(k+1,k+1)$","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2507.12926","citing_title":"An exponential improvement for Ramsey lower bounds","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07322","citing_title":"New results on the odd- and unique-Ramsey numbers","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A4LE5TDDAPS5R3XGZAMIASH3GW","json":"https://pith.science/pith/A4LE5TDDAPS5R3XGZAMIASH3GW.json","graph_json":"https://pith.science/api/pith-number/A4LE5TDDAPS5R3XGZAMIASH3GW/graph.json","events_json":"https://pith.science/api/pith-number/A4LE5TDDAPS5R3XGZAMIASH3GW/events.json","paper":"https://pith.science/paper/A4LE5TDD"},"agent_actions":{"view_html":"https://pith.science/pith/A4LE5TDDAPS5R3XGZAMIASH3GW","download_json":"https://pith.science/pith/A4LE5TDDAPS5R3XGZAMIASH3GW.json","view_paper":"https://pith.science/paper/A4LE5TDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.09521&json=true","fetch_graph":"https://pith.science/api/pith-number/A4LE5TDDAPS5R3XGZAMIASH3GW/graph.json","fetch_events":"https://pith.science/api/pith-number/A4LE5TDDAPS5R3XGZAMIASH3GW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4LE5TDDAPS5R3XGZAMIASH3GW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4LE5TDDAPS5R3XGZAMIASH3GW/action/storage_attestation","attest_author":"https://pith.science/pith/A4LE5TDDAPS5R3XGZAMIASH3GW/action/author_attestation","sign_citation":"https://pith.science/pith/A4LE5TDDAPS5R3XGZAMIASH3GW/action/citation_signature","submit_replication":"https://pith.science/pith/A4LE5TDDAPS5R3XGZAMIASH3GW/action/replication_record"}},"created_at":"2026-07-05T11:48:19.081443+00:00","updated_at":"2026-07-05T11:48:19.081443+00:00"}