{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y2XMG47NZS372GIWGAL7BRGPOP","short_pith_number":"pith:Y2XMG47N","canonical_record":{"source":{"id":"1501.01340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-07T00:46:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2691a375b3375c49b6c5b2e64fff36fa0ca6fb1b13cc81c85543233ab6fa5c15","abstract_canon_sha256":"7efd0708d95e23a67871117315b43cd34c878e109156cfb4ca61b000083edce6"},"schema_version":"1.0"},"canonical_sha256":"c6aec373edccb7fd19163017f0c4cf73c48b6a7e149ef605f83d550d284734c7","source":{"kind":"arxiv","id":"1501.01340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01340","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01340v1","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01340","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y2XMG47NZS37","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y2XMG47NZS372GIW","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y2XMG47N","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y2XMG47NZS372GIWGAL7BRGPOP","target":"record","payload":{"canonical_record":{"source":{"id":"1501.01340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-07T00:46:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2691a375b3375c49b6c5b2e64fff36fa0ca6fb1b13cc81c85543233ab6fa5c15","abstract_canon_sha256":"7efd0708d95e23a67871117315b43cd34c878e109156cfb4ca61b000083edce6"},"schema_version":"1.0"},"canonical_sha256":"c6aec373edccb7fd19163017f0c4cf73c48b6a7e149ef605f83d550d284734c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:54.474584Z","signature_b64":"cvfaTE/SfwpRben99+i0v2iGNBFVr6XANVvf7xN/rUl0GLD0qHwVPjppVdbO0ro40f07BGyH1xi4C6fQVnc+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6aec373edccb7fd19163017f0c4cf73c48b6a7e149ef605f83d550d284734c7","last_reissued_at":"2026-05-18T02:29:54.474073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:54.474073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.01340","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-18T02:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"712UzeMmm9apBl4o/0/P2NASxrwJh37S6flEisUxPUIalRlvM8bMwVwnDFEWvEkvZ2oUqXD4gMmOTM/CplmxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:52:45.178926Z"},"content_sha256":"ebaac94b4adea54c4cac644e820da9fb1b5a2c776771282bdbe7f74c6dafc5d8","schema_version":"1.0","event_id":"sha256:ebaac94b4adea54c4cac644e820da9fb1b5a2c776771282bdbe7f74c6dafc5d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y2XMG47NZS372GIWGAL7BRGPOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tur\\'an's Theorem for random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Bobby DeMarco, Jeff Kahn","submitted_at":"2015-01-07T00:46:17Z","abstract_excerpt":"For a graph $G$, denote by $t_r(G)$ (resp. $b_r(G)$) the maximum size of a $K_r$-free (resp. $(r-1)$-partite) subgraph of $G$. Of course $t_r(G) \\geq b_r(G)$ for any $G$, and Tur\\'an's Theorem says that equality holds for complete graphs. With $G_{n,p}$ the usual (\"binomial\" or \"Erd\\H{o}s-R\\'enyi\") random graph, we show:\n  For each fixed r there is a C such that if \\[ p=p(n) > Cn^{-\\tfrac{2}{r+1}}\\log^{\\tfrac{2}{(r+1)(r-2)}}n, \\] then $\\Pr(t_r(G_{n,p})=b_r(G_{n,p}))\\rightarrow 1$ as $n\\rightarrow\\infty$.\n  This is best possible (apart from the value of $C$) and settles a question first conside"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01340","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-18T02:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sO5qg/tN/zn6NXCZ6Qkz+jlC6gbqajvgeq5SJotbPT0YdImioCl7rzxYavABLYJljo+1gPvBrs+xrSBhytQiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:52:45.179290Z"},"content_sha256":"e82b8eb255c0244025feda8e0b277d4347d6fc561995dc0640d11d5e429ef910","schema_version":"1.0","event_id":"sha256:e82b8eb255c0244025feda8e0b277d4347d6fc561995dc0640d11d5e429ef910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2XMG47NZS372GIWGAL7BRGPOP/bundle.json","state_url":"https://pith.science/pith/Y2XMG47NZS372GIWGAL7BRGPOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2XMG47NZS372GIWGAL7BRGPOP/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-23T04:52:45Z","links":{"resolver":"https://pith.science/pith/Y2XMG47NZS372GIWGAL7BRGPOP","bundle":"https://pith.science/pith/Y2XMG47NZS372GIWGAL7BRGPOP/bundle.json","state":"https://pith.science/pith/Y2XMG47NZS372GIWGAL7BRGPOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2XMG47NZS372GIWGAL7BRGPOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y2XMG47NZS372GIWGAL7BRGPOP","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":"7efd0708d95e23a67871117315b43cd34c878e109156cfb4ca61b000083edce6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-07T00:46:17Z","title_canon_sha256":"2691a375b3375c49b6c5b2e64fff36fa0ca6fb1b13cc81c85543233ab6fa5c15"},"schema_version":"1.0","source":{"id":"1501.01340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01340","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01340v1","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01340","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y2XMG47NZS37","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y2XMG47NZS372GIW","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y2XMG47N","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:e82b8eb255c0244025feda8e0b277d4347d6fc561995dc0640d11d5e429ef910","target":"graph","created_at":"2026-05-18T02:29:54Z","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":"For a graph $G$, denote by $t_r(G)$ (resp. $b_r(G)$) the maximum size of a $K_r$-free (resp. $(r-1)$-partite) subgraph of $G$. Of course $t_r(G) \\geq b_r(G)$ for any $G$, and Tur\\'an's Theorem says that equality holds for complete graphs. With $G_{n,p}$ the usual (\"binomial\" or \"Erd\\H{o}s-R\\'enyi\") random graph, we show:\n  For each fixed r there is a C such that if \\[ p=p(n) > Cn^{-\\tfrac{2}{r+1}}\\log^{\\tfrac{2}{(r+1)(r-2)}}n, \\] then $\\Pr(t_r(G_{n,p})=b_r(G_{n,p}))\\rightarrow 1$ as $n\\rightarrow\\infty$.\n  This is best possible (apart from the value of $C$) and settles a question first conside","authors_text":"Bobby DeMarco, Jeff Kahn","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-07T00:46:17Z","title":"Tur\\'an's Theorem for random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01340","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:ebaac94b4adea54c4cac644e820da9fb1b5a2c776771282bdbe7f74c6dafc5d8","target":"record","created_at":"2026-05-18T02:29:54Z","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":"7efd0708d95e23a67871117315b43cd34c878e109156cfb4ca61b000083edce6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-07T00:46:17Z","title_canon_sha256":"2691a375b3375c49b6c5b2e64fff36fa0ca6fb1b13cc81c85543233ab6fa5c15"},"schema_version":"1.0","source":{"id":"1501.01340","kind":"arxiv","version":1}},"canonical_sha256":"c6aec373edccb7fd19163017f0c4cf73c48b6a7e149ef605f83d550d284734c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6aec373edccb7fd19163017f0c4cf73c48b6a7e149ef605f83d550d284734c7","first_computed_at":"2026-05-18T02:29:54.474073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:54.474073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cvfaTE/SfwpRben99+i0v2iGNBFVr6XANVvf7xN/rUl0GLD0qHwVPjppVdbO0ro40f07BGyH1xi4C6fQVnc+DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:54.474584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebaac94b4adea54c4cac644e820da9fb1b5a2c776771282bdbe7f74c6dafc5d8","sha256:e82b8eb255c0244025feda8e0b277d4347d6fc561995dc0640d11d5e429ef910"],"state_sha256":"a7659c81f4ae7a3cd2ab7f99d5bd2202b992c1bdf643e125141d839ae6131faf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNlkGamnY3P2nvjEhAhfnJMm9V8Ur9HY9gcTV2XKns+vg9cp4slbxGmEfwvSO32QZNrNB5a9gNao34KwFROzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:52:45.181260Z","bundle_sha256":"d0f23074a37d3c0ba10f0c370446ee6a26e9a37b8b158a28758fbd07c3e955be"}}