{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IVHCRMZKZMEB6CGTD7OYNWTFKA","short_pith_number":"pith:IVHCRMZK","canonical_record":{"source":{"id":"1909.01461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-03T21:20:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e0969201d6f216f4634561943c03166d835793bbb0f540d2f1f2bbc573d30192","abstract_canon_sha256":"a530e6d260b2922e7bc21a3e114ab01fe92c1fd649527689fb1c105dee966655"},"schema_version":"1.0"},"canonical_sha256":"454e28b32acb081f08d31fdd86da65503b19c8854ae713fe81f39661e57117a8","source":{"kind":"arxiv","id":"1909.01461","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01461","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01461v2","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01461","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"IVHCRMZKZMEB","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"pith_short_16","alias_value":"IVHCRMZKZMEB6CGT","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"pith_short_8","alias_value":"IVHCRMZK","created_at":"2026-07-05T00:07:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IVHCRMZKZMEB6CGTD7OYNWTFKA","target":"record","payload":{"canonical_record":{"source":{"id":"1909.01461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-03T21:20:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e0969201d6f216f4634561943c03166d835793bbb0f540d2f1f2bbc573d30192","abstract_canon_sha256":"a530e6d260b2922e7bc21a3e114ab01fe92c1fd649527689fb1c105dee966655"},"schema_version":"1.0"},"canonical_sha256":"454e28b32acb081f08d31fdd86da65503b19c8854ae713fe81f39661e57117a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:52.951817Z","signature_b64":"bxs8ic/QYTUfYC0GXUe6ixI8xILFU9OExVhtSEH3sY2xCE2Urg1lyT/F8IkC9SrFGj+GSvaLtN4CxKpm1cKcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"454e28b32acb081f08d31fdd86da65503b19c8854ae713fe81f39661e57117a8","last_reissued_at":"2026-07-05T00:07:52.951415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:52.951415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.01461","source_version":2,"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-07-05T00:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSPXJC+7fidKC/79WX2OHhgIKNkZfkqQlOZECvT5Wiwnr05G09Xn5t/K8QAuubehiR71ypl7ytCCBVYj+V4bDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:11:44.833180Z"},"content_sha256":"f7b9373e36c2b99f1bc33dd2378673832b1a3f68186ed75d0d28a10a7218ba8b","schema_version":"1.0","event_id":"sha256:f7b9373e36c2b99f1bc33dd2378673832b1a3f68186ed75d0d28a10a7218ba8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IVHCRMZKZMEB6CGTD7OYNWTFKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on pseudorandom Ramsey graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Jacques Verstraete","submitted_at":"2019-09-03T21:20:38Z","abstract_excerpt":"For fixed $s \\ge 3$, we prove that if optimal $K_s$-free pseudorandom graphs exist, then the Ramsey number\n  $r(s,t) = t^{s-1+o(1)}$ as $t \\rightarrow \\infty$. Our method also improves the best lower bounds for $r(C_{\\ell},t)$ obtained by Bohman and Keevash from the random $C_{\\ell}$-free process by polylogarithmic factors for all odd $\\ell \\geq 5$ and $\\ell \\in \\{6,10\\}$. For $\\ell = 4$ it matches their lower bound from the $C_4$-free process.\n  We also prove, via a different approach, that $r(C_5, t)> (1+o(1))t^{11/8}$ and $r(C_7, t)> (1+o(1))t^{11/9}$. These improve the exponent of $t$ in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01461","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/1909.01461/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-07-05T00:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jn3ql5LmmoChke8t3LYvUT5rYLhDltm/BH2KNK+Ox6yDc3N13GECOOREJJ1kLf8oHjlVN2LLK3Wd9hnhRxpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:11:44.834173Z"},"content_sha256":"686ae7e2cd79ffd0f6284da2278d95101953936682980f292ea78c22534321ed","schema_version":"1.0","event_id":"sha256:686ae7e2cd79ffd0f6284da2278d95101953936682980f292ea78c22534321ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVHCRMZKZMEB6CGTD7OYNWTFKA/bundle.json","state_url":"https://pith.science/pith/IVHCRMZKZMEB6CGTD7OYNWTFKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVHCRMZKZMEB6CGTD7OYNWTFKA/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-08-15T21:11:44Z","links":{"resolver":"https://pith.science/pith/IVHCRMZKZMEB6CGTD7OYNWTFKA","bundle":"https://pith.science/pith/IVHCRMZKZMEB6CGTD7OYNWTFKA/bundle.json","state":"https://pith.science/pith/IVHCRMZKZMEB6CGTD7OYNWTFKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVHCRMZKZMEB6CGTD7OYNWTFKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IVHCRMZKZMEB6CGTD7OYNWTFKA","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":"a530e6d260b2922e7bc21a3e114ab01fe92c1fd649527689fb1c105dee966655","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-03T21:20:38Z","title_canon_sha256":"e0969201d6f216f4634561943c03166d835793bbb0f540d2f1f2bbc573d30192"},"schema_version":"1.0","source":{"id":"1909.01461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01461","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01461v2","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01461","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"IVHCRMZKZMEB","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"pith_short_16","alias_value":"IVHCRMZKZMEB6CGT","created_at":"2026-07-05T00:07:52Z"},{"alias_kind":"pith_short_8","alias_value":"IVHCRMZK","created_at":"2026-07-05T00:07:52Z"}],"graph_snapshots":[{"event_id":"sha256:686ae7e2cd79ffd0f6284da2278d95101953936682980f292ea78c22534321ed","target":"graph","created_at":"2026-07-05T00:07:52Z","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/1909.01461/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For fixed $s \\ge 3$, we prove that if optimal $K_s$-free pseudorandom graphs exist, then the Ramsey number\n  $r(s,t) = t^{s-1+o(1)}$ as $t \\rightarrow \\infty$. Our method also improves the best lower bounds for $r(C_{\\ell},t)$ obtained by Bohman and Keevash from the random $C_{\\ell}$-free process by polylogarithmic factors for all odd $\\ell \\geq 5$ and $\\ell \\in \\{6,10\\}$. For $\\ell = 4$ it matches their lower bound from the $C_4$-free process.\n  We also prove, via a different approach, that $r(C_5, t)> (1+o(1))t^{11/8}$ and $r(C_7, t)> (1+o(1))t^{11/9}$. These improve the exponent of $t$ in t","authors_text":"Dhruv Mubayi, Jacques Verstraete","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-03T21:20:38Z","title":"A note on pseudorandom Ramsey graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01461","kind":"arxiv","version":2},"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:f7b9373e36c2b99f1bc33dd2378673832b1a3f68186ed75d0d28a10a7218ba8b","target":"record","created_at":"2026-07-05T00:07:52Z","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":"a530e6d260b2922e7bc21a3e114ab01fe92c1fd649527689fb1c105dee966655","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-03T21:20:38Z","title_canon_sha256":"e0969201d6f216f4634561943c03166d835793bbb0f540d2f1f2bbc573d30192"},"schema_version":"1.0","source":{"id":"1909.01461","kind":"arxiv","version":2}},"canonical_sha256":"454e28b32acb081f08d31fdd86da65503b19c8854ae713fe81f39661e57117a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"454e28b32acb081f08d31fdd86da65503b19c8854ae713fe81f39661e57117a8","first_computed_at":"2026-07-05T00:07:52.951415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:07:52.951415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bxs8ic/QYTUfYC0GXUe6ixI8xILFU9OExVhtSEH3sY2xCE2Urg1lyT/F8IkC9SrFGj+GSvaLtN4CxKpm1cKcDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:07:52.951817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.01461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7b9373e36c2b99f1bc33dd2378673832b1a3f68186ed75d0d28a10a7218ba8b","sha256:686ae7e2cd79ffd0f6284da2278d95101953936682980f292ea78c22534321ed"],"state_sha256":"c5aa9a48063b2ff04835418bf4778566b489894b4517954110a878303a801842"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O6dnfX3JQOgLJ0lkD0ADJtWSzV/7LJglOftdjkfPcKMQuLdDhlxm/CBPjXGqqhFa8KmNEqW8jk8JWHczV5GtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T21:11:44.841386Z","bundle_sha256":"6cbd2a2def5f3e6ee82de00055ece7e44bf2bfffafe21255ce8a543c595f07ba"}}