{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AWMASJXSJT37R4YJRKTNNRYMAH","short_pith_number":"pith:AWMASJXS","schema_version":"1.0","canonical_sha256":"05980926f24cf7f8f3098aa6d6c70c01e9d0d335e2e69b8431b8ebbbf66f38d9","source":{"kind":"arxiv","id":"1802.02283","version":2},"attestation_state":"computed","paper":{"title":"Four-coloring $P_6$-free graphs. II. Finding an excellent precoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Mingxian Zhong, Sophie Spirkl","submitted_at":"2018-02-07T01:55:19Z","abstract_excerpt":"This is the second paper in a series of two. The goal of the series is to give a polynomial time algorithm for the $4$-coloring problem and the $4$-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results this completes the classification of the complexity of the $4$-coloring problem for graphs with a connected forbidden induced subgraph.\n  In this paper we give a polynomial time algorithm that starts with a $4$-precoloring of a graph with no induced six-vertex path, and outputs a"},"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":"1802.02283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-07T01:55:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9c66b77df67369273dabfebec870d40b8b32673f19790125bb74d8b899af9678","abstract_canon_sha256":"5e26502ad38baff7d6e265a2406fd7169f2bb75f39ef32ca2e729ac0fa703c6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:03.659823Z","signature_b64":"D4KALm/3ciBScq1QtI7ptQG88Z17Y29Zy7DIfuYRUWUjoaKlbfvxd4/NdVOobLnlvD7E4bLYlhZy7DJ/Ge8XBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05980926f24cf7f8f3098aa6d6c70c01e9d0d335e2e69b8431b8ebbbf66f38d9","last_reissued_at":"2026-05-18T00:24:03.659160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:03.659160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Four-coloring $P_6$-free graphs. II. Finding an excellent precoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Mingxian Zhong, Sophie Spirkl","submitted_at":"2018-02-07T01:55:19Z","abstract_excerpt":"This is the second paper in a series of two. The goal of the series is to give a polynomial time algorithm for the $4$-coloring problem and the $4$-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results this completes the classification of the complexity of the $4$-coloring problem for graphs with a connected forbidden induced subgraph.\n  In this paper we give a polynomial time algorithm that starts with a $4$-precoloring of a graph with no induced six-vertex path, and outputs a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02283","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":""},"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":"1802.02283","created_at":"2026-05-18T00:24:03.659242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02283v2","created_at":"2026-05-18T00:24:03.659242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02283","created_at":"2026-05-18T00:24:03.659242+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWMASJXSJT37","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWMASJXSJT37R4YJ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWMASJXS","created_at":"2026-05-18T12:32:13.499390+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/AWMASJXSJT37R4YJRKTNNRYMAH","json":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH.json","graph_json":"https://pith.science/api/pith-number/AWMASJXSJT37R4YJRKTNNRYMAH/graph.json","events_json":"https://pith.science/api/pith-number/AWMASJXSJT37R4YJRKTNNRYMAH/events.json","paper":"https://pith.science/paper/AWMASJXS"},"agent_actions":{"view_html":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH","download_json":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH.json","view_paper":"https://pith.science/paper/AWMASJXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02283&json=true","fetch_graph":"https://pith.science/api/pith-number/AWMASJXSJT37R4YJRKTNNRYMAH/graph.json","fetch_events":"https://pith.science/api/pith-number/AWMASJXSJT37R4YJRKTNNRYMAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH/action/storage_attestation","attest_author":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH/action/author_attestation","sign_citation":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH/action/citation_signature","submit_replication":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH/action/replication_record"}},"created_at":"2026-05-18T00:24:03.659242+00:00","updated_at":"2026-05-18T00:24:03.659242+00:00"}