{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OYLQ562GRLUCBAKQYAPRUGDXON","short_pith_number":"pith:OYLQ562G","schema_version":"1.0","canonical_sha256":"76170efb468ae8208150c01f1a1877735753feacc6b85fd1ca359410037cca7c","source":{"kind":"arxiv","id":"1508.03875","version":2},"attestation_state":"computed","paper":{"title":"Chromatic thresholds in sparse 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-16T22:10:10Z","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 $\\delta_\\chi(H) :=\\delta_\\chi(H,1)$ was initiated in 1973 by Erd\\H{o}s and Simonovits. Recently $\\delta_\\chi(H)$ was determined for all graphs $H$. It is known that $\\delta_\\chi(H,p) =\\delta_\\chi(H)$ for all fixed $p \\in (0,1)$, but that typically $\\delta_\\chi(H,p) \\ne \\delta_\\chi(H)$ i"},"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.03875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-16T22:10:10Z","cross_cats_sorted":[],"title_canon_sha256":"29425ded88edf3423d5bc3ee8767b8efa90d70f1556ed4ad1ad8917177c66d16","abstract_canon_sha256":"6806ff51c647d1281e142e852d01029464c5e18cb1449989232218ec1d97f7ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:12.669719Z","signature_b64":"TEdw7lQFvO0eVDPgTHYA5cykR9Jtk4SHJgz7/diF1jKYQlyeSy3SFG/YrzwlNJZJfMi3Azd+/Uxf2ihKXNQcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76170efb468ae8208150c01f1a1877735753feacc6b85fd1ca359410037cca7c","last_reissued_at":"2026-05-18T01:09:12.669067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:12.669067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic thresholds in sparse 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-16T22:10:10Z","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 $\\delta_\\chi(H) :=\\delta_\\chi(H,1)$ was initiated in 1973 by Erd\\H{o}s and Simonovits. Recently $\\delta_\\chi(H)$ was determined for all graphs $H$. It is known that $\\delta_\\chi(H,p) =\\delta_\\chi(H)$ for all fixed $p \\in (0,1)$, but that typically $\\delta_\\chi(H,p) \\ne \\delta_\\chi(H)$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03875","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.03875","created_at":"2026-05-18T01:09:12.669148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03875v2","created_at":"2026-05-18T01:09:12.669148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03875","created_at":"2026-05-18T01:09:12.669148+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYLQ562GRLUC","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYLQ562GRLUCBAKQ","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYLQ562G","created_at":"2026-05-18T12:29:34.919912+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/OYLQ562GRLUCBAKQYAPRUGDXON","json":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON.json","graph_json":"https://pith.science/api/pith-number/OYLQ562GRLUCBAKQYAPRUGDXON/graph.json","events_json":"https://pith.science/api/pith-number/OYLQ562GRLUCBAKQYAPRUGDXON/events.json","paper":"https://pith.science/paper/OYLQ562G"},"agent_actions":{"view_html":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON","download_json":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON.json","view_paper":"https://pith.science/paper/OYLQ562G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03875&json=true","fetch_graph":"https://pith.science/api/pith-number/OYLQ562GRLUCBAKQYAPRUGDXON/graph.json","fetch_events":"https://pith.science/api/pith-number/OYLQ562GRLUCBAKQYAPRUGDXON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON/action/storage_attestation","attest_author":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON/action/author_attestation","sign_citation":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON/action/citation_signature","submit_replication":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON/action/replication_record"}},"created_at":"2026-05-18T01:09:12.669148+00:00","updated_at":"2026-05-18T01:09:12.669148+00:00"}