{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LN4UB6JFEFJXOR3GF6ZD5PW2EB","short_pith_number":"pith:LN4UB6JF","schema_version":"1.0","canonical_sha256":"5b7940f92521537747662fb23ebeda204f3e20eebf17a457cc06ec84f07c0f07","source":{"kind":"arxiv","id":"1403.8027","version":2},"attestation_state":"computed","paper":{"title":"On color-critical ($P_{5},\\overline{P}_5$)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ang\\`ele M. Hamel, Ch\\'inh T. Ho\\`ang, Fr\\'ed\\'eric Maffray, Harjinder S. Dhaliwal, Stefan A. Panait, Tyler J. D. McConnell","submitted_at":"2014-03-31T14:47:40Z","abstract_excerpt":"A graph is $k$-critical if it is $k$-chromatic but each of its proper induced subgraphs is ($k-1$)-colorable. It is known that the number of $4$-critical $P_5$-free graphs is finite, but there is an infinite number of $k$-critical $P_5$-free graphs for each $k \\geq 5$. We show that the number of $k$-critical $(P_5, \\overline{P}_5)$-free graphs is finite for every fixed $k$. Our result implies the existence of a certifying algorithm for $k$-coloring $(P_5, \\overline{P}_5)$-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":"1403.8027","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-31T14:47:40Z","cross_cats_sorted":[],"title_canon_sha256":"d3ca4b9993bb58480c437327741edc8550e77ffe547f179fd15c138b07c10889","abstract_canon_sha256":"2abb12b7b2451217254698b4667f383232983d408ded4020f6e7592737577a31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:38.854282Z","signature_b64":"EM/l6IDIJ7/UEXciBixBu5ekLp4iV5gaBHEom9l1HyWDer4XFHtW8bqNGxtqfCcsov4mfc99UjUQFpHhfRSbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b7940f92521537747662fb23ebeda204f3e20eebf17a457cc06ec84f07c0f07","last_reissued_at":"2026-05-18T02:32:38.853939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:38.853939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On color-critical ($P_{5},\\overline{P}_5$)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ang\\`ele M. Hamel, Ch\\'inh T. Ho\\`ang, Fr\\'ed\\'eric Maffray, Harjinder S. Dhaliwal, Stefan A. Panait, Tyler J. D. McConnell","submitted_at":"2014-03-31T14:47:40Z","abstract_excerpt":"A graph is $k$-critical if it is $k$-chromatic but each of its proper induced subgraphs is ($k-1$)-colorable. It is known that the number of $4$-critical $P_5$-free graphs is finite, but there is an infinite number of $k$-critical $P_5$-free graphs for each $k \\geq 5$. We show that the number of $k$-critical $(P_5, \\overline{P}_5)$-free graphs is finite for every fixed $k$. Our result implies the existence of a certifying algorithm for $k$-coloring $(P_5, \\overline{P}_5)$-free graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.8027","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":"1403.8027","created_at":"2026-05-18T02:32:38.853994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.8027v2","created_at":"2026-05-18T02:32:38.853994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.8027","created_at":"2026-05-18T02:32:38.853994+00:00"},{"alias_kind":"pith_short_12","alias_value":"LN4UB6JFEFJX","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LN4UB6JFEFJXOR3G","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LN4UB6JF","created_at":"2026-05-18T12:28:38.356838+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/LN4UB6JFEFJXOR3GF6ZD5PW2EB","json":"https://pith.science/pith/LN4UB6JFEFJXOR3GF6ZD5PW2EB.json","graph_json":"https://pith.science/api/pith-number/LN4UB6JFEFJXOR3GF6ZD5PW2EB/graph.json","events_json":"https://pith.science/api/pith-number/LN4UB6JFEFJXOR3GF6ZD5PW2EB/events.json","paper":"https://pith.science/paper/LN4UB6JF"},"agent_actions":{"view_html":"https://pith.science/pith/LN4UB6JFEFJXOR3GF6ZD5PW2EB","download_json":"https://pith.science/pith/LN4UB6JFEFJXOR3GF6ZD5PW2EB.json","view_paper":"https://pith.science/paper/LN4UB6JF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.8027&json=true","fetch_graph":"https://pith.science/api/pith-number/LN4UB6JFEFJXOR3GF6ZD5PW2EB/graph.json","fetch_events":"https://pith.science/api/pith-number/LN4UB6JFEFJXOR3GF6ZD5PW2EB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LN4UB6JFEFJXOR3GF6ZD5PW2EB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LN4UB6JFEFJXOR3GF6ZD5PW2EB/action/storage_attestation","attest_author":"https://pith.science/pith/LN4UB6JFEFJXOR3GF6ZD5PW2EB/action/author_attestation","sign_citation":"https://pith.science/pith/LN4UB6JFEFJXOR3GF6ZD5PW2EB/action/citation_signature","submit_replication":"https://pith.science/pith/LN4UB6JFEFJXOR3GF6ZD5PW2EB/action/replication_record"}},"created_at":"2026-05-18T02:32:38.853994+00:00","updated_at":"2026-05-18T02:32:38.853994+00:00"}