{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BV5BZIMBL653X5EULHXY7RPC7D","short_pith_number":"pith:BV5BZIMB","schema_version":"1.0","canonical_sha256":"0d7a1ca1815fbbbbf49459ef8fc5e2f8caf8abe5b81cdb976006108a9ecb5054","source":{"kind":"arxiv","id":"2407.19026","version":1},"attestation_state":"computed","paper":{"title":"Optimizing the CGMS upper bound on Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis Wei, Ndiame Ndiaye, Parth Gupta, Sergey Norin","submitted_at":"2024-07-26T18:08:35Z","abstract_excerpt":"In a recent breakthrough Campos, Griffiths, Morris and Sahasrabudhe obtained the first exponential improvement of the upper bound on the diagonal Ramsey numbers since 1935. We shorten their proof, replacing the underlying book algorithm with a simple inductive statement. This modification allows us\n  - to give a very short proof of an improved upper bound on the off-diagonal Ramsey numbers, which extends to the multicolor setting, and\n  - to clarify the dependence of the bounds on underlying parameters and optimize these parameters, obtaining, in particular, an upper bound $$R(k,k) \\leq (3.8)^"},"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":"2407.19026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-07-26T18:08:35Z","cross_cats_sorted":[],"title_canon_sha256":"8cb6d98df03dd5e86f5b3e8cfecc920f353b726372c30559a0198596adb622a5","abstract_canon_sha256":"44ad0148db01ce11116419faf020f6563aa041dd743714e20001a55a8b723064"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:12.572118Z","signature_b64":"1xZ32SvntHd8XXPeCZh0do6WRQqEJC4HvMys+aVx2w4F9hy1YU+hnJUDad62+Dzw37S3cGvg/IZrntd7v1ZZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d7a1ca1815fbbbbf49459ef8fc5e2f8caf8abe5b81cdb976006108a9ecb5054","last_reissued_at":"2026-07-05T08:49:12.571645Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:12.571645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing the CGMS upper bound on Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis Wei, Ndiame Ndiaye, Parth Gupta, Sergey Norin","submitted_at":"2024-07-26T18:08:35Z","abstract_excerpt":"In a recent breakthrough Campos, Griffiths, Morris and Sahasrabudhe obtained the first exponential improvement of the upper bound on the diagonal Ramsey numbers since 1935. We shorten their proof, replacing the underlying book algorithm with a simple inductive statement. This modification allows us\n  - to give a very short proof of an improved upper bound on the off-diagonal Ramsey numbers, which extends to the multicolor setting, and\n  - to clarify the dependence of the bounds on underlying parameters and optimize these parameters, obtaining, in particular, an upper bound $$R(k,k) \\leq (3.8)^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.19026","kind":"arxiv","version":1},"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/2407.19026/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":"2407.19026","created_at":"2026-07-05T08:49:12.571702+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.19026v1","created_at":"2026-07-05T08:49:12.571702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.19026","created_at":"2026-07-05T08:49:12.571702+00:00"},{"alias_kind":"pith_short_12","alias_value":"BV5BZIMBL653","created_at":"2026-07-05T08:49:12.571702+00:00"},{"alias_kind":"pith_short_16","alias_value":"BV5BZIMBL653X5EU","created_at":"2026-07-05T08:49:12.571702+00:00"},{"alias_kind":"pith_short_8","alias_value":"BV5BZIMB","created_at":"2026-07-05T08:49:12.571702+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":15,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24198","citing_title":"New Tower-Type Lower Bounds for Hypergraph Ramsey Numbers","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25843","citing_title":"Sharper Ramsey lower bounds from refined Gaussian estimates","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25843","citing_title":"Sharper Ramsey lower bounds from refined Gaussian estimates","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28793","citing_title":"Off-diagonal Ramsey numbers","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02389","citing_title":"A degree version of the Burr-Erd\\H{o}s conjecture on trees","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23301","citing_title":"Finding blowups one vertex at a time","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22395","citing_title":"Ramsey numbers of multiple copies of a graph and the random Ramsey theorem","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2512.17718","citing_title":"Gaussian random graphs and Ramsey numbers","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2507.12926","citing_title":"An exponential improvement for Ramsey lower bounds","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2512.17790","citing_title":"A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02835","citing_title":"A Note on Generalized Erd\\H{o}s-Rogers Problems","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04105","citing_title":"An improved double-exponential lower bound for $r_4(5,n)$","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23986","citing_title":"A double-exponential lower bound for $r_4(5,n)$","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07322","citing_title":"New results on the odd- and unique-Ramsey numbers","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04105","citing_title":"An improved double-exponential lower bound for $r_4(5,n)$","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BV5BZIMBL653X5EULHXY7RPC7D","json":"https://pith.science/pith/BV5BZIMBL653X5EULHXY7RPC7D.json","graph_json":"https://pith.science/api/pith-number/BV5BZIMBL653X5EULHXY7RPC7D/graph.json","events_json":"https://pith.science/api/pith-number/BV5BZIMBL653X5EULHXY7RPC7D/events.json","paper":"https://pith.science/paper/BV5BZIMB"},"agent_actions":{"view_html":"https://pith.science/pith/BV5BZIMBL653X5EULHXY7RPC7D","download_json":"https://pith.science/pith/BV5BZIMBL653X5EULHXY7RPC7D.json","view_paper":"https://pith.science/paper/BV5BZIMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.19026&json=true","fetch_graph":"https://pith.science/api/pith-number/BV5BZIMBL653X5EULHXY7RPC7D/graph.json","fetch_events":"https://pith.science/api/pith-number/BV5BZIMBL653X5EULHXY7RPC7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BV5BZIMBL653X5EULHXY7RPC7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BV5BZIMBL653X5EULHXY7RPC7D/action/storage_attestation","attest_author":"https://pith.science/pith/BV5BZIMBL653X5EULHXY7RPC7D/action/author_attestation","sign_citation":"https://pith.science/pith/BV5BZIMBL653X5EULHXY7RPC7D/action/citation_signature","submit_replication":"https://pith.science/pith/BV5BZIMBL653X5EULHXY7RPC7D/action/replication_record"}},"created_at":"2026-07-05T08:49:12.571702+00:00","updated_at":"2026-07-05T08:49:12.571702+00:00"}