{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4WV6HEFG4JYVL4O5RZYFUAPH45","short_pith_number":"pith:4WV6HEFG","schema_version":"1.0","canonical_sha256":"e5abe390a6e27155f1dd8e705a01e7e77aae8b1f92e394ac9c03a58ded00c225","source":{"kind":"arxiv","id":"1803.07694","version":1},"attestation_state":"computed","paper":{"title":"Defective and Clustered Graph Colouring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood","submitted_at":"2018-03-20T23:42:47Z","abstract_excerpt":"Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has \"defect\" $d$ if each monochromatic component has maximum degree at most $d$. A colouring has \"clustering\" $c$ if each monochromatic component has at most $c$ vertices. This paper surveys research on these types of colourings, where the first priority is to minimise the number of colours, with small defect or small clustering as a secondary goal. List colouring variants are also considered. The following graph classes are studied: outerp"},"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":"1803.07694","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2018-03-20T23:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"3ba34a18b90039efc754c34ae4b6e5e55a31990722fc4bd34ad3e82ee81fbf57","abstract_canon_sha256":"db2cba72baf351e88a384830f2b3d11c20e3ec18ee0937e5923c64e11ab32a7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:29.248048Z","signature_b64":"cV9eHkMj6m1XZBszCoUzB4p7QiVg6cUgE8v9/pIDk7yuNxiQhP/y12r2D2xxTEDZ98lBEqEFsiWadt6jX0bLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5abe390a6e27155f1dd8e705a01e7e77aae8b1f92e394ac9c03a58ded00c225","last_reissued_at":"2026-05-18T00:20:29.247617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:29.247617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Defective and Clustered Graph Colouring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood","submitted_at":"2018-03-20T23:42:47Z","abstract_excerpt":"Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has \"defect\" $d$ if each monochromatic component has maximum degree at most $d$. A colouring has \"clustering\" $c$ if each monochromatic component has at most $c$ vertices. This paper surveys research on these types of colourings, where the first priority is to minimise the number of colours, with small defect or small clustering as a secondary goal. List colouring variants are also considered. The following graph classes are studied: outerp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07694","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.07694","created_at":"2026-05-18T00:20:29.247683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07694v1","created_at":"2026-05-18T00:20:29.247683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07694","created_at":"2026-05-18T00:20:29.247683+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WV6HEFG4JYV","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WV6HEFG4JYVL4O5","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WV6HEFG","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15336","citing_title":"Defective correspondence coloring of planar graphs","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4WV6HEFG4JYVL4O5RZYFUAPH45","json":"https://pith.science/pith/4WV6HEFG4JYVL4O5RZYFUAPH45.json","graph_json":"https://pith.science/api/pith-number/4WV6HEFG4JYVL4O5RZYFUAPH45/graph.json","events_json":"https://pith.science/api/pith-number/4WV6HEFG4JYVL4O5RZYFUAPH45/events.json","paper":"https://pith.science/paper/4WV6HEFG"},"agent_actions":{"view_html":"https://pith.science/pith/4WV6HEFG4JYVL4O5RZYFUAPH45","download_json":"https://pith.science/pith/4WV6HEFG4JYVL4O5RZYFUAPH45.json","view_paper":"https://pith.science/paper/4WV6HEFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07694&json=true","fetch_graph":"https://pith.science/api/pith-number/4WV6HEFG4JYVL4O5RZYFUAPH45/graph.json","fetch_events":"https://pith.science/api/pith-number/4WV6HEFG4JYVL4O5RZYFUAPH45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WV6HEFG4JYVL4O5RZYFUAPH45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WV6HEFG4JYVL4O5RZYFUAPH45/action/storage_attestation","attest_author":"https://pith.science/pith/4WV6HEFG4JYVL4O5RZYFUAPH45/action/author_attestation","sign_citation":"https://pith.science/pith/4WV6HEFG4JYVL4O5RZYFUAPH45/action/citation_signature","submit_replication":"https://pith.science/pith/4WV6HEFG4JYVL4O5RZYFUAPH45/action/replication_record"}},"created_at":"2026-05-18T00:20:29.247683+00:00","updated_at":"2026-05-18T00:20:29.247683+00:00"}