{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TEWWSVA7X3FXUIL4H7WUNFEQNV","short_pith_number":"pith:TEWWSVA7","schema_version":"1.0","canonical_sha256":"992d69541fbecb7a217c3fed4694906d726695d3fca8f5a745f47446c75c36a1","source":{"kind":"arxiv","id":"1209.1176","version":1},"attestation_state":"computed","paper":{"title":"Edge-colouring eight-regular planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Katherine Edwards, Maria Chudnovsky, Paul Seymour","submitted_at":"2012-09-06T04:41:40Z","abstract_excerpt":"It was conjectured by the third author in about 1973 that every $d$-regular planar graph (possibly with parallel edges) can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and its complement. For $d = 3$ this is the four-colour theorem, and the conjecture has been proved for all $d\\le 7$, by various authors. Here we prove it for $d = 8$."},"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":"1209.1176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-09-06T04:41:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"459b83b203824b0578d81b3a308e83a027a35db0ad797df0f5d1447384f52111","abstract_canon_sha256":"d67d8b83ca2ea5ccf4139e449a4df41ea0773c56c5c34793719bf35a3ee26fe0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:06.342652Z","signature_b64":"WsgieClMRaMhuefWpz7r1jmN/SBLvnne+KcXr7TlLiwORC7pYUhvCLChhG7zZO23RTmMqJ6lmKL8pj8Z8kcQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"992d69541fbecb7a217c3fed4694906d726695d3fca8f5a745f47446c75c36a1","last_reissued_at":"2026-05-18T03:46:06.340631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:06.340631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-colouring eight-regular planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Katherine Edwards, Maria Chudnovsky, Paul Seymour","submitted_at":"2012-09-06T04:41:40Z","abstract_excerpt":"It was conjectured by the third author in about 1973 that every $d$-regular planar graph (possibly with parallel edges) can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and its complement. For $d = 3$ this is the four-colour theorem, and the conjecture has been proved for all $d\\le 7$, by various authors. Here we prove it for $d = 8$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1176","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":"1209.1176","created_at":"2026-05-18T03:46:06.340746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.1176v1","created_at":"2026-05-18T03:46:06.340746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1176","created_at":"2026-05-18T03:46:06.340746+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEWWSVA7X3FX","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEWWSVA7X3FXUIL4","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEWWSVA7","created_at":"2026-05-18T12:27:23.164592+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/TEWWSVA7X3FXUIL4H7WUNFEQNV","json":"https://pith.science/pith/TEWWSVA7X3FXUIL4H7WUNFEQNV.json","graph_json":"https://pith.science/api/pith-number/TEWWSVA7X3FXUIL4H7WUNFEQNV/graph.json","events_json":"https://pith.science/api/pith-number/TEWWSVA7X3FXUIL4H7WUNFEQNV/events.json","paper":"https://pith.science/paper/TEWWSVA7"},"agent_actions":{"view_html":"https://pith.science/pith/TEWWSVA7X3FXUIL4H7WUNFEQNV","download_json":"https://pith.science/pith/TEWWSVA7X3FXUIL4H7WUNFEQNV.json","view_paper":"https://pith.science/paper/TEWWSVA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.1176&json=true","fetch_graph":"https://pith.science/api/pith-number/TEWWSVA7X3FXUIL4H7WUNFEQNV/graph.json","fetch_events":"https://pith.science/api/pith-number/TEWWSVA7X3FXUIL4H7WUNFEQNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEWWSVA7X3FXUIL4H7WUNFEQNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEWWSVA7X3FXUIL4H7WUNFEQNV/action/storage_attestation","attest_author":"https://pith.science/pith/TEWWSVA7X3FXUIL4H7WUNFEQNV/action/author_attestation","sign_citation":"https://pith.science/pith/TEWWSVA7X3FXUIL4H7WUNFEQNV/action/citation_signature","submit_replication":"https://pith.science/pith/TEWWSVA7X3FXUIL4H7WUNFEQNV/action/replication_record"}},"created_at":"2026-05-18T03:46:06.340746+00:00","updated_at":"2026-05-18T03:46:06.340746+00:00"}