{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:24KVTR2K2JZRWDUKAMW5356YPD","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":"51afdd02c0702339b78a7135b66e75b4ac615e58d946ef9a1c79415432412bfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T14:26:29Z","title_canon_sha256":"7c6fc599e00434fc54f3a075617ef6922137da8cd6bdb39a55dd83d802ab9266"},"schema_version":"1.0","source":{"id":"1808.03561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03561","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03561v1","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03561","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"24KVTR2K2JZR","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"24KVTR2K2JZRWDUK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"24KVTR2K","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:d390ba345bf6434955ca95f440b63fe701b095396b946998945c96489506ce36","target":"graph","created_at":"2026-05-18T00:08:24Z","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"},"paper":{"abstract_excerpt":"A partition $(V_1,\\ldots,V_k)$ of the vertex set of a graph $G$ with a (not necessarily proper) colouring $c$ is colourful if no two vertices in any $V_i$ have the same colour and every set $V_i$ induces a connected graph. The COLOURFUL PARTITION problem is to decide whether a coloured graph $(G,c)$ has a colourful partition of size at most $k$. This problem is closely related to the COLOURFUL COMPONENTS problem, which is to decide whether a graph can be modified into a graph whose connected components form a colourful partition by deleting at most $p$ edges. Nevertheless we show that COLOURFU","authors_text":"Daniel Paulusma, Guillaume Fertin, Konrad K. Dabrowski, Laurent Bulteau, Matthew Johnson, Stephane Vialette","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T14:26:29Z","title":"Finding a Small Number of Colourful Components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03561","kind":"arxiv","version":1},"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:ac6cee33aad631b83baf3d19248a43e3b0d1340ba93b5ab58cf2c27adbaea5ce","target":"record","created_at":"2026-05-18T00:08:24Z","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":"51afdd02c0702339b78a7135b66e75b4ac615e58d946ef9a1c79415432412bfa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-10T14:26:29Z","title_canon_sha256":"7c6fc599e00434fc54f3a075617ef6922137da8cd6bdb39a55dd83d802ab9266"},"schema_version":"1.0","source":{"id":"1808.03561","kind":"arxiv","version":1}},"canonical_sha256":"d71559c74ad2731b0e8a032dddf7d878f59a0301018108419583f0ace823b2ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d71559c74ad2731b0e8a032dddf7d878f59a0301018108419583f0ace823b2ea","first_computed_at":"2026-05-18T00:08:24.670779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:24.670779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Yp+9QrkmVyqAy0kan4EpxR52BkU48+euTAHNSmtMkWRA+2AfxqzAm4bwWlYm5zGTscib2oBYEUdtKKjXmtwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:24.671192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac6cee33aad631b83baf3d19248a43e3b0d1340ba93b5ab58cf2c27adbaea5ce","sha256:d390ba345bf6434955ca95f440b63fe701b095396b946998945c96489506ce36"],"state_sha256":"42961170fe6c6e88ef1818011f280a0b721bc5643619446575d15d4c40947026"}