{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:MZT7U45N2UKYZAXLTBQIO5JAWD","short_pith_number":"pith:MZT7U45N","schema_version":"1.0","canonical_sha256":"6667fa73add5158c82eb9860877520b0e45bd6e59f80e6484dd90f5a9d79e8b5","source":{"kind":"arxiv","id":"0809.4726","version":2},"attestation_state":"computed","paper":{"title":"The t-improper chromatic number of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Ross J. Kang","submitted_at":"2008-09-26T22:38:20Z","abstract_excerpt":"We consider the $t$-improper chromatic number of the Erd{\\H o}s-R{\\'e}nyi random graph $G(n,p)$. The t-improper chromatic number $\\chi^t(G)$ of $G$ is the smallest number of colours needed in a colouring of the vertices in which each colour class induces a subgraph of maximum degree at most $t$. If $t = 0$, then this is the usual notion of proper colouring. When the edge probability $p$ is constant, we provide a detailed description of the asymptotic behaviour of $\\chi^t(G(n,p))$ over the range of choices for the growth of $t = t(n)$."},"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":"0809.4726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-09-26T22:38:20Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"34545ba44036218b79ae6103da59102749decfd4fbdbbcfa6691f5d7eefdd41e","abstract_canon_sha256":"5482436632d255fc2361153606e65317f7f5aafeeb4f68e97c27cad540af020e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:16.483276Z","signature_b64":"hhVExRXOdvUjqVKGvNyAo6C2j6zF9DXKVDvCD1Q4/ehOnC/NgHNB792qo4rebkBYBE4D12ShOLwT/WSkK/hEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6667fa73add5158c82eb9860877520b0e45bd6e59f80e6484dd90f5a9d79e8b5","last_reissued_at":"2026-05-18T04:41:16.482673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:16.482673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The t-improper chromatic number of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Colin McDiarmid, Ross J. Kang","submitted_at":"2008-09-26T22:38:20Z","abstract_excerpt":"We consider the $t$-improper chromatic number of the Erd{\\H o}s-R{\\'e}nyi random graph $G(n,p)$. The t-improper chromatic number $\\chi^t(G)$ of $G$ is the smallest number of colours needed in a colouring of the vertices in which each colour class induces a subgraph of maximum degree at most $t$. If $t = 0$, then this is the usual notion of proper colouring. When the edge probability $p$ is constant, we provide a detailed description of the asymptotic behaviour of $\\chi^t(G(n,p))$ over the range of choices for the growth of $t = t(n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.4726","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":"0809.4726","created_at":"2026-05-18T04:41:16.482755+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.4726v2","created_at":"2026-05-18T04:41:16.482755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.4726","created_at":"2026-05-18T04:41:16.482755+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZT7U45N2UKY","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZT7U45N2UKYZAXL","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZT7U45N","created_at":"2026-05-18T12:25:57.157939+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/MZT7U45N2UKYZAXLTBQIO5JAWD","json":"https://pith.science/pith/MZT7U45N2UKYZAXLTBQIO5JAWD.json","graph_json":"https://pith.science/api/pith-number/MZT7U45N2UKYZAXLTBQIO5JAWD/graph.json","events_json":"https://pith.science/api/pith-number/MZT7U45N2UKYZAXLTBQIO5JAWD/events.json","paper":"https://pith.science/paper/MZT7U45N"},"agent_actions":{"view_html":"https://pith.science/pith/MZT7U45N2UKYZAXLTBQIO5JAWD","download_json":"https://pith.science/pith/MZT7U45N2UKYZAXLTBQIO5JAWD.json","view_paper":"https://pith.science/paper/MZT7U45N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.4726&json=true","fetch_graph":"https://pith.science/api/pith-number/MZT7U45N2UKYZAXLTBQIO5JAWD/graph.json","fetch_events":"https://pith.science/api/pith-number/MZT7U45N2UKYZAXLTBQIO5JAWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZT7U45N2UKYZAXLTBQIO5JAWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZT7U45N2UKYZAXLTBQIO5JAWD/action/storage_attestation","attest_author":"https://pith.science/pith/MZT7U45N2UKYZAXLTBQIO5JAWD/action/author_attestation","sign_citation":"https://pith.science/pith/MZT7U45N2UKYZAXLTBQIO5JAWD/action/citation_signature","submit_replication":"https://pith.science/pith/MZT7U45N2UKYZAXLTBQIO5JAWD/action/replication_record"}},"created_at":"2026-05-18T04:41:16.482755+00:00","updated_at":"2026-05-18T04:41:16.482755+00:00"}