{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2HX2F5B3OZQDCQ2IY5ZGGTPPBB","short_pith_number":"pith:2HX2F5B3","schema_version":"1.0","canonical_sha256":"d1efa2f43b7660314348c772634def086511b83bacc089945006ca5958f1c257","source":{"kind":"arxiv","id":"1310.0340","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Coloring Graphs without Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Pavol Hell, Shenwei Huang","submitted_at":"2013-09-28T19:34:49Z","abstract_excerpt":"Let $P_t$ and $C_\\ell$ denote a path on $t$ vertices and a cycle on $\\ell$ vertices, respectively. In this paper we study the $k$-coloring problem for $(P_t,C_\\ell)$-free graphs. Maffray and Morel, and Bruce, Hoang and Sawada, have proved that 3-colorability of $P_5$-free graphs has a finite forbidden induced subgraphs characterization, while Hoang, Moore, Recoskie, Sawada, and Vatshelle have shown that $k$-colorability of $P_5$-free graphs for $k \\geq 4$ does not. These authors have also shown, aided by a computer search, that 4-colorability of $(P_5,C_5)$-free graphs does have a finite forbi"},"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":"1310.0340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-28T19:34:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"25055dc75c35198bc4f65395c60e50c5b88597a178cf2d12e63679499c39996f","abstract_canon_sha256":"3ec9e1b30b58a1a7cc12df07e0b77037580264eac40ff0ad64cb53397e94adab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:36.550103Z","signature_b64":"7NZw7+OaDUNX25rv1G/3mfYd+CeDc1+0S9uoSAE2Q7A7HTjlELpaOvQgyIp8b0qwsMNKI4I7nFp0R62KTSekAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1efa2f43b7660314348c772634def086511b83bacc089945006ca5958f1c257","last_reissued_at":"2026-05-18T03:11:36.549552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:36.549552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Coloring Graphs without Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Pavol Hell, Shenwei Huang","submitted_at":"2013-09-28T19:34:49Z","abstract_excerpt":"Let $P_t$ and $C_\\ell$ denote a path on $t$ vertices and a cycle on $\\ell$ vertices, respectively. In this paper we study the $k$-coloring problem for $(P_t,C_\\ell)$-free graphs. Maffray and Morel, and Bruce, Hoang and Sawada, have proved that 3-colorability of $P_5$-free graphs has a finite forbidden induced subgraphs characterization, while Hoang, Moore, Recoskie, Sawada, and Vatshelle have shown that $k$-colorability of $P_5$-free graphs for $k \\geq 4$ does not. These authors have also shown, aided by a computer search, that 4-colorability of $(P_5,C_5)$-free graphs does have a finite forbi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0340","kind":"arxiv","version":1},"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":"1310.0340","created_at":"2026-05-18T03:11:36.549638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.0340v1","created_at":"2026-05-18T03:11:36.549638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0340","created_at":"2026-05-18T03:11:36.549638+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HX2F5B3OZQD","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HX2F5B3OZQDCQ2I","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HX2F5B3","created_at":"2026-05-18T12:27:30.460161+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/2HX2F5B3OZQDCQ2IY5ZGGTPPBB","json":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB.json","graph_json":"https://pith.science/api/pith-number/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/graph.json","events_json":"https://pith.science/api/pith-number/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/events.json","paper":"https://pith.science/paper/2HX2F5B3"},"agent_actions":{"view_html":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB","download_json":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB.json","view_paper":"https://pith.science/paper/2HX2F5B3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.0340&json=true","fetch_graph":"https://pith.science/api/pith-number/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/graph.json","fetch_events":"https://pith.science/api/pith-number/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/action/storage_attestation","attest_author":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/action/author_attestation","sign_citation":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/action/citation_signature","submit_replication":"https://pith.science/pith/2HX2F5B3OZQDCQ2IY5ZGGTPPBB/action/replication_record"}},"created_at":"2026-05-18T03:11:36.549638+00:00","updated_at":"2026-05-18T03:11:36.549638+00:00"}