{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UNYYZKKQFKLRHLXWQPWV4VWELC","short_pith_number":"pith:UNYYZKKQ","schema_version":"1.0","canonical_sha256":"a3718ca9502a9713aef683ed5e56c4589dbc2a730c2daed54a8b74d643f40bef","source":{"kind":"arxiv","id":"1708.02370","version":2},"attestation_state":"computed","paper":{"title":"Clustered Colouring in Minor-Closed Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, David R. Wood, Paul Seymour, Sergey Norin","submitted_at":"2017-08-08T04:51:01Z","abstract_excerpt":"The \"clustered chromatic number\" of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$-colourable with monochromatic components of size at most $c$. We prove that for every graph $H$, the clustered chromatic number of the class of $H$-minor-free graphs is tied to the tree-depth of $H$. In particular, if $H$ is connected with tree-depth $t$ then every $H$-minor-free graph is $(2^{t+1}-4)$-colourable with monochromatic components of size at most $c(H)$. This provides the first evidence for a conjecture of Ossona de Mendez, Oum and Wood (20"},"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":"1708.02370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-08T04:51:01Z","cross_cats_sorted":[],"title_canon_sha256":"aa875aab6233678d21793c3deeee66649201cc78d92452032d487b803d61f326","abstract_canon_sha256":"4add6b6fd446424514acb4062f23b057341c7e09cb5101ffe7403bb010a5c0e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:41.238536Z","signature_b64":"t+SqmHkpoutNxlnkK4FgDkINHh1/YdRkkYVxOtxGSSht3M8KPtKCJijC4pNgKCU+ABW/fZfWDNdrnn1A4SnLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3718ca9502a9713aef683ed5e56c4589dbc2a730c2daed54a8b74d643f40bef","last_reissued_at":"2026-07-05T00:40:41.238156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:41.238156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustered Colouring in Minor-Closed Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, David R. Wood, Paul Seymour, Sergey Norin","submitted_at":"2017-08-08T04:51:01Z","abstract_excerpt":"The \"clustered chromatic number\" of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$-colourable with monochromatic components of size at most $c$. We prove that for every graph $H$, the clustered chromatic number of the class of $H$-minor-free graphs is tied to the tree-depth of $H$. In particular, if $H$ is connected with tree-depth $t$ then every $H$-minor-free graph is $(2^{t+1}-4)$-colourable with monochromatic components of size at most $c(H)$. This provides the first evidence for a conjecture of Ossona de Mendez, Oum and Wood (20"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02370","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1708.02370/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1708.02370","created_at":"2026-07-05T00:40:41.238225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02370v2","created_at":"2026-07-05T00:40:41.238225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02370","created_at":"2026-07-05T00:40:41.238225+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNYYZKKQFKLR","created_at":"2026-07-05T00:40:41.238225+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNYYZKKQFKLRHLXW","created_at":"2026-07-05T00:40:41.238225+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNYYZKKQ","created_at":"2026-07-05T00:40:41.238225+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/UNYYZKKQFKLRHLXWQPWV4VWELC","json":"https://pith.science/pith/UNYYZKKQFKLRHLXWQPWV4VWELC.json","graph_json":"https://pith.science/api/pith-number/UNYYZKKQFKLRHLXWQPWV4VWELC/graph.json","events_json":"https://pith.science/api/pith-number/UNYYZKKQFKLRHLXWQPWV4VWELC/events.json","paper":"https://pith.science/paper/UNYYZKKQ"},"agent_actions":{"view_html":"https://pith.science/pith/UNYYZKKQFKLRHLXWQPWV4VWELC","download_json":"https://pith.science/pith/UNYYZKKQFKLRHLXWQPWV4VWELC.json","view_paper":"https://pith.science/paper/UNYYZKKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02370&json=true","fetch_graph":"https://pith.science/api/pith-number/UNYYZKKQFKLRHLXWQPWV4VWELC/graph.json","fetch_events":"https://pith.science/api/pith-number/UNYYZKKQFKLRHLXWQPWV4VWELC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNYYZKKQFKLRHLXWQPWV4VWELC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNYYZKKQFKLRHLXWQPWV4VWELC/action/storage_attestation","attest_author":"https://pith.science/pith/UNYYZKKQFKLRHLXWQPWV4VWELC/action/author_attestation","sign_citation":"https://pith.science/pith/UNYYZKKQFKLRHLXWQPWV4VWELC/action/citation_signature","submit_replication":"https://pith.science/pith/UNYYZKKQFKLRHLXWQPWV4VWELC/action/replication_record"}},"created_at":"2026-07-05T00:40:41.238225+00:00","updated_at":"2026-07-05T00:40:41.238225+00:00"}