{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FCIPMSG6FLGT3SNCTH5TAA5KTT","short_pith_number":"pith:FCIPMSG6","schema_version":"1.0","canonical_sha256":"2890f648de2acd3dc9a299fb3003aa9cd68899b19727703df6247cd954a3820d","source":{"kind":"arxiv","id":"1211.3981","version":1},"attestation_state":"computed","paper":{"title":"Short proofs of coloring theorems on planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexandr V. Kostochka, Bernard Lidick\\'y, Matthew Yancey, Oleg V. Borodin","submitted_at":"2012-11-16T18:19:43Z","abstract_excerpt":"A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Gr\\\"otzsch Theorem that every planar triangle-free graph is 3-colorable. In this paper we use the same bound to give short proofs of other known theorems on 3-coloring of planar graphs, among whose is the Gr\\\"unbaum-Aksenov Theorem that every planar with at most three triangles is 3-colorable. We also prove the new result that every graph obtained from a triangle-free planar graph by adding a vertex of degree at most four is 3-colorable."},"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":"1211.3981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-16T18:19:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e1ada59021363000676a5bb0023d50f4b8e10daa55d049376575aeee1875b790","abstract_canon_sha256":"1adcfb9f6f7c7b99805c915d320b6da5bae78212d0fdc317cd1034db4a6b4712"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.457694Z","signature_b64":"2UisXG1SA0CephqVeCdtELWpJ1odj67eNKaa3BGswheM5hYfZuBJywz7Dr4tpli07SS5gU27Xr28VfUKbx1JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2890f648de2acd3dc9a299fb3003aa9cd68899b19727703df6247cd954a3820d","last_reissued_at":"2026-05-18T00:54:58.457235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.457235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short proofs of coloring theorems on planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexandr V. Kostochka, Bernard Lidick\\'y, Matthew Yancey, Oleg V. Borodin","submitted_at":"2012-11-16T18:19:43Z","abstract_excerpt":"A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Gr\\\"otzsch Theorem that every planar triangle-free graph is 3-colorable. In this paper we use the same bound to give short proofs of other known theorems on 3-coloring of planar graphs, among whose is the Gr\\\"unbaum-Aksenov Theorem that every planar with at most three triangles is 3-colorable. We also prove the new result that every graph obtained from a triangle-free planar graph by adding a vertex of degree at most four is 3-colorable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3981","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":"1211.3981","created_at":"2026-05-18T00:54:58.457309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3981v1","created_at":"2026-05-18T00:54:58.457309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3981","created_at":"2026-05-18T00:54:58.457309+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCIPMSG6FLGT","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCIPMSG6FLGT3SNC","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCIPMSG6","created_at":"2026-05-18T12:27:06.952714+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/FCIPMSG6FLGT3SNCTH5TAA5KTT","json":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT.json","graph_json":"https://pith.science/api/pith-number/FCIPMSG6FLGT3SNCTH5TAA5KTT/graph.json","events_json":"https://pith.science/api/pith-number/FCIPMSG6FLGT3SNCTH5TAA5KTT/events.json","paper":"https://pith.science/paper/FCIPMSG6"},"agent_actions":{"view_html":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT","download_json":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT.json","view_paper":"https://pith.science/paper/FCIPMSG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3981&json=true","fetch_graph":"https://pith.science/api/pith-number/FCIPMSG6FLGT3SNCTH5TAA5KTT/graph.json","fetch_events":"https://pith.science/api/pith-number/FCIPMSG6FLGT3SNCTH5TAA5KTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/action/storage_attestation","attest_author":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/action/author_attestation","sign_citation":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/action/citation_signature","submit_replication":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/action/replication_record"}},"created_at":"2026-05-18T00:54:58.457309+00:00","updated_at":"2026-05-18T00:54:58.457309+00:00"}