{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3YMXVM74OSN5KFATZQY7GJ3MQC","short_pith_number":"pith:3YMXVM74","schema_version":"1.0","canonical_sha256":"de197ab3fc749bd51413cc31f3276c80bbaef2c33e3652352ec952d8b05c2cf0","source":{"kind":"arxiv","id":"1709.07712","version":2},"attestation_state":"computed","paper":{"title":"Polynomial Cases for the Vertex Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Lucas Pastor, T. Karthick","submitted_at":"2017-09-22T12:27:54Z","abstract_excerpt":"The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of four of these problems: for ($P_5$, dart)-free graphs, ($P_5$, banner)-free graphs, ($P_5$, bull)-free graphs, and (fork, bull)-free graphs."},"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":"1709.07712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-22T12:27:54Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"d6f631ebc6852c2dc12201eb7aace6d96daa19a40974e09a980acdd2d04baf5d","abstract_canon_sha256":"f4be4a3ba190c040bd0ba0cad00e7aabbe5d74c7d914e4c99b48cfff688179e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:28.722590Z","signature_b64":"HGNqWz6QXqFiBtJanf5UOdtVbU8te2AKs8l1mRCCtaHgohloadKSD3FPXTZkMYQp1BzxuWU6ahFxN/KBKa1cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de197ab3fc749bd51413cc31f3276c80bbaef2c33e3652352ec952d8b05c2cf0","last_reissued_at":"2026-05-18T00:14:28.721670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:28.721670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Cases for the Vertex Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Lucas Pastor, T. Karthick","submitted_at":"2017-09-22T12:27:54Z","abstract_excerpt":"The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of four of these problems: for ($P_5$, dart)-free graphs, ($P_5$, banner)-free graphs, ($P_5$, bull)-free graphs, and (fork, bull)-free graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07712","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":"1709.07712","created_at":"2026-05-18T00:14:28.721822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07712v2","created_at":"2026-05-18T00:14:28.721822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07712","created_at":"2026-05-18T00:14:28.721822+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YMXVM74OSN5","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YMXVM74OSN5KFAT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YMXVM74","created_at":"2026-05-18T12:30:58.224056+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/3YMXVM74OSN5KFATZQY7GJ3MQC","json":"https://pith.science/pith/3YMXVM74OSN5KFATZQY7GJ3MQC.json","graph_json":"https://pith.science/api/pith-number/3YMXVM74OSN5KFATZQY7GJ3MQC/graph.json","events_json":"https://pith.science/api/pith-number/3YMXVM74OSN5KFATZQY7GJ3MQC/events.json","paper":"https://pith.science/paper/3YMXVM74"},"agent_actions":{"view_html":"https://pith.science/pith/3YMXVM74OSN5KFATZQY7GJ3MQC","download_json":"https://pith.science/pith/3YMXVM74OSN5KFATZQY7GJ3MQC.json","view_paper":"https://pith.science/paper/3YMXVM74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07712&json=true","fetch_graph":"https://pith.science/api/pith-number/3YMXVM74OSN5KFATZQY7GJ3MQC/graph.json","fetch_events":"https://pith.science/api/pith-number/3YMXVM74OSN5KFATZQY7GJ3MQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YMXVM74OSN5KFATZQY7GJ3MQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YMXVM74OSN5KFATZQY7GJ3MQC/action/storage_attestation","attest_author":"https://pith.science/pith/3YMXVM74OSN5KFATZQY7GJ3MQC/action/author_attestation","sign_citation":"https://pith.science/pith/3YMXVM74OSN5KFATZQY7GJ3MQC/action/citation_signature","submit_replication":"https://pith.science/pith/3YMXVM74OSN5KFATZQY7GJ3MQC/action/replication_record"}},"created_at":"2026-05-18T00:14:28.721822+00:00","updated_at":"2026-05-18T00:14:28.721822+00:00"}