{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XBLQ4Z6UNEKBRKCSGIZAPLOJNN","short_pith_number":"pith:XBLQ4Z6U","schema_version":"1.0","canonical_sha256":"b8570e67d4691418a852323207adc96b65a178198e5008f828e77cb950f6e019","source":{"kind":"arxiv","id":"2008.01590","version":2},"attestation_state":"computed","paper":{"title":"List $k$-Colouring $P_t$-Free Graphs: a Mim-width Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrea Munaro, Daniel Paulusma, Jake Horsfield, Nick Brettell","submitted_at":"2020-08-03T14:58:57Z","abstract_excerpt":"A colouring of a graph $G=(V,E)$ is a mapping $c\\colon V\\to \\{1,2,\\ldots\\}$ such that $c(u)\\neq c(v)$ for every two adjacent vertices $u$ and $v$ of $G$. The {\\sc List $k$-Colouring} problem is to decide whether a graph $G=(V,E)$ with a list $L(u)\\subseteq \\{1,\\ldots,k\\}$ for each $u\\in V$ has a colouring $c$ such that $c(u)\\in L(u)$ for every $u\\in V$. Let $P_t$ be the path on $t$ vertices and let $K_{1,s}^1$ be the graph obtained from the $(s+1)$-vertex star $K_{1,s}$ by subdividing each of its edges exactly once.Recently, Chudnovsky, Spirkl and Zhong (DM 2020) proved that List $3$-Colouring"},"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":"2008.01590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-03T14:58:57Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"19d06367460db46221099c6ff8fa1c9c35b2107df869bf6d7b11e6d7ddd0dbf6","abstract_canon_sha256":"2d2ac76604c76cb813b5438d2d578ac02baf177bc3cad7c55b3e4f57828c32ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:08:53.781934Z","signature_b64":"mVAcFedqCjnHUGHpwknwhGyBiyl6d3e5WtD+VmrutK9KtU1ifG3bQua34YqsYrTL7wTxhqpHNELVphdhBhcZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8570e67d4691418a852323207adc96b65a178198e5008f828e77cb950f6e019","last_reissued_at":"2026-07-05T03:08:53.781574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:08:53.781574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List $k$-Colouring $P_t$-Free Graphs: a Mim-width Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrea Munaro, Daniel Paulusma, Jake Horsfield, Nick Brettell","submitted_at":"2020-08-03T14:58:57Z","abstract_excerpt":"A colouring of a graph $G=(V,E)$ is a mapping $c\\colon V\\to \\{1,2,\\ldots\\}$ such that $c(u)\\neq c(v)$ for every two adjacent vertices $u$ and $v$ of $G$. The {\\sc List $k$-Colouring} problem is to decide whether a graph $G=(V,E)$ with a list $L(u)\\subseteq \\{1,\\ldots,k\\}$ for each $u\\in V$ has a colouring $c$ such that $c(u)\\in L(u)$ for every $u\\in V$. Let $P_t$ be the path on $t$ vertices and let $K_{1,s}^1$ be the graph obtained from the $(s+1)$-vertex star $K_{1,s}$ by subdividing each of its edges exactly once.Recently, Chudnovsky, Spirkl and Zhong (DM 2020) proved that List $3$-Colouring"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.01590","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/2008.01590/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":"2008.01590","created_at":"2026-07-05T03:08:53.781629+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.01590v2","created_at":"2026-07-05T03:08:53.781629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.01590","created_at":"2026-07-05T03:08:53.781629+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBLQ4Z6UNEKB","created_at":"2026-07-05T03:08:53.781629+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBLQ4Z6UNEKBRKCS","created_at":"2026-07-05T03:08:53.781629+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBLQ4Z6U","created_at":"2026-07-05T03:08:53.781629+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/XBLQ4Z6UNEKBRKCSGIZAPLOJNN","json":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN.json","graph_json":"https://pith.science/api/pith-number/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/graph.json","events_json":"https://pith.science/api/pith-number/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/events.json","paper":"https://pith.science/paper/XBLQ4Z6U"},"agent_actions":{"view_html":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN","download_json":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN.json","view_paper":"https://pith.science/paper/XBLQ4Z6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.01590&json=true","fetch_graph":"https://pith.science/api/pith-number/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/graph.json","fetch_events":"https://pith.science/api/pith-number/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/action/storage_attestation","attest_author":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/action/author_attestation","sign_citation":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/action/citation_signature","submit_replication":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/action/replication_record"}},"created_at":"2026-07-05T03:08:53.781629+00:00","updated_at":"2026-07-05T03:08:53.781629+00:00"}