{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OYLQ562GRLUCBAKQYAPRUGDXON","short_pith_number":"pith:OYLQ562G","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"},"canonical_sha256":"76170efb468ae8208150c01f1a1877735753feacc6b85fd1ca359410037cca7c","source":{"kind":"arxiv","id":"1508.03875","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03875","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03875v2","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03875","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"OYLQ562GRLUC","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OYLQ562GRLUCBAKQ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OYLQ562G","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OYLQ562GRLUCBAKQYAPRUGDXON","target":"record","payload":{"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"},"canonical_sha256":"76170efb468ae8208150c01f1a1877735753feacc6b85fd1ca359410037cca7c","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"},"source_kind":"arxiv","source_id":"1508.03875","source_version":2,"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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tuj+xjeYgxp98YK7l4NxIpzX+Lx7YBp0mjC5DJUDl+EGEKA4AIhl++E5gRqZRnd4HkaXMp0HIH0wDqM5BL0yDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:11:30.778188Z"},"content_sha256":"ca3c3ee99700b8593f13bb0d17817f4e9fa5974e255436cf1f33a6a618e2bfab","schema_version":"1.0","event_id":"sha256:ca3c3ee99700b8593f13bb0d17817f4e9fa5974e255436cf1f33a6a618e2bfab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OYLQ562GRLUCBAKQYAPRUGDXON","target":"graph","payload":{"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"},"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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3FU402Gmsp/SsZgEhNtdQBDbW38l/SitYrGpm3eulg5kpP+xE6KZfbdMh5qfxfX8PUnD4P7I/Qjh+FGcYBqhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:11:30.778902Z"},"content_sha256":"a8aaeda0dcaaa35bf5c84f135a23352580ef08352cc159b6c6caedda150d2ac3","schema_version":"1.0","event_id":"sha256:a8aaeda0dcaaa35bf5c84f135a23352580ef08352cc159b6c6caedda150d2ac3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON/bundle.json","state_url":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYLQ562GRLUCBAKQYAPRUGDXON/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-05-25T19:11:30Z","links":{"resolver":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON","bundle":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON/bundle.json","state":"https://pith.science/pith/OYLQ562GRLUCBAKQYAPRUGDXON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYLQ562GRLUCBAKQYAPRUGDXON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OYLQ562GRLUCBAKQYAPRUGDXON","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":"6806ff51c647d1281e142e852d01029464c5e18cb1449989232218ec1d97f7ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-16T22:10:10Z","title_canon_sha256":"29425ded88edf3423d5bc3ee8767b8efa90d70f1556ed4ad1ad8917177c66d16"},"schema_version":"1.0","source":{"id":"1508.03875","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03875","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03875v2","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03875","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"OYLQ562GRLUC","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OYLQ562GRLUCBAKQ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OYLQ562G","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:a8aaeda0dcaaa35bf5c84f135a23352580ef08352cc159b6c6caedda150d2ac3","target":"graph","created_at":"2026-05-18T01:09:12Z","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":"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","authors_text":"Julia B\\\"ottcher, Peter Allen, Robert Morris, Simon Griffiths, Yoshiharu Kohayakawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-16T22:10:10Z","title":"Chromatic thresholds in sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03875","kind":"arxiv","version":2},"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:ca3c3ee99700b8593f13bb0d17817f4e9fa5974e255436cf1f33a6a618e2bfab","target":"record","created_at":"2026-05-18T01:09:12Z","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":"6806ff51c647d1281e142e852d01029464c5e18cb1449989232218ec1d97f7ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-16T22:10:10Z","title_canon_sha256":"29425ded88edf3423d5bc3ee8767b8efa90d70f1556ed4ad1ad8917177c66d16"},"schema_version":"1.0","source":{"id":"1508.03875","kind":"arxiv","version":2}},"canonical_sha256":"76170efb468ae8208150c01f1a1877735753feacc6b85fd1ca359410037cca7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76170efb468ae8208150c01f1a1877735753feacc6b85fd1ca359410037cca7c","first_computed_at":"2026-05-18T01:09:12.669067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:12.669067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TEdw7lQFvO0eVDPgTHYA5cykR9Jtk4SHJgz7/diF1jKYQlyeSy3SFG/YrzwlNJZJfMi3Azd+/Uxf2ihKXNQcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:12.669719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03875","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca3c3ee99700b8593f13bb0d17817f4e9fa5974e255436cf1f33a6a618e2bfab","sha256:a8aaeda0dcaaa35bf5c84f135a23352580ef08352cc159b6c6caedda150d2ac3"],"state_sha256":"984309d2430e94b1aba09aa48fa5ba02032c8d387c9dff5898c95cb2e721e195"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XcGzv6zbRkJewTvbMqJHKRDk9kbrR6CBAP6tYm0MlE6j1f/iptjNi3sFb4I4wCQogv9EnGUqS/X3bSgKgDMPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:11:30.782896Z","bundle_sha256":"346f6196c5ae2c8f3400b7ff91e8a006050ca9df308d9479a73d111dcc9e0014"}}