{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:57JHBCN5AECDCDNHRR74BF7CNK","short_pith_number":"pith:57JHBCN5","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"},"canonical_sha256":"efd27089bd0104310da78c7fc097e26aa6c1c3953a6bed89899086a491a6b1e1","source":{"kind":"arxiv","id":"1712.02447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02447","created_at":"2026-05-18T00:28:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02447v1","created_at":"2026-05-18T00:28:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02447","created_at":"2026-05-18T00:28:34Z"},{"alias_kind":"pith_short_12","alias_value":"57JHBCN5AECD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"57JHBCN5AECDCDNH","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"57JHBCN5","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:57JHBCN5AECDCDNHRR74BF7CNK","target":"record","payload":{"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"},"canonical_sha256":"efd27089bd0104310da78c7fc097e26aa6c1c3953a6bed89899086a491a6b1e1","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"},"source_kind":"arxiv","source_id":"1712.02447","source_version":1,"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:28:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/Lzq0yEgE1A0c9m3RxlazOxg0u9SqySg+WqfwGLoJhk/VtS+w6KAg6kQP7ADBHdWEr2xtI3LBuxWbb3fjAIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:34:24.948105Z"},"content_sha256":"2e334632d8632e7ebd4f41b252fb6855a6d68164eb1bfdd9611c8beaeee9ac8b","schema_version":"1.0","event_id":"sha256:2e334632d8632e7ebd4f41b252fb6855a6d68164eb1bfdd9611c8beaeee9ac8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:57JHBCN5AECDCDNHRR74BF7CNK","target":"graph","payload":{"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"},"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:28:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kh6n0hKBHMzSVZu2enJLSZ9gttK13uePLjw8pfrAQjfXqEjf555U2V/CD3eV8Z2oxK0PSNOF5uZj3EwiIkIlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:34:24.948464Z"},"content_sha256":"0dc05fbae69725b6304d9f3bf70c4db861b300e948f6c4166b12d60c2357f2d6","schema_version":"1.0","event_id":"sha256:0dc05fbae69725b6304d9f3bf70c4db861b300e948f6c4166b12d60c2357f2d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK/bundle.json","state_url":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57JHBCN5AECDCDNHRR74BF7CNK/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-06-03T00:34:24Z","links":{"resolver":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK","bundle":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK/bundle.json","state":"https://pith.science/pith/57JHBCN5AECDCDNHRR74BF7CNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57JHBCN5AECDCDNHRR74BF7CNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:57JHBCN5AECDCDNHRR74BF7CNK","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":"3e3cd6fbaa8ce0f1fd886b803952806e27143f88cf257663713381784f4956ad","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-06T23:45:33Z","title_canon_sha256":"e557845ed432d593d5a8e8905e505fdb62af5c2f927334c88698963a44f4a832"},"schema_version":"1.0","source":{"id":"1712.02447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02447","created_at":"2026-05-18T00:28:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02447v1","created_at":"2026-05-18T00:28:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02447","created_at":"2026-05-18T00:28:34Z"},{"alias_kind":"pith_short_12","alias_value":"57JHBCN5AECD","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"57JHBCN5AECDCDNH","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"57JHBCN5","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:0dc05fbae69725b6304d9f3bf70c4db861b300e948f6c4166b12d60c2357f2d6","target":"graph","created_at":"2026-05-18T00:28:34Z","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":"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","authors_text":"Daniel Paulusma, Konrad Dabrowski","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-06T23:45:33Z","title":"On Colouring $(2P_2,H)$-Free and $(P_5,H)$-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02447","kind":"arxiv","version":1},"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:2e334632d8632e7ebd4f41b252fb6855a6d68164eb1bfdd9611c8beaeee9ac8b","target":"record","created_at":"2026-05-18T00:28:34Z","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":"3e3cd6fbaa8ce0f1fd886b803952806e27143f88cf257663713381784f4956ad","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-06T23:45:33Z","title_canon_sha256":"e557845ed432d593d5a8e8905e505fdb62af5c2f927334c88698963a44f4a832"},"schema_version":"1.0","source":{"id":"1712.02447","kind":"arxiv","version":1}},"canonical_sha256":"efd27089bd0104310da78c7fc097e26aa6c1c3953a6bed89899086a491a6b1e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efd27089bd0104310da78c7fc097e26aa6c1c3953a6bed89899086a491a6b1e1","first_computed_at":"2026-05-18T00:28:34.127618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:34.127618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XvQb8Y3K3x8D4Ba2u/6IADvKYNGs8ZZpR0IgC9hIXUQX6UBdCRgTjxGG7xgPW2QZrrZB4ck7p55YRDtN+HhEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:34.128397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e334632d8632e7ebd4f41b252fb6855a6d68164eb1bfdd9611c8beaeee9ac8b","sha256:0dc05fbae69725b6304d9f3bf70c4db861b300e948f6c4166b12d60c2357f2d6"],"state_sha256":"9ba88793decb518006f6ff1c6cef04f2381ed49fe4c5fb673c3c336688faeda7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CC7a2FFu4wkzLW+4TgEqFA4rXzsh/QgBnX/G5mbwhzU2UvbpoIlJ+Eq30cl2Hm6BYZpSBp8bJCWTrVJCD1z9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:34:24.950386Z","bundle_sha256":"6f54c899c5c2c6fad698026e89c28d6e05e807116632845ce2f15ca7b44f7738"}}