{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WEZ53CLOIZMYIYTID64GEP2LAT","short_pith_number":"pith:WEZ53CLO","schema_version":"1.0","canonical_sha256":"b133dd896e46598462681fb8623f4b04e3e89a2912d7a600e154931b54c5a8fb","source":{"kind":"arxiv","id":"1407.2487","version":1},"attestation_state":"computed","paper":{"title":"4-coloring $P_6$-free graphs with no induced 5-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Juraj Stacho, Maria Chudnovsky, Mingxian Zhong, Peter Maceli","submitted_at":"2014-07-09T14:10:47Z","abstract_excerpt":"We show that the 4-coloring problem can be solved in polynomial time for graphs with no induced 5-cycle $C_5$ and no induced 6-vertex path $P_6$."},"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":"1407.2487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-09T14:10:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"46ca8d67348a7fcc5ae6a92f6afdb9aa6f327d466484dce605a2003ee60a5441","abstract_canon_sha256":"4ef3c5ecad35ae633dc00dcda3c1f6c251210de199d9b519137a8ece85e1c129"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:01.451673Z","signature_b64":"gnh+aba92ZIXnxih6M0rTsdMSpAuGkvLbDHCj9ZNoD/GV8+LqNZxEdw+lAac7nLJyTVuMLA9UZAZYuvSnRPxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b133dd896e46598462681fb8623f4b04e3e89a2912d7a600e154931b54c5a8fb","last_reissued_at":"2026-05-18T02:48:01.451240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:01.451240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"4-coloring $P_6$-free graphs with no induced 5-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Juraj Stacho, Maria Chudnovsky, Mingxian Zhong, Peter Maceli","submitted_at":"2014-07-09T14:10:47Z","abstract_excerpt":"We show that the 4-coloring problem can be solved in polynomial time for graphs with no induced 5-cycle $C_5$ and no induced 6-vertex path $P_6$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2487","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":"1407.2487","created_at":"2026-05-18T02:48:01.451305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2487v1","created_at":"2026-05-18T02:48:01.451305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2487","created_at":"2026-05-18T02:48:01.451305+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEZ53CLOIZMY","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEZ53CLOIZMYIYTI","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEZ53CLO","created_at":"2026-05-18T12:28:54.890064+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/WEZ53CLOIZMYIYTID64GEP2LAT","json":"https://pith.science/pith/WEZ53CLOIZMYIYTID64GEP2LAT.json","graph_json":"https://pith.science/api/pith-number/WEZ53CLOIZMYIYTID64GEP2LAT/graph.json","events_json":"https://pith.science/api/pith-number/WEZ53CLOIZMYIYTID64GEP2LAT/events.json","paper":"https://pith.science/paper/WEZ53CLO"},"agent_actions":{"view_html":"https://pith.science/pith/WEZ53CLOIZMYIYTID64GEP2LAT","download_json":"https://pith.science/pith/WEZ53CLOIZMYIYTID64GEP2LAT.json","view_paper":"https://pith.science/paper/WEZ53CLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2487&json=true","fetch_graph":"https://pith.science/api/pith-number/WEZ53CLOIZMYIYTID64GEP2LAT/graph.json","fetch_events":"https://pith.science/api/pith-number/WEZ53CLOIZMYIYTID64GEP2LAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEZ53CLOIZMYIYTID64GEP2LAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEZ53CLOIZMYIYTID64GEP2LAT/action/storage_attestation","attest_author":"https://pith.science/pith/WEZ53CLOIZMYIYTID64GEP2LAT/action/author_attestation","sign_citation":"https://pith.science/pith/WEZ53CLOIZMYIYTID64GEP2LAT/action/citation_signature","submit_replication":"https://pith.science/pith/WEZ53CLOIZMYIYTID64GEP2LAT/action/replication_record"}},"created_at":"2026-05-18T02:48:01.451305+00:00","updated_at":"2026-05-18T02:48:01.451305+00:00"}