{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XBLQ4Z6UNEKBRKCSGIZAPLOJNN","short_pith_number":"pith:XBLQ4Z6U","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"},"canonical_sha256":"b8570e67d4691418a852323207adc96b65a178198e5008f828e77cb950f6e019","source":{"kind":"arxiv","id":"2008.01590","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.01590","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"2008.01590v2","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.01590","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"XBLQ4Z6UNEKB","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"pith_short_16","alias_value":"XBLQ4Z6UNEKBRKCS","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"pith_short_8","alias_value":"XBLQ4Z6U","created_at":"2026-07-05T03:08:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XBLQ4Z6UNEKBRKCSGIZAPLOJNN","target":"record","payload":{"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"},"canonical_sha256":"b8570e67d4691418a852323207adc96b65a178198e5008f828e77cb950f6e019","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"},"source_kind":"arxiv","source_id":"2008.01590","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTkKTJv4SQ6inRexVDtWo24+acTzC/64ufTpiB94yaxmA8a7mDxty5tciUIgg4zP265Wb+VrfGIqIGpah5t2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:40:48.739101Z"},"content_sha256":"d569c87bc15a6a6b6371f126700f8832e1e131438852345748a4ce464f8edead","schema_version":"1.0","event_id":"sha256:d569c87bc15a6a6b6371f126700f8832e1e131438852345748a4ce464f8edead"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XBLQ4Z6UNEKBRKCSGIZAPLOJNN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:08:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sS7O72Hw38LNeeSNaLHXsAmOg4A5GkIK8WvEozXzAUznGHSBKbTaIHliXfav755gY+BicqOHSJrYSatXXtmwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:40:48.739625Z"},"content_sha256":"56b6afc74047b2d47d66adfee3cb458dbe9bdc8ce03c73cc46787963fff8df5d","schema_version":"1.0","event_id":"sha256:56b6afc74047b2d47d66adfee3cb458dbe9bdc8ce03c73cc46787963fff8df5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/bundle.json","state_url":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-22T01:40:48Z","links":{"resolver":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN","bundle":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/bundle.json","state":"https://pith.science/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBLQ4Z6UNEKBRKCSGIZAPLOJNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XBLQ4Z6UNEKBRKCSGIZAPLOJNN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2d2ac76604c76cb813b5438d2d578ac02baf177bc3cad7c55b3e4f57828c32ef","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-03T14:58:57Z","title_canon_sha256":"19d06367460db46221099c6ff8fa1c9c35b2107df869bf6d7b11e6d7ddd0dbf6"},"schema_version":"1.0","source":{"id":"2008.01590","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.01590","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"arxiv_version","alias_value":"2008.01590v2","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.01590","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"pith_short_12","alias_value":"XBLQ4Z6UNEKB","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"pith_short_16","alias_value":"XBLQ4Z6UNEKBRKCS","created_at":"2026-07-05T03:08:53Z"},{"alias_kind":"pith_short_8","alias_value":"XBLQ4Z6U","created_at":"2026-07-05T03:08:53Z"}],"graph_snapshots":[{"event_id":"sha256:56b6afc74047b2d47d66adfee3cb458dbe9bdc8ce03c73cc46787963fff8df5d","target":"graph","created_at":"2026-07-05T03:08:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.01590/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrea Munaro, Daniel Paulusma, Jake Horsfield, Nick Brettell","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-03T14:58:57Z","title":"List $k$-Colouring $P_t$-Free Graphs: a Mim-width Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.01590","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d569c87bc15a6a6b6371f126700f8832e1e131438852345748a4ce464f8edead","target":"record","created_at":"2026-07-05T03:08:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2d2ac76604c76cb813b5438d2d578ac02baf177bc3cad7c55b3e4f57828c32ef","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-03T14:58:57Z","title_canon_sha256":"19d06367460db46221099c6ff8fa1c9c35b2107df869bf6d7b11e6d7ddd0dbf6"},"schema_version":"1.0","source":{"id":"2008.01590","kind":"arxiv","version":2}},"canonical_sha256":"b8570e67d4691418a852323207adc96b65a178198e5008f828e77cb950f6e019","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8570e67d4691418a852323207adc96b65a178198e5008f828e77cb950f6e019","first_computed_at":"2026-07-05T03:08:53.781574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:08:53.781574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mVAcFedqCjnHUGHpwknwhGyBiyl6d3e5WtD+VmrutK9KtU1ifG3bQua34YqsYrTL7wTxhqpHNELVphdhBhcZBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:08:53.781934Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.01590","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d569c87bc15a6a6b6371f126700f8832e1e131438852345748a4ce464f8edead","sha256:56b6afc74047b2d47d66adfee3cb458dbe9bdc8ce03c73cc46787963fff8df5d"],"state_sha256":"8e49fa6378fe287940e728d19ebdcd149d616667c8bfcff5418c4172ecfb6d0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whqdvnpxsBOYzPeOojEkSCr/VyHtZqr3N5JNPYW1dvWFyLiNoVGCCglgk4Yhu7PMnSQ5/B09yc2KDTyZuWb3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T01:40:48.744221Z","bundle_sha256":"503116146ced6d2ea575f65b5be5a3d442e687bb70602c633b731ba9b9e5df25"}}