{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DHODBREYOHHKEOR2NUHR2POJP5","short_pith_number":"pith:DHODBREY","schema_version":"1.0","canonical_sha256":"19dc30c49871cea23a3a6d0f1d3dc97f59a8f2e4e618d18aa453f61e15bee283","source":{"kind":"arxiv","id":"2012.05554","version":2},"attestation_state":"computed","paper":{"title":"Clustered colouring of graph classes with bounded treedepth or pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, David R. Wood, Sergey Norin","submitted_at":"2020-12-10T09:56:36Z","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 determine the clustered chromatic number of any minor-closed class with bounded treedepth, and prove a best possible upper bound on the clustered chromatic number of any minor-closed class with bounded pathwidth. As a consequence, we determine the fractional clustered chromatic number of every minor-closed class."},"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":"2012.05554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-10T09:56:36Z","cross_cats_sorted":[],"title_canon_sha256":"4ea06a3d78caf5bb507af00d367785210b3f8c179188a1df37fdcf5688428dc8","abstract_canon_sha256":"b9f8e656a08b36cb972f5dace7ab822310456b530accafcffac8f3f36d7a2b88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:13.513183Z","signature_b64":"BiCJPM8qtrVMTflL4MKFOOf5COQj3EQWvkfDmN/m+O3C/dpvMgRA5Tpb6mQRjk7fuIlvp2f4dQJXVBnzc+T+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19dc30c49871cea23a3a6d0f1d3dc97f59a8f2e4e618d18aa453f61e15bee283","last_reissued_at":"2026-07-05T03:50:13.512681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:13.512681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustered colouring of graph classes with bounded treedepth or pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, David R. Wood, Sergey Norin","submitted_at":"2020-12-10T09:56:36Z","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 determine the clustered chromatic number of any minor-closed class with bounded treedepth, and prove a best possible upper bound on the clustered chromatic number of any minor-closed class with bounded pathwidth. As a consequence, we determine the fractional clustered chromatic number of every minor-closed class."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.05554","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/2012.05554/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":"2012.05554","created_at":"2026-07-05T03:50:13.512741+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.05554v2","created_at":"2026-07-05T03:50:13.512741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.05554","created_at":"2026-07-05T03:50:13.512741+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHODBREYOHHK","created_at":"2026-07-05T03:50:13.512741+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHODBREYOHHKEOR2","created_at":"2026-07-05T03:50:13.512741+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHODBREY","created_at":"2026-07-05T03:50:13.512741+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/DHODBREYOHHKEOR2NUHR2POJP5","json":"https://pith.science/pith/DHODBREYOHHKEOR2NUHR2POJP5.json","graph_json":"https://pith.science/api/pith-number/DHODBREYOHHKEOR2NUHR2POJP5/graph.json","events_json":"https://pith.science/api/pith-number/DHODBREYOHHKEOR2NUHR2POJP5/events.json","paper":"https://pith.science/paper/DHODBREY"},"agent_actions":{"view_html":"https://pith.science/pith/DHODBREYOHHKEOR2NUHR2POJP5","download_json":"https://pith.science/pith/DHODBREYOHHKEOR2NUHR2POJP5.json","view_paper":"https://pith.science/paper/DHODBREY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.05554&json=true","fetch_graph":"https://pith.science/api/pith-number/DHODBREYOHHKEOR2NUHR2POJP5/graph.json","fetch_events":"https://pith.science/api/pith-number/DHODBREYOHHKEOR2NUHR2POJP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHODBREYOHHKEOR2NUHR2POJP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHODBREYOHHKEOR2NUHR2POJP5/action/storage_attestation","attest_author":"https://pith.science/pith/DHODBREYOHHKEOR2NUHR2POJP5/action/author_attestation","sign_citation":"https://pith.science/pith/DHODBREYOHHKEOR2NUHR2POJP5/action/citation_signature","submit_replication":"https://pith.science/pith/DHODBREYOHHKEOR2NUHR2POJP5/action/replication_record"}},"created_at":"2026-07-05T03:50:13.512741+00:00","updated_at":"2026-07-05T03:50:13.512741+00:00"}