{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AWMASJXSJT37R4YJRKTNNRYMAH","short_pith_number":"pith:AWMASJXS","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"},"canonical_sha256":"05980926f24cf7f8f3098aa6d6c70c01e9d0d335e2e69b8431b8ebbbf66f38d9","source":{"kind":"arxiv","id":"1802.02283","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02283","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02283v2","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02283","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"AWMASJXSJT37","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AWMASJXSJT37R4YJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AWMASJXS","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AWMASJXSJT37R4YJRKTNNRYMAH","target":"record","payload":{"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"},"canonical_sha256":"05980926f24cf7f8f3098aa6d6c70c01e9d0d335e2e69b8431b8ebbbf66f38d9","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"},"source_kind":"arxiv","source_id":"1802.02283","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-05-18T00:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWcxa+hvrtDWP9uwgpZliP3sbqexA0lA4g5bERqsxmI88h6Y6euLW1sEqbKpHQGw6nZUjdASyFDXz/VheDgqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:15:36.330034Z"},"content_sha256":"586a63e992caa0f4a7710407aca4e62e0d7cd57ba51705e1a601944d0d07e2e3","schema_version":"1.0","event_id":"sha256:586a63e992caa0f4a7710407aca4e62e0d7cd57ba51705e1a601944d0d07e2e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AWMASJXSJT37R4YJRKTNNRYMAH","target":"graph","payload":{"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"},"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-05-18T00:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1HzOOoSkLrs0APod1dcMhGqXcOC34TsCion3DPrIvVqlzFX+wfq1mpxwCTO9Kx5zEE7Jf0H/8BFrqKG8Az5LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:15:36.330423Z"},"content_sha256":"963e31a7e21e9a51e5c458a5da4b5c0013122144c65b654224c8294675692a5d","schema_version":"1.0","event_id":"sha256:963e31a7e21e9a51e5c458a5da4b5c0013122144c65b654224c8294675692a5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH/bundle.json","state_url":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWMASJXSJT37R4YJRKTNNRYMAH/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-05-22T18:15:36Z","links":{"resolver":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH","bundle":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH/bundle.json","state":"https://pith.science/pith/AWMASJXSJT37R4YJRKTNNRYMAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWMASJXSJT37R4YJRKTNNRYMAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AWMASJXSJT37R4YJRKTNNRYMAH","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":"5e26502ad38baff7d6e265a2406fd7169f2bb75f39ef32ca2e729ac0fa703c6f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-07T01:55:19Z","title_canon_sha256":"9c66b77df67369273dabfebec870d40b8b32673f19790125bb74d8b899af9678"},"schema_version":"1.0","source":{"id":"1802.02283","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02283","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02283v2","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02283","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"AWMASJXSJT37","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AWMASJXSJT37R4YJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AWMASJXS","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:963e31a7e21e9a51e5c458a5da4b5c0013122144c65b654224c8294675692a5d","target":"graph","created_at":"2026-05-18T00:24:03Z","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":"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","authors_text":"Maria Chudnovsky, Mingxian Zhong, Sophie Spirkl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-07T01:55:19Z","title":"Four-coloring $P_6$-free graphs. II. Finding an excellent precoloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02283","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:586a63e992caa0f4a7710407aca4e62e0d7cd57ba51705e1a601944d0d07e2e3","target":"record","created_at":"2026-05-18T00:24:03Z","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":"5e26502ad38baff7d6e265a2406fd7169f2bb75f39ef32ca2e729ac0fa703c6f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-07T01:55:19Z","title_canon_sha256":"9c66b77df67369273dabfebec870d40b8b32673f19790125bb74d8b899af9678"},"schema_version":"1.0","source":{"id":"1802.02283","kind":"arxiv","version":2}},"canonical_sha256":"05980926f24cf7f8f3098aa6d6c70c01e9d0d335e2e69b8431b8ebbbf66f38d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05980926f24cf7f8f3098aa6d6c70c01e9d0d335e2e69b8431b8ebbbf66f38d9","first_computed_at":"2026-05-18T00:24:03.659160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:03.659160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D4KALm/3ciBScq1QtI7ptQG88Z17Y29Zy7DIfuYRUWUjoaKlbfvxd4/NdVOobLnlvD7E4bLYlhZy7DJ/Ge8XBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:03.659823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02283","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:586a63e992caa0f4a7710407aca4e62e0d7cd57ba51705e1a601944d0d07e2e3","sha256:963e31a7e21e9a51e5c458a5da4b5c0013122144c65b654224c8294675692a5d"],"state_sha256":"5bdcee1981be996ccc7e3bc5c4b10a9ab6e762bb76d090646fae0df3634a28a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HiewGndSIxcSKLkLIUUXwJtARka4pFQyrn8x9y8wCKjyURGj1CGFggZDZ9hdpCmMYFuVuW2fC20JDf15KR62CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T18:15:36.333055Z","bundle_sha256":"7b99bdcfdc95c5b2bc14c9204431b26ac977856bb492fbc09b362a0c92c22796"}}