{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4M4QHOO7CQRZ7DFI3V24BYB6FN","short_pith_number":"pith:4M4QHOO7","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"},"canonical_sha256":"e33903b9df14239f8ca8dd75c0e03e2b4e05b4d40ec439b3bdee5b8dd5087464","source":{"kind":"arxiv","id":"1302.5121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5121","created_at":"2026-05-18T03:32:59Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5121v1","created_at":"2026-05-18T03:32:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5121","created_at":"2026-05-18T03:32:59Z"},{"alias_kind":"pith_short_12","alias_value":"4M4QHOO7CQRZ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4M4QHOO7CQRZ7DFI","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4M4QHOO7","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4M4QHOO7CQRZ7DFI3V24BYB6FN","target":"record","payload":{"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"},"canonical_sha256":"e33903b9df14239f8ca8dd75c0e03e2b4e05b4d40ec439b3bdee5b8dd5087464","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"},"source_kind":"arxiv","source_id":"1302.5121","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:32:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1TiZC7xc6jE+TVUN0x0KKSxWzkf88wpC1c5B+vbZfu+H2yGENePkUDM/BkwsXciqJ26lJvzpKlATE0vF90uuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:50:17.571686Z"},"content_sha256":"64301ee43214d6f405979d994ac32826bb502db5548bbc4ac3627e545c2ecf9d","schema_version":"1.0","event_id":"sha256:64301ee43214d6f405979d994ac32826bb502db5548bbc4ac3627e545c2ecf9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4M4QHOO7CQRZ7DFI3V24BYB6FN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:32:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtqh9Vikd6sVFa9lwiksprBV+sgO3p6v+iwma7BQRKbHP2IAkach+RGuconw7QmLeoePVFZfPbfV84RVmCcfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:50:17.572424Z"},"content_sha256":"a59729ca5c2ba5089557dea0dba8e6977c8cdb9c3f87b44acf10db683805053a","schema_version":"1.0","event_id":"sha256:a59729ca5c2ba5089557dea0dba8e6977c8cdb9c3f87b44acf10db683805053a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/bundle.json","state_url":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T21:50:17Z","links":{"resolver":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN","bundle":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/bundle.json","state":"https://pith.science/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4M4QHOO7CQRZ7DFI3V24BYB6FN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4M4QHOO7CQRZ7DFI3V24BYB6FN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1dae853db521bf9b95aef65bf755c9b3b73e491e530c1c19c855256927a9c783","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-20T21:13:06Z","title_canon_sha256":"49a2a84fe71c29709b88ad542671504397ad9306319fadcd5f0f2eabad1f5bff"},"schema_version":"1.0","source":{"id":"1302.5121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5121","created_at":"2026-05-18T03:32:59Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5121v1","created_at":"2026-05-18T03:32:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5121","created_at":"2026-05-18T03:32:59Z"},{"alias_kind":"pith_short_12","alias_value":"4M4QHOO7CQRZ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4M4QHOO7CQRZ7DFI","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4M4QHOO7","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:a59729ca5c2ba5089557dea0dba8e6977c8cdb9c3f87b44acf10db683805053a","target":"graph","created_at":"2026-05-18T03:32:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ken-ichi Kawarabayashi, Robin Thomas, Zdenek Dvorak","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-20T21:13:06Z","title":"Three-coloring triangle-free planar graphs in linear time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5121","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:64301ee43214d6f405979d994ac32826bb502db5548bbc4ac3627e545c2ecf9d","target":"record","created_at":"2026-05-18T03:32:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1dae853db521bf9b95aef65bf755c9b3b73e491e530c1c19c855256927a9c783","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-20T21:13:06Z","title_canon_sha256":"49a2a84fe71c29709b88ad542671504397ad9306319fadcd5f0f2eabad1f5bff"},"schema_version":"1.0","source":{"id":"1302.5121","kind":"arxiv","version":1}},"canonical_sha256":"e33903b9df14239f8ca8dd75c0e03e2b4e05b4d40ec439b3bdee5b8dd5087464","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e33903b9df14239f8ca8dd75c0e03e2b4e05b4d40ec439b3bdee5b8dd5087464","first_computed_at":"2026-05-18T03:32:59.633822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:59.633822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6FozKIf+R6HJnen+o9LGaB0NQZqWrpxH4U69IwysCeNZ/Lplu5UzVsisEDZfHW/OGfZlHFEz4Y3NQ36f4LF7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:59.634555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64301ee43214d6f405979d994ac32826bb502db5548bbc4ac3627e545c2ecf9d","sha256:a59729ca5c2ba5089557dea0dba8e6977c8cdb9c3f87b44acf10db683805053a"],"state_sha256":"95e0dad709871f1e15f6371da9611a9d6684a1f12e9c9f3651aa6d4e7068e906"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1SRx9w555unSfpkhcJ8zkEgmpUuJSlJOens1aCQhYu2+/gY/YgWbUjenHAmrXcPvXLuwvIrr0F/fDJXq7h3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:50:17.576432Z","bundle_sha256":"7703c001bef04f43b5888373c170bd9d7ad290fef58613d3b37590cacc369a24"}}