{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:57JHBCN5AECDCDNHRR74BF7CNK","short_pith_number":"pith:57JHBCN5","schema_version":"1.0","canonical_sha256":"efd27089bd0104310da78c7fc097e26aa6c1c3953a6bed89899086a491a6b1e1","source":{"kind":"arxiv","id":"1712.02447","version":1},"attestation_state":"computed","paper":{"title":"On Colouring $(2P_2,H)$-Free and $(P_5,H)$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Daniel Paulusma, Konrad Dabrowski","submitted_at":"2017-12-06T23:45:33Z","abstract_excerpt":"The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no induced subgraph isomorphic to $H_1$ or $H_2$. A connected graph $H_1$ is almost classified if Colouring on $(H_1,H_2)$-free graphs is known to be polynomial-time solvable or NP-complete for all but finitely many connected graphs $H_2$. We show that every connected graph $H_1$ apart from the claw $K_{1,3}$ and the $5$-vertex path $P_5$ is almost classified. We als"},"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":"1712.02447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-06T23:45:33Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"e557845ed432d593d5a8e8905e505fdb62af5c2f927334c88698963a44f4a832","abstract_canon_sha256":"3e3cd6fbaa8ce0f1fd886b803952806e27143f88cf257663713381784f4956ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:34.128397Z","signature_b64":"XvQb8Y3K3x8D4Ba2u/6IADvKYNGs8ZZpR0IgC9hIXUQX6UBdCRgTjxGG7xgPW2QZrrZB4ck7p55YRDtN+HhEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd27089bd0104310da78c7fc097e26aa6c1c3953a6bed89899086a491a6b1e1","last_reissued_at":"2026-05-18T00:28:34.127618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:34.127618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Colouring $(2P_2,H)$-Free and $(P_5,H)$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Daniel Paulusma, Konrad Dabrowski","submitted_at":"2017-12-06T23:45:33Z","abstract_excerpt":"The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no induced subgraph isomorphic to $H_1$ or $H_2$. A connected graph $H_1$ is almost classified if Colouring on $(H_1,H_2)$-free graphs is known to be polynomial-time solvable or NP-complete for all but finitely many connected graphs $H_2$. We show that every connected graph $H_1$ apart from the claw $K_{1,3}$ and the $5$-vertex path $P_5$ is almost classified. We als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02447","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":"1712.02447","created_at":"2026-05-18T00:28:34.127738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02447v1","created_at":"2026-05-18T00:28:34.127738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02447","created_at":"2026-05-18T00:28:34.127738+00:00"},{"alias_kind":"pith_short_12","alias_value":"57JHBCN5AECD","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"57JHBCN5AECDCDNH","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"57JHBCN5","created_at":"2026-05-18T12:31:00.734936+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/57JHBCN5AECDCDNHRR74BF7CNK","json":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK.json","graph_json":"https://pith.science/api/pith-number/57JHBCN5AECDCDNHRR74BF7CNK/graph.json","events_json":"https://pith.science/api/pith-number/57JHBCN5AECDCDNHRR74BF7CNK/events.json","paper":"https://pith.science/paper/57JHBCN5"},"agent_actions":{"view_html":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK","download_json":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK.json","view_paper":"https://pith.science/paper/57JHBCN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02447&json=true","fetch_graph":"https://pith.science/api/pith-number/57JHBCN5AECDCDNHRR74BF7CNK/graph.json","fetch_events":"https://pith.science/api/pith-number/57JHBCN5AECDCDNHRR74BF7CNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK/action/storage_attestation","attest_author":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK/action/author_attestation","sign_citation":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK/action/citation_signature","submit_replication":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK/action/replication_record"}},"created_at":"2026-05-18T00:28:34.127738+00:00","updated_at":"2026-05-18T00:28:34.127738+00:00"}