{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O7SIEAINEQ4H2CU2FX7VHDG2I4","short_pith_number":"pith:O7SIEAIN","schema_version":"1.0","canonical_sha256":"77e482010d24387d0a9a2dff538cda473f716374a3c3eefd2f6721abcef1f3ff","source":{"kind":"arxiv","id":"1806.11196","version":2},"attestation_state":"computed","paper":{"title":"List-three-coloring graphs with no induced $P_6+rP_3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Mingxian Zhong, Shenwei Huang, Sophie Spirkl","submitted_at":"2018-06-28T21:17:04Z","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\\}$."},"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":"1806.11196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-28T21:17:04Z","cross_cats_sorted":[],"title_canon_sha256":"b01dc70ecce22e2ef547cf12b1c253ec32187e6392643e8bca13ac6c34aa706c","abstract_canon_sha256":"808f2a94b12f7ada1a29b61b93ab5e952912738c9bdf0ae2dc465a4383c6b021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:56.425384Z","signature_b64":"yk9iWpnXdHlojk+Xlys1CVikl7vksxjaNTArs4YXe1D1lCTsgGcDLva9XwKnIHVmtH854zL+9pObM5NI5cKmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77e482010d24387d0a9a2dff538cda473f716374a3c3eefd2f6721abcef1f3ff","last_reissued_at":"2026-05-18T00:11:56.424608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:56.424608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List-three-coloring graphs with no induced $P_6+rP_3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Mingxian Zhong, Shenwei Huang, Sophie Spirkl","submitted_at":"2018-06-28T21:17:04Z","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\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11196","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":"1806.11196","created_at":"2026-05-18T00:11:56.424738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.11196v2","created_at":"2026-05-18T00:11:56.424738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11196","created_at":"2026-05-18T00:11:56.424738+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7SIEAINEQ4H","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7SIEAINEQ4H2CU2","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7SIEAIN","created_at":"2026-05-18T12:32:43.782077+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/O7SIEAINEQ4H2CU2FX7VHDG2I4","json":"https://pith.science/pith/O7SIEAINEQ4H2CU2FX7VHDG2I4.json","graph_json":"https://pith.science/api/pith-number/O7SIEAINEQ4H2CU2FX7VHDG2I4/graph.json","events_json":"https://pith.science/api/pith-number/O7SIEAINEQ4H2CU2FX7VHDG2I4/events.json","paper":"https://pith.science/paper/O7SIEAIN"},"agent_actions":{"view_html":"https://pith.science/pith/O7SIEAINEQ4H2CU2FX7VHDG2I4","download_json":"https://pith.science/pith/O7SIEAINEQ4H2CU2FX7VHDG2I4.json","view_paper":"https://pith.science/paper/O7SIEAIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.11196&json=true","fetch_graph":"https://pith.science/api/pith-number/O7SIEAINEQ4H2CU2FX7VHDG2I4/graph.json","fetch_events":"https://pith.science/api/pith-number/O7SIEAINEQ4H2CU2FX7VHDG2I4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7SIEAINEQ4H2CU2FX7VHDG2I4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7SIEAINEQ4H2CU2FX7VHDG2I4/action/storage_attestation","attest_author":"https://pith.science/pith/O7SIEAINEQ4H2CU2FX7VHDG2I4/action/author_attestation","sign_citation":"https://pith.science/pith/O7SIEAINEQ4H2CU2FX7VHDG2I4/action/citation_signature","submit_replication":"https://pith.science/pith/O7SIEAINEQ4H2CU2FX7VHDG2I4/action/replication_record"}},"created_at":"2026-05-18T00:11:56.424738+00:00","updated_at":"2026-05-18T00:11:56.424738+00:00"}