{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WYG2NK4EEI6PJKMBLWBAUNDRB3","short_pith_number":"pith:WYG2NK4E","schema_version":"1.0","canonical_sha256":"b60da6ab84223cf4a9815d820a34710eed79a5d45fab3727ca2ddf177fd22e36","source":{"kind":"arxiv","id":"1508.03870","version":2},"attestation_state":"computed","paper":{"title":"Chromatic thresholds in dense random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julia B\\\"ottcher, Peter Allen, Robert Morris, Simon Griffiths, Yoshiharu Kohayakawa","submitted_at":"2015-08-16T21:52:36Z","abstract_excerpt":"The chromatic threshold $\\delta_\\chi(H,p)$ of a graph $H$ with respect to the random graph $G(n,p)$ is the infimum over $d > 0$ such that the following holds with high probability: the family of $H$-free graphs $G \\subset G(n,p)$ with minimum degree $\\delta(G) \\ge dpn$ has bounded chromatic number. The study of the parameter $\\delta_\\chi(H) := \\delta_\\chi(H,1)$ was initiated in 1973 by Erd\\H{o}s and Simonovits, and was recently determined for all graphs $H$. In this paper we show that $\\delta_\\chi(H,p) = \\delta_\\chi(H)$ for all fixed $p \\in (0,1)$, but that typically $\\delta_\\chi(H,p) \\ne \\del"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1508.03870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-16T21:52:36Z","cross_cats_sorted":[],"title_canon_sha256":"d95c9f9e08e1c7f2e7cdc7b061f48204483a2eb85f2e6643ce76ba57a12068dc","abstract_canon_sha256":"e58ac2477612a4968d9a266326573eae32c0e6af1c0e2ae2da73aa925fb2bf2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:12.678285Z","signature_b64":"th99h87XSWIwTnv5sOU2M1I7H6tqWXoB1txixuYIE1Bon75cIRqG8tDlaJqQlG03WXI3Df1EANWlSzVlRcP3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b60da6ab84223cf4a9815d820a34710eed79a5d45fab3727ca2ddf177fd22e36","last_reissued_at":"2026-05-18T01:09:12.677761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:12.677761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic thresholds in dense random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julia B\\\"ottcher, Peter Allen, Robert Morris, Simon Griffiths, Yoshiharu Kohayakawa","submitted_at":"2015-08-16T21:52:36Z","abstract_excerpt":"The chromatic threshold $\\delta_\\chi(H,p)$ of a graph $H$ with respect to the random graph $G(n,p)$ is the infimum over $d > 0$ such that the following holds with high probability: the family of $H$-free graphs $G \\subset G(n,p)$ with minimum degree $\\delta(G) \\ge dpn$ has bounded chromatic number. The study of the parameter $\\delta_\\chi(H) := \\delta_\\chi(H,1)$ was initiated in 1973 by Erd\\H{o}s and Simonovits, and was recently determined for all graphs $H$. In this paper we show that $\\delta_\\chi(H,p) = \\delta_\\chi(H)$ for all fixed $p \\in (0,1)$, but that typically $\\delta_\\chi(H,p) \\ne \\del"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03870","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.03870","created_at":"2026-05-18T01:09:12.677842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03870v2","created_at":"2026-05-18T01:09:12.677842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03870","created_at":"2026-05-18T01:09:12.677842+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYG2NK4EEI6P","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYG2NK4EEI6PJKMB","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYG2NK4E","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WYG2NK4EEI6PJKMBLWBAUNDRB3","json":"https://pith.science/pith/WYG2NK4EEI6PJKMBLWBAUNDRB3.json","graph_json":"https://pith.science/api/pith-number/WYG2NK4EEI6PJKMBLWBAUNDRB3/graph.json","events_json":"https://pith.science/api/pith-number/WYG2NK4EEI6PJKMBLWBAUNDRB3/events.json","paper":"https://pith.science/paper/WYG2NK4E"},"agent_actions":{"view_html":"https://pith.science/pith/WYG2NK4EEI6PJKMBLWBAUNDRB3","download_json":"https://pith.science/pith/WYG2NK4EEI6PJKMBLWBAUNDRB3.json","view_paper":"https://pith.science/paper/WYG2NK4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03870&json=true","fetch_graph":"https://pith.science/api/pith-number/WYG2NK4EEI6PJKMBLWBAUNDRB3/graph.json","fetch_events":"https://pith.science/api/pith-number/WYG2NK4EEI6PJKMBLWBAUNDRB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYG2NK4EEI6PJKMBLWBAUNDRB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYG2NK4EEI6PJKMBLWBAUNDRB3/action/storage_attestation","attest_author":"https://pith.science/pith/WYG2NK4EEI6PJKMBLWBAUNDRB3/action/author_attestation","sign_citation":"https://pith.science/pith/WYG2NK4EEI6PJKMBLWBAUNDRB3/action/citation_signature","submit_replication":"https://pith.science/pith/WYG2NK4EEI6PJKMBLWBAUNDRB3/action/replication_record"}},"created_at":"2026-05-18T01:09:12.677842+00:00","updated_at":"2026-05-18T01:09:12.677842+00:00"}