{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:T5PYV5WIRSYCYYNRJJPKL5P7TB","short_pith_number":"pith:T5PYV5WI","canonical_record":{"source":{"id":"1902.02197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T14:21:52Z","cross_cats_sorted":[],"title_canon_sha256":"38c530ba14d9915f022998aa0ab86abae1920e3745735b7528646a6ddddbf954","abstract_canon_sha256":"2b1b8286a2b97d1d853e1705434d51b4ec65a254324e3320ba4ba864e76670f4"},"schema_version":"1.0"},"canonical_sha256":"9f5f8af6c88cb02c61b14a5ea5f5ff985b9e6a5a18e3ae5fe55ad8e4e578774b","source":{"kind":"arxiv","id":"1902.02197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02197","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02197v1","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02197","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"T5PYV5WIRSYC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"T5PYV5WIRSYCYYNR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"T5PYV5WI","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:T5PYV5WIRSYCYYNRJJPKL5P7TB","target":"record","payload":{"canonical_record":{"source":{"id":"1902.02197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T14:21:52Z","cross_cats_sorted":[],"title_canon_sha256":"38c530ba14d9915f022998aa0ab86abae1920e3745735b7528646a6ddddbf954","abstract_canon_sha256":"2b1b8286a2b97d1d853e1705434d51b4ec65a254324e3320ba4ba864e76670f4"},"schema_version":"1.0"},"canonical_sha256":"9f5f8af6c88cb02c61b14a5ea5f5ff985b9e6a5a18e3ae5fe55ad8e4e578774b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:37.634465Z","signature_b64":"0IAWNLbht4VKRgpRVi8GHgThjDs1oEvdbGAYqHYVtU2jxzjTqFzEiFF41vtBky2wtuJLo3HzU7HRoGSpztyDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f5f8af6c88cb02c61b14a5ea5f5ff985b9e6a5a18e3ae5fe55ad8e4e578774b","last_reissued_at":"2026-05-17T23:54:37.634044Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:37.634044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.02197","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-17T23:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/Zhju33JYPGtJKIJP95QID8/MvCeqMAswkgP7/lAN0LxKfAItrO+B1hw9L1jy9P3udpLp+aRWKzlCjGobshBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:08:47.174258Z"},"content_sha256":"d06d024e63c2468cece7e2fb11105b5f652b675474cbab3391ef6defb99f768f","schema_version":"1.0","event_id":"sha256:d06d024e63c2468cece7e2fb11105b5f652b675474cbab3391ef6defb99f768f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:T5PYV5WIRSYCYYNRJJPKL5P7TB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey properties of randomly perturbed dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emil Powierski","submitted_at":"2019-02-06T14:21:52Z","abstract_excerpt":"We investigate Ramsey properties of a random graph model in which random edges are added to a given dense graph. Specifically, we determine lower and upper bounds on the function $p=p(n)$ that ensures that for any dense graph $G_n$ a.a.s. every 2-colouring of the edges of $G_n\\cup G(n,p)$ admits a monochromatic copy of the complete graph $K_r$. These bounds are asymptotically sharp for the cases when $r\\geq 5$ is odd and almost sharp when $r\\geq 4$ is even. Our proofs utilise recent results on the threshold for asymmetric Ramsey properties in $G(n,p)$ and the method of dependent random choice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02197","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":""},"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-17T23:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5ThF9Ca2vZnBX/KIa96gbQqflCgIXJPhBqDGTBTd4qEuyxyyMgFZVFNrQmm0Sw6U6cb7ZhPshkMwz7v8bnyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:08:47.174722Z"},"content_sha256":"a82d53cdd037bc0ae0a7fd75dbbfa46bf6436bad693e3606798cf6b8c0738b0a","schema_version":"1.0","event_id":"sha256:a82d53cdd037bc0ae0a7fd75dbbfa46bf6436bad693e3606798cf6b8c0738b0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5PYV5WIRSYCYYNRJJPKL5P7TB/bundle.json","state_url":"https://pith.science/pith/T5PYV5WIRSYCYYNRJJPKL5P7TB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5PYV5WIRSYCYYNRJJPKL5P7TB/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-20T07:08:47Z","links":{"resolver":"https://pith.science/pith/T5PYV5WIRSYCYYNRJJPKL5P7TB","bundle":"https://pith.science/pith/T5PYV5WIRSYCYYNRJJPKL5P7TB/bundle.json","state":"https://pith.science/pith/T5PYV5WIRSYCYYNRJJPKL5P7TB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5PYV5WIRSYCYYNRJJPKL5P7TB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:T5PYV5WIRSYCYYNRJJPKL5P7TB","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":"2b1b8286a2b97d1d853e1705434d51b4ec65a254324e3320ba4ba864e76670f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T14:21:52Z","title_canon_sha256":"38c530ba14d9915f022998aa0ab86abae1920e3745735b7528646a6ddddbf954"},"schema_version":"1.0","source":{"id":"1902.02197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02197","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02197v1","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02197","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"T5PYV5WIRSYC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"T5PYV5WIRSYCYYNR","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"T5PYV5WI","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:a82d53cdd037bc0ae0a7fd75dbbfa46bf6436bad693e3606798cf6b8c0738b0a","target":"graph","created_at":"2026-05-17T23:54:37Z","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"},"paper":{"abstract_excerpt":"We investigate Ramsey properties of a random graph model in which random edges are added to a given dense graph. Specifically, we determine lower and upper bounds on the function $p=p(n)$ that ensures that for any dense graph $G_n$ a.a.s. every 2-colouring of the edges of $G_n\\cup G(n,p)$ admits a monochromatic copy of the complete graph $K_r$. These bounds are asymptotically sharp for the cases when $r\\geq 5$ is odd and almost sharp when $r\\geq 4$ is even. Our proofs utilise recent results on the threshold for asymmetric Ramsey properties in $G(n,p)$ and the method of dependent random choice.","authors_text":"Emil Powierski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T14:21:52Z","title":"Ramsey properties of randomly perturbed dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02197","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:d06d024e63c2468cece7e2fb11105b5f652b675474cbab3391ef6defb99f768f","target":"record","created_at":"2026-05-17T23:54:37Z","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":"2b1b8286a2b97d1d853e1705434d51b4ec65a254324e3320ba4ba864e76670f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-06T14:21:52Z","title_canon_sha256":"38c530ba14d9915f022998aa0ab86abae1920e3745735b7528646a6ddddbf954"},"schema_version":"1.0","source":{"id":"1902.02197","kind":"arxiv","version":1}},"canonical_sha256":"9f5f8af6c88cb02c61b14a5ea5f5ff985b9e6a5a18e3ae5fe55ad8e4e578774b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f5f8af6c88cb02c61b14a5ea5f5ff985b9e6a5a18e3ae5fe55ad8e4e578774b","first_computed_at":"2026-05-17T23:54:37.634044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:37.634044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0IAWNLbht4VKRgpRVi8GHgThjDs1oEvdbGAYqHYVtU2jxzjTqFzEiFF41vtBky2wtuJLo3HzU7HRoGSpztyDCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:37.634465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d06d024e63c2468cece7e2fb11105b5f652b675474cbab3391ef6defb99f768f","sha256:a82d53cdd037bc0ae0a7fd75dbbfa46bf6436bad693e3606798cf6b8c0738b0a"],"state_sha256":"e3531ec512d606a30f42f862179c2a726f7f80ab40a177a3c185436c8af85618"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KelnSR5wTEw4wQUB8v5E5Sy4Q5y09nJQ7QWzwlxZ+cCclPhWBxuqnbNStXHEPewyUXmyDDIg6Y44cppUu7PzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:08:47.179060Z","bundle_sha256":"ba88e21989f0e9683b5c9ad175af7df7d41c8a0d4209dafa069fde71e4ef666a"}}