{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4M4QHOO7CQRZ7DFI3V24BYB6FN","short_pith_number":"pith:4M4QHOO7","schema_version":"1.0","canonical_sha256":"e33903b9df14239f8ca8dd75c0e03e2b4e05b4d40ec439b3bdee5b8dd5087464","source":{"kind":"arxiv","id":"1302.5121","version":1},"attestation_state":"computed","paper":{"title":"Three-coloring triangle-free planar graphs in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Ken-ichi Kawarabayashi, Robin Thomas, Zdenek Dvorak","submitted_at":"2013-02-20T21:13:06Z","abstract_excerpt":"Grotzsch's theorem states that every triangle-free planar graph is 3-colorable. Several relatively simple proofs of this fact were provided by Thomassen and other authors. It is easy to convert these proofs into quadratic-time algorithms to find a 3-coloring, but it is not clear how to find such a coloring in linear time (Kowalik used a nontrivial data structure to construct an O(n log n) algorithm).\n  We design a linear-time algorithm to find a 3-coloring of a given triangle-free planar graph. The algorithm avoids using any complex data structures, which makes it easy to implement. As a by-pr"},"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":"1302.5121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-20T21:13:06Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"49a2a84fe71c29709b88ad542671504397ad9306319fadcd5f0f2eabad1f5bff","abstract_canon_sha256":"1dae853db521bf9b95aef65bf755c9b3b73e491e530c1c19c855256927a9c783"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:59.634555Z","signature_b64":"6FozKIf+R6HJnen+o9LGaB0NQZqWrpxH4U69IwysCeNZ/Lplu5UzVsisEDZfHW/OGfZlHFEz4Y3NQ36f4LF7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e33903b9df14239f8ca8dd75c0e03e2b4e05b4d40ec439b3bdee5b8dd5087464","last_reissued_at":"2026-05-18T03:32:59.633822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:59.633822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three-coloring triangle-free planar graphs in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Ken-ichi Kawarabayashi, Robin Thomas, Zdenek Dvorak","submitted_at":"2013-02-20T21:13:06Z","abstract_excerpt":"Grotzsch's theorem states that every triangle-free planar graph is 3-colorable. Several relatively simple proofs of this fact were provided by Thomassen and other authors. It is easy to convert these proofs into quadratic-time algorithms to find a 3-coloring, but it is not clear how to find such a coloring in linear time (Kowalik used a nontrivial data structure to construct an O(n log n) algorithm).\n  We design a linear-time algorithm to find a 3-coloring of a given triangle-free planar graph. The algorithm avoids using any complex data structures, which makes it easy to implement. As a by-pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5121","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":"1302.5121","created_at":"2026-05-18T03:32:59.633948+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5121v1","created_at":"2026-05-18T03:32:59.633948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5121","created_at":"2026-05-18T03:32:59.633948+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M4QHOO7CQRZ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M4QHOO7CQRZ7DFI","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M4QHOO7","created_at":"2026-05-18T12:27:34.582898+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/4M4QHOO7CQRZ7DFI3V24BYB6FN","json":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN.json","graph_json":"https://pith.science/api/pith-number/4M4QHOO7CQRZ7DFI3V24BYB6FN/graph.json","events_json":"https://pith.science/api/pith-number/4M4QHOO7CQRZ7DFI3V24BYB6FN/events.json","paper":"https://pith.science/paper/4M4QHOO7"},"agent_actions":{"view_html":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN","download_json":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN.json","view_paper":"https://pith.science/paper/4M4QHOO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5121&json=true","fetch_graph":"https://pith.science/api/pith-number/4M4QHOO7CQRZ7DFI3V24BYB6FN/graph.json","fetch_events":"https://pith.science/api/pith-number/4M4QHOO7CQRZ7DFI3V24BYB6FN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/action/storage_attestation","attest_author":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/action/author_attestation","sign_citation":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/action/citation_signature","submit_replication":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/action/replication_record"}},"created_at":"2026-05-18T03:32:59.633948+00:00","updated_at":"2026-05-18T03:32:59.633948+00:00"}