{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VBZY4SQZDS5TDXGKCR5EGAFY7J","short_pith_number":"pith:VBZY4SQZ","canonical_record":{"source":{"id":"1908.02991","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T09:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"0f9338db2efd8906675d6d6b9f90939c9a61f1701523a88c9f9991587949ff85","abstract_canon_sha256":"5220c740d346f7f8edce46eca2f68a6a4a6359c2c455f761304d6cdd4c59ac6b"},"schema_version":"1.0"},"canonical_sha256":"a8738e4a191cbb31dcca147a4300b8fa53bc503fe297695b174104c8d63f7021","source":{"kind":"arxiv","id":"1908.02991","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02991","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02991v3","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02991","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"pith_short_12","alias_value":"VBZY4SQZDS5T","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"pith_short_16","alias_value":"VBZY4SQZDS5TDXGK","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"pith_short_8","alias_value":"VBZY4SQZ","created_at":"2026-07-05T01:47:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VBZY4SQZDS5TDXGKCR5EGAFY7J","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02991","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T09:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"0f9338db2efd8906675d6d6b9f90939c9a61f1701523a88c9f9991587949ff85","abstract_canon_sha256":"5220c740d346f7f8edce46eca2f68a6a4a6359c2c455f761304d6cdd4c59ac6b"},"schema_version":"1.0"},"canonical_sha256":"a8738e4a191cbb31dcca147a4300b8fa53bc503fe297695b174104c8d63f7021","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:47:11.726978Z","signature_b64":"LO7olzePH8UiTMBvISprleRY3ljk6/OOMjtrb7+/GcTtXizZ3A+VetHTkNv7xv4crrVRIU/oidMHvhmghDZRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8738e4a191cbb31dcca147a4300b8fa53bc503fe297695b174104c8d63f7021","last_reissued_at":"2026-07-05T01:47:11.726528Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:47:11.726528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02991","source_version":3,"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-05T01:47:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q95mYe7LcPEWCpP1SQ67Ue80Yo8cDZtFV//J3pJ2q5uX68F8/PoBrmcSES+AFqpDuC3feTgOJBeK/oZymDc8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:08:35.870717Z"},"content_sha256":"ed4b99a2f115f06c4b988f287ad882d8c5d896e39a33508016ef9691133dab3a","schema_version":"1.0","event_id":"sha256:ed4b99a2f115f06c4b988f287ad882d8c5d896e39a33508016ef9691133dab3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VBZY4SQZDS5TDXGKCR5EGAFY7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey games near the critical threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Conlon, Joonkyung Lee, Shagnik Das, Tam\\'as M\\'esz\\'aros","submitted_at":"2019-08-08T09:52:25Z","abstract_excerpt":"A well-known result of R\\\"odl and Ruci\\'nski states that for any graph $H$ there exists a constant $C$ such that if $p \\geq C n^{- 1/m_2(H)}$, then the random graph $G_{n,p}$ is a.a.s. $H$-Ramsey, that is, any $2$-colouring of its edges contains a monochromatic copy of $H$. Aside from a few simple exceptions, the corresponding $0$-statement also holds, that is, there exists $c>0$ such that whenever $p\\leq cn^{-1/m_2(H)}$ the random graph $G_{n,p}$ is a.a.s. not $H$-Ramsey.\n  We show that near this threshold, even when $G_{n,p}$ is not $H$-Ramsey, it is often extremely close to being $H$-Ramsey"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02991","kind":"arxiv","version":3},"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/1908.02991/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-05T01:47:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"If/qkkDkhxA8AQg6MoTMBmIlPtZG9fWIpGU1531BQJYO8rNBO5aCvmOgqERD5Tb0A5I/qga3+Isz2E9qXNMhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:08:35.871628Z"},"content_sha256":"b75fc0d73208de33783a156d15d208af3af1f371d973580f0a5bf04715d2ae78","schema_version":"1.0","event_id":"sha256:b75fc0d73208de33783a156d15d208af3af1f371d973580f0a5bf04715d2ae78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBZY4SQZDS5TDXGKCR5EGAFY7J/bundle.json","state_url":"https://pith.science/pith/VBZY4SQZDS5TDXGKCR5EGAFY7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBZY4SQZDS5TDXGKCR5EGAFY7J/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-16T12:08:35Z","links":{"resolver":"https://pith.science/pith/VBZY4SQZDS5TDXGKCR5EGAFY7J","bundle":"https://pith.science/pith/VBZY4SQZDS5TDXGKCR5EGAFY7J/bundle.json","state":"https://pith.science/pith/VBZY4SQZDS5TDXGKCR5EGAFY7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBZY4SQZDS5TDXGKCR5EGAFY7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VBZY4SQZDS5TDXGKCR5EGAFY7J","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":"5220c740d346f7f8edce46eca2f68a6a4a6359c2c455f761304d6cdd4c59ac6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T09:52:25Z","title_canon_sha256":"0f9338db2efd8906675d6d6b9f90939c9a61f1701523a88c9f9991587949ff85"},"schema_version":"1.0","source":{"id":"1908.02991","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02991","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02991v3","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02991","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"pith_short_12","alias_value":"VBZY4SQZDS5T","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"pith_short_16","alias_value":"VBZY4SQZDS5TDXGK","created_at":"2026-07-05T01:47:11Z"},{"alias_kind":"pith_short_8","alias_value":"VBZY4SQZ","created_at":"2026-07-05T01:47:11Z"}],"graph_snapshots":[{"event_id":"sha256:b75fc0d73208de33783a156d15d208af3af1f371d973580f0a5bf04715d2ae78","target":"graph","created_at":"2026-07-05T01:47:11Z","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/1908.02991/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A well-known result of R\\\"odl and Ruci\\'nski states that for any graph $H$ there exists a constant $C$ such that if $p \\geq C n^{- 1/m_2(H)}$, then the random graph $G_{n,p}$ is a.a.s. $H$-Ramsey, that is, any $2$-colouring of its edges contains a monochromatic copy of $H$. Aside from a few simple exceptions, the corresponding $0$-statement also holds, that is, there exists $c>0$ such that whenever $p\\leq cn^{-1/m_2(H)}$ the random graph $G_{n,p}$ is a.a.s. not $H$-Ramsey.\n  We show that near this threshold, even when $G_{n,p}$ is not $H$-Ramsey, it is often extremely close to being $H$-Ramsey","authors_text":"David Conlon, Joonkyung Lee, Shagnik Das, Tam\\'as M\\'esz\\'aros","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T09:52:25Z","title":"Ramsey games near the critical threshold"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02991","kind":"arxiv","version":3},"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:ed4b99a2f115f06c4b988f287ad882d8c5d896e39a33508016ef9691133dab3a","target":"record","created_at":"2026-07-05T01:47:11Z","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":"5220c740d346f7f8edce46eca2f68a6a4a6359c2c455f761304d6cdd4c59ac6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T09:52:25Z","title_canon_sha256":"0f9338db2efd8906675d6d6b9f90939c9a61f1701523a88c9f9991587949ff85"},"schema_version":"1.0","source":{"id":"1908.02991","kind":"arxiv","version":3}},"canonical_sha256":"a8738e4a191cbb31dcca147a4300b8fa53bc503fe297695b174104c8d63f7021","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8738e4a191cbb31dcca147a4300b8fa53bc503fe297695b174104c8d63f7021","first_computed_at":"2026-07-05T01:47:11.726528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:47:11.726528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LO7olzePH8UiTMBvISprleRY3ljk6/OOMjtrb7+/GcTtXizZ3A+VetHTkNv7xv4crrVRIU/oidMHvhmghDZRAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:47:11.726978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02991","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed4b99a2f115f06c4b988f287ad882d8c5d896e39a33508016ef9691133dab3a","sha256:b75fc0d73208de33783a156d15d208af3af1f371d973580f0a5bf04715d2ae78"],"state_sha256":"09d59081aa618df552f253e473547882b06e4d1d31479a3440e18da8ba27b822"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04uGRQD/fGMDC+IQAqwHtmfYehwVODbpPleYfPvHgkw84nlacL5hqkp3hxJEY3Uk+kxR8njt+8mAj0YHUUgPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:08:35.942839Z","bundle_sha256":"274555efe3d497f6ee5d275fca5859985cb4b072b6e19910e073ef1639a23020"}}