{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EAJAAMWTWWK2VVDYDY3ZWEB5NK","short_pith_number":"pith:EAJAAMWT","schema_version":"1.0","canonical_sha256":"20120032d3b595aad4781e379b103d6a82bcb4457ea14226372f4138883bc78f","source":{"kind":"arxiv","id":"1710.02727","version":1},"attestation_state":"computed","paper":{"title":"Islands in minor-closed classes. I. Bounded treewidth and separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2017-10-07T19:23:01Z","abstract_excerpt":"The clustered chromatic number of a graph class is the minimum integer $t$ such that for some $C$ the vertices of every graph in the class can be colored in $t$ colors so that every monochromatic component has size at most $C$. We show that the clustered chromatic number of the class of graphs embeddable on a given surface is four, proving the conjecture of Esperet and Ochem. Additionally, we study the list version of the concept and characterize the minor-closed classes of graphs of bounded treewidth with given clustered list chromatic number. We further strengthen the above results to solve "},"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":"1710.02727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-07T19:23:01Z","cross_cats_sorted":[],"title_canon_sha256":"c1fed1358f795068fe45c72b014eae5ba4dd9714e38214538de94a068093b7ab","abstract_canon_sha256":"25f0164fce909b223148ca4765bbc0d54e9cb013697eb31a0e8133871ac3c8c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:29.016997Z","signature_b64":"JbufjY5GukSaZ3owoOrs8NLQnFXVw6ZG2ZIZ+t/8VJxMkRAKB0d9ztmeIh7OPPYZOBLVzW12xItM4EHKKQmDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20120032d3b595aad4781e379b103d6a82bcb4457ea14226372f4138883bc78f","last_reissued_at":"2026-05-18T00:33:29.016557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:29.016557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Islands in minor-closed classes. I. Bounded treewidth and separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2017-10-07T19:23:01Z","abstract_excerpt":"The clustered chromatic number of a graph class is the minimum integer $t$ such that for some $C$ the vertices of every graph in the class can be colored in $t$ colors so that every monochromatic component has size at most $C$. We show that the clustered chromatic number of the class of graphs embeddable on a given surface is four, proving the conjecture of Esperet and Ochem. Additionally, we study the list version of the concept and characterize the minor-closed classes of graphs of bounded treewidth with given clustered list chromatic number. We further strengthen the above results to solve "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02727","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":"1710.02727","created_at":"2026-05-18T00:33:29.016626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02727v1","created_at":"2026-05-18T00:33:29.016626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02727","created_at":"2026-05-18T00:33:29.016626+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAJAAMWTWWK2","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAJAAMWTWWK2VVDY","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAJAAMWT","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03163","citing_title":"3-Colouring Planar Graphs","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EAJAAMWTWWK2VVDYDY3ZWEB5NK","json":"https://pith.science/pith/EAJAAMWTWWK2VVDYDY3ZWEB5NK.json","graph_json":"https://pith.science/api/pith-number/EAJAAMWTWWK2VVDYDY3ZWEB5NK/graph.json","events_json":"https://pith.science/api/pith-number/EAJAAMWTWWK2VVDYDY3ZWEB5NK/events.json","paper":"https://pith.science/paper/EAJAAMWT"},"agent_actions":{"view_html":"https://pith.science/pith/EAJAAMWTWWK2VVDYDY3ZWEB5NK","download_json":"https://pith.science/pith/EAJAAMWTWWK2VVDYDY3ZWEB5NK.json","view_paper":"https://pith.science/paper/EAJAAMWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02727&json=true","fetch_graph":"https://pith.science/api/pith-number/EAJAAMWTWWK2VVDYDY3ZWEB5NK/graph.json","fetch_events":"https://pith.science/api/pith-number/EAJAAMWTWWK2VVDYDY3ZWEB5NK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAJAAMWTWWK2VVDYDY3ZWEB5NK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAJAAMWTWWK2VVDYDY3ZWEB5NK/action/storage_attestation","attest_author":"https://pith.science/pith/EAJAAMWTWWK2VVDYDY3ZWEB5NK/action/author_attestation","sign_citation":"https://pith.science/pith/EAJAAMWTWWK2VVDYDY3ZWEB5NK/action/citation_signature","submit_replication":"https://pith.science/pith/EAJAAMWTWWK2VVDYDY3ZWEB5NK/action/replication_record"}},"created_at":"2026-05-18T00:33:29.016626+00:00","updated_at":"2026-05-18T00:33:29.016626+00:00"}