{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BN56EF6LWBMZVFQ3ZE3FNALNPT","short_pith_number":"pith:BN56EF6L","schema_version":"1.0","canonical_sha256":"0b7be217cbb0599a961bc93656816d7cf26d5565096c030a52e5d56bf3e372ee","source":{"kind":"arxiv","id":"2605.28793","version":1},"attestation_state":"computed","paper":{"title":"Nearly tight exponents for off-diagonal Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domagoj Brada\\v{c}","submitted_at":"2026-05-27T17:50:42Z","abstract_excerpt":"We construct a new family of $K_s$-free graphs that leads to improved lower bounds for Ramsey numbers across a wide range of parameters. For any fixed $s \\ge 4$, we show that the off-diagonal Ramsey numbers satisfy $r(s, k) \\ge k^{s-2 + o(1)}.$ For $s \\ge 6,$ this improves the best known lower bound of the form $r(s, k) \\ge k^{\\frac{s+1}{2} + o(1)}$ which was first established by Spencer in 1977 and has since only seen logarithmic improvements. This nearly matches the best known upper bound which is of the form $r(s, k) \\le k^{s-1 + o(1)}$ and which is widely believed to give the correct expon"},"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":"2605.28793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T17:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"6dfb67e6b9dd58d870d2cc177c20564908e4036fb54241ed115cd439a97c83c8","abstract_canon_sha256":"f3d4b8c31b928aedfbab266f51abc4619f232d6551c371d6ee32b24734b8b057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:05:03.760334Z","signature_b64":"4X++xbGPGgzWkrCD6owkKQcx44tW0Nzs+PthDRy2Cs3oeP+jw1X+exI8km/olgtbnc1khBWZX/mr9iFsfhN3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b7be217cbb0599a961bc93656816d7cf26d5565096c030a52e5d56bf3e372ee","last_reissued_at":"2026-05-28T02:05:03.759924Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:05:03.759924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly tight exponents for off-diagonal Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domagoj Brada\\v{c}","submitted_at":"2026-05-27T17:50:42Z","abstract_excerpt":"We construct a new family of $K_s$-free graphs that leads to improved lower bounds for Ramsey numbers across a wide range of parameters. For any fixed $s \\ge 4$, we show that the off-diagonal Ramsey numbers satisfy $r(s, k) \\ge k^{s-2 + o(1)}.$ For $s \\ge 6,$ this improves the best known lower bound of the form $r(s, k) \\ge k^{\\frac{s+1}{2} + o(1)}$ which was first established by Spencer in 1977 and has since only seen logarithmic improvements. This nearly matches the best known upper bound which is of the form $r(s, k) \\le k^{s-1 + o(1)}$ and which is widely believed to give the correct expon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28793","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/2605.28793/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":"2605.28793","created_at":"2026-05-28T02:05:03.759988+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.28793v1","created_at":"2026-05-28T02:05:03.759988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28793","created_at":"2026-05-28T02:05:03.759988+00:00"},{"alias_kind":"pith_short_12","alias_value":"BN56EF6LWBMZ","created_at":"2026-05-28T02:05:03.759988+00:00"},{"alias_kind":"pith_short_16","alias_value":"BN56EF6LWBMZVFQ3","created_at":"2026-05-28T02:05:03.759988+00:00"},{"alias_kind":"pith_short_8","alias_value":"BN56EF6L","created_at":"2026-05-28T02:05:03.759988+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/BN56EF6LWBMZVFQ3ZE3FNALNPT","json":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT.json","graph_json":"https://pith.science/api/pith-number/BN56EF6LWBMZVFQ3ZE3FNALNPT/graph.json","events_json":"https://pith.science/api/pith-number/BN56EF6LWBMZVFQ3ZE3FNALNPT/events.json","paper":"https://pith.science/paper/BN56EF6L"},"agent_actions":{"view_html":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT","download_json":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT.json","view_paper":"https://pith.science/paper/BN56EF6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.28793&json=true","fetch_graph":"https://pith.science/api/pith-number/BN56EF6LWBMZVFQ3ZE3FNALNPT/graph.json","fetch_events":"https://pith.science/api/pith-number/BN56EF6LWBMZVFQ3ZE3FNALNPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/action/storage_attestation","attest_author":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/action/author_attestation","sign_citation":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/action/citation_signature","submit_replication":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/action/replication_record"}},"created_at":"2026-05-28T02:05:03.759988+00:00","updated_at":"2026-05-28T02:05:03.759988+00:00"}