{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O7SIEAINEQ4H2CU2FX7VHDG2I4","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":"808f2a94b12f7ada1a29b61b93ab5e952912738c9bdf0ae2dc465a4383c6b021","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-28T21:17:04Z","title_canon_sha256":"b01dc70ecce22e2ef547cf12b1c253ec32187e6392643e8bca13ac6c34aa706c"},"schema_version":"1.0","source":{"id":"1806.11196","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11196","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11196v2","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11196","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"O7SIEAINEQ4H","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O7SIEAINEQ4H2CU2","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O7SIEAIN","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:d3d18575c5c16ad237a7898aa3d6fc58335e4c09807bb0ec1026e27d95fd9bcb","target":"graph","created_at":"2026-05-18T00:11:56Z","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":"For an integer $r$, the graph $P_6+rP_3$ has $r+1$ components, one of which is a path on $6$ vertices, and each of the others is a path on $3$ vertices. In this paper we provide a polynomial-time algorithm to test if a graph with no induced subgraph isomorphic to $P_6+rP_3$ is three-colorable. We also solve the list version of this problem, where each vertex is assigned a list of possible colors, which is a subset of $\\{1,2,3\\}$.","authors_text":"Maria Chudnovsky, Mingxian Zhong, Shenwei Huang, Sophie Spirkl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-28T21:17:04Z","title":"List-three-coloring graphs with no induced $P_6+rP_3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11196","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:94413ff004cf643c38fec9a6284b95a0d9e47ec022801f6cd3334434d712c4d2","target":"record","created_at":"2026-05-18T00:11:56Z","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":"808f2a94b12f7ada1a29b61b93ab5e952912738c9bdf0ae2dc465a4383c6b021","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-28T21:17:04Z","title_canon_sha256":"b01dc70ecce22e2ef547cf12b1c253ec32187e6392643e8bca13ac6c34aa706c"},"schema_version":"1.0","source":{"id":"1806.11196","kind":"arxiv","version":2}},"canonical_sha256":"77e482010d24387d0a9a2dff538cda473f716374a3c3eefd2f6721abcef1f3ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77e482010d24387d0a9a2dff538cda473f716374a3c3eefd2f6721abcef1f3ff","first_computed_at":"2026-05-18T00:11:56.424608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:56.424608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yk9iWpnXdHlojk+Xlys1CVikl7vksxjaNTArs4YXe1D1lCTsgGcDLva9XwKnIHVmtH854zL+9pObM5NI5cKmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:56.425384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.11196","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94413ff004cf643c38fec9a6284b95a0d9e47ec022801f6cd3334434d712c4d2","sha256:d3d18575c5c16ad237a7898aa3d6fc58335e4c09807bb0ec1026e27d95fd9bcb"],"state_sha256":"69b52475947343075b36432d3b5690b162a5954c6ff0f4e440b12a9944af8577"}