{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FCIPMSG6FLGT3SNCTH5TAA5KTT","short_pith_number":"pith:FCIPMSG6","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"},"canonical_sha256":"2890f648de2acd3dc9a299fb3003aa9cd68899b19727703df6247cd954a3820d","source":{"kind":"arxiv","id":"1211.3981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3981","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3981v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3981","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"FCIPMSG6FLGT","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FCIPMSG6FLGT3SNC","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FCIPMSG6","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FCIPMSG6FLGT3SNCTH5TAA5KTT","target":"record","payload":{"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"},"canonical_sha256":"2890f648de2acd3dc9a299fb3003aa9cd68899b19727703df6247cd954a3820d","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"},"source_kind":"arxiv","source_id":"1211.3981","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-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VsksskWrcr/LAISBvo0JvCffjXzc52v85A/weCV0w3KYBZTpnERIgxIJJfAM5NcXP826V/GphSQn4hZ1GDOTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:15:44.854330Z"},"content_sha256":"2b819d3c170d720260121f9512c55e82019eb357c390dbbfd9e1bf0f9630f15d","schema_version":"1.0","event_id":"sha256:2b819d3c170d720260121f9512c55e82019eb357c390dbbfd9e1bf0f9630f15d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FCIPMSG6FLGT3SNCTH5TAA5KTT","target":"graph","payload":{"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"},"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-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NrKVwGCV9G4l4FwnCoRZQtdvxF1mbA3d5c5KlHwjhP3w6kmRNlxpF3JL1EnHnvowvnr1ZWARYPh6IULBw+1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:15:44.854683Z"},"content_sha256":"6f165d0c3e96f1fade3daa52906673cf0d7d33c607386a2b6a391496841d5940","schema_version":"1.0","event_id":"sha256:6f165d0c3e96f1fade3daa52906673cf0d7d33c607386a2b6a391496841d5940"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/bundle.json","state_url":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/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-28T02:15:44Z","links":{"resolver":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT","bundle":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/bundle.json","state":"https://pith.science/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCIPMSG6FLGT3SNCTH5TAA5KTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FCIPMSG6FLGT3SNCTH5TAA5KTT","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":"1adcfb9f6f7c7b99805c915d320b6da5bae78212d0fdc317cd1034db4a6b4712","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-16T18:19:43Z","title_canon_sha256":"e1ada59021363000676a5bb0023d50f4b8e10daa55d049376575aeee1875b790"},"schema_version":"1.0","source":{"id":"1211.3981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3981","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3981v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3981","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"FCIPMSG6FLGT","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FCIPMSG6FLGT3SNC","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FCIPMSG6","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:6f165d0c3e96f1fade3daa52906673cf0d7d33c607386a2b6a391496841d5940","target":"graph","created_at":"2026-05-18T00:54:58Z","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":"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.","authors_text":"Alexandr V. Kostochka, Bernard Lidick\\'y, Matthew Yancey, Oleg V. Borodin","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-16T18:19:43Z","title":"Short proofs of coloring theorems on planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3981","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:2b819d3c170d720260121f9512c55e82019eb357c390dbbfd9e1bf0f9630f15d","target":"record","created_at":"2026-05-18T00:54:58Z","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":"1adcfb9f6f7c7b99805c915d320b6da5bae78212d0fdc317cd1034db4a6b4712","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-16T18:19:43Z","title_canon_sha256":"e1ada59021363000676a5bb0023d50f4b8e10daa55d049376575aeee1875b790"},"schema_version":"1.0","source":{"id":"1211.3981","kind":"arxiv","version":1}},"canonical_sha256":"2890f648de2acd3dc9a299fb3003aa9cd68899b19727703df6247cd954a3820d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2890f648de2acd3dc9a299fb3003aa9cd68899b19727703df6247cd954a3820d","first_computed_at":"2026-05-18T00:54:58.457235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.457235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2UisXG1SA0CephqVeCdtELWpJ1odj67eNKaa3BGswheM5hYfZuBJywz7Dr4tpli07SS5gU27Xr28VfUKbx1JCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.457694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b819d3c170d720260121f9512c55e82019eb357c390dbbfd9e1bf0f9630f15d","sha256:6f165d0c3e96f1fade3daa52906673cf0d7d33c607386a2b6a391496841d5940"],"state_sha256":"835f2c6b233d24cf1c8eab80e1da708f198a624414aabf4ed3cdda0cfac900c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGIDiUmz+nkfJbR0btbnv3k7zTRczNfj6CcVGhLQlozaKr4ObmYMXbS8xuLkDKcPSmcjlTsLAl/CLBekCwCeCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:15:44.856813Z","bundle_sha256":"2d6f4caf72486ee68a8673ecdfdbb94133471fbfefee96ffeae11cb92b6afc00"}}