{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BN56EF6LWBMZVFQ3ZE3FNALNPT","short_pith_number":"pith:BN56EF6L","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"},"canonical_sha256":"0b7be217cbb0599a961bc93656816d7cf26d5565096c030a52e5d56bf3e372ee","source":{"kind":"arxiv","id":"2605.28793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28793","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28793v1","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28793","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"BN56EF6LWBMZ","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"BN56EF6LWBMZVFQ3","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"BN56EF6L","created_at":"2026-05-28T02:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BN56EF6LWBMZVFQ3ZE3FNALNPT","target":"record","payload":{"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"},"canonical_sha256":"0b7be217cbb0599a961bc93656816d7cf26d5565096c030a52e5d56bf3e372ee","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"},"source_kind":"arxiv","source_id":"2605.28793","source_version":1,"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-28T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOt5/GuY+BcmSYNhjydx4GJn+rKOI6cGAADL+72qriOF+HJ9zCved8iAZ5ZTQ0v4wYzObSrHlB7Gn0auo9A7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:58:37.929900Z"},"content_sha256":"fe7e65098e67990f5fa6a1c069d7f3872a63fe11be2e8eb191f92f24383999e7","schema_version":"1.0","event_id":"sha256:fe7e65098e67990f5fa6a1c069d7f3872a63fe11be2e8eb191f92f24383999e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BN56EF6LWBMZVFQ3ZE3FNALNPT","target":"graph","payload":{"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"},"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-28T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+c4KshdHRAhu03QzlprEfvYBPax0xyRN/ifNvUlC97vIUwTFyQmcoi46391qi6sZNvr5wCqFG2z4MjspwpIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:58:37.930273Z"},"content_sha256":"342a32050787727f771a4a7401570b30416710d2d541eae2a14f59010d3e2be8","schema_version":"1.0","event_id":"sha256:342a32050787727f771a4a7401570b30416710d2d541eae2a14f59010d3e2be8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/bundle.json","state_url":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/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-06-29T19:58:37Z","links":{"resolver":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT","bundle":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/bundle.json","state":"https://pith.science/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BN56EF6LWBMZVFQ3ZE3FNALNPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BN56EF6LWBMZVFQ3ZE3FNALNPT","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":"f3d4b8c31b928aedfbab266f51abc4619f232d6551c371d6ee32b24734b8b057","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T17:50:42Z","title_canon_sha256":"6dfb67e6b9dd58d870d2cc177c20564908e4036fb54241ed115cd439a97c83c8"},"schema_version":"1.0","source":{"id":"2605.28793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28793","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28793v1","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28793","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"BN56EF6LWBMZ","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"BN56EF6LWBMZVFQ3","created_at":"2026-05-28T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"BN56EF6L","created_at":"2026-05-28T02:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:342a32050787727f771a4a7401570b30416710d2d541eae2a14f59010d3e2be8","target":"graph","created_at":"2026-05-28T02:05:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.28793/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Domagoj Brada\\v{c}","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T17:50:42Z","title":"Nearly tight exponents for off-diagonal Ramsey numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28793","kind":"arxiv","version":1},"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:fe7e65098e67990f5fa6a1c069d7f3872a63fe11be2e8eb191f92f24383999e7","target":"record","created_at":"2026-05-28T02:05:03Z","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":"f3d4b8c31b928aedfbab266f51abc4619f232d6551c371d6ee32b24734b8b057","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T17:50:42Z","title_canon_sha256":"6dfb67e6b9dd58d870d2cc177c20564908e4036fb54241ed115cd439a97c83c8"},"schema_version":"1.0","source":{"id":"2605.28793","kind":"arxiv","version":1}},"canonical_sha256":"0b7be217cbb0599a961bc93656816d7cf26d5565096c030a52e5d56bf3e372ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b7be217cbb0599a961bc93656816d7cf26d5565096c030a52e5d56bf3e372ee","first_computed_at":"2026-05-28T02:05:03.759924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T02:05:03.759924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4X++xbGPGgzWkrCD6owkKQcx44tW0Nzs+PthDRy2Cs3oeP+jw1X+exI8km/olgtbnc1khBWZX/mr9iFsfhN3BQ==","signature_status":"signed_v1","signed_at":"2026-05-28T02:05:03.760334Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe7e65098e67990f5fa6a1c069d7f3872a63fe11be2e8eb191f92f24383999e7","sha256:342a32050787727f771a4a7401570b30416710d2d541eae2a14f59010d3e2be8"],"state_sha256":"94a0e6073f14790d2392534685d49fa73dbb1b3a831dbf2cd9209370c93c3375"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ST0gyJdhK4fG91UrsnW+IrQ/6qaBb2YvkaAXY7gWsa4SFCQSyaXYNmuVxWI/ls0bkcL+eLC86oHpTCxq2JpKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:58:37.932208Z","bundle_sha256":"0cc0b2d4dab39f7473cadc74423c66ee553edbce8333ac4d5fd13085cf9deffc"}}