{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Z7J6GUOBNRM7ZIROFQGY3UWXFZ","short_pith_number":"pith:Z7J6GUOB","canonical_record":{"source":{"id":"1303.2487","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-11T11:18:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fbc07f8be92509f649bec0652549a7cc7402b3fe888078a190600ac18616c8ac","abstract_canon_sha256":"b186fa6593c4c15f22b5c2e8cc8493bec9be569ba6675f9aff318377c1e294ab"},"schema_version":"1.0"},"canonical_sha256":"cfd3e351c16c59fca22e2c0d8dd2d72e6be169a9ec5e1115ddfa7f1ad1975f91","source":{"kind":"arxiv","id":"1303.2487","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2487","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2487v3","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2487","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"Z7J6GUOBNRM7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z7J6GUOBNRM7ZIRO","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z7J6GUOB","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Z7J6GUOBNRM7ZIROFQGY3UWXFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2487","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-11T11:18:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"fbc07f8be92509f649bec0652549a7cc7402b3fe888078a190600ac18616c8ac","abstract_canon_sha256":"b186fa6593c4c15f22b5c2e8cc8493bec9be569ba6675f9aff318377c1e294ab"},"schema_version":"1.0"},"canonical_sha256":"cfd3e351c16c59fca22e2c0d8dd2d72e6be169a9ec5e1115ddfa7f1ad1975f91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:31.850528Z","signature_b64":"AEkBBUSqQLGpsopu7rktu/mDRH637in5kcb7H0xpxT1TJxpqi6+1nHXUMxabK5Txg3NcuwSYsQQP7f8tN43CCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfd3e351c16c59fca22e2c0d8dd2d72e6be169a9ec5e1115ddfa7f1ad1975f91","last_reissued_at":"2026-05-18T02:49:31.850054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:31.850054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2487","source_version":3,"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-18T02:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJoELrD9gpBJ9kVPgK5JgbEiZcDpyq8GvRIhaXVV7RhkDoBJujUETDbdGm7aNRxSxiEzms27EAiW0UxwQc5MBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:37:33.547477Z"},"content_sha256":"dbd2a0924e2961ec8b9eb72b9ac5142421e0ed7d4f0665e099ff749b9a90e70e","schema_version":"1.0","event_id":"sha256:dbd2a0924e2961ec8b9eb72b9ac5142421e0ed7d4f0665e099ff749b9a90e70e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Z7J6GUOBNRM7ZIROFQGY3UWXFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring planar graphs with three colors and no large monochromatic components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gwena\\\"el Joret, Louis Esperet","submitted_at":"2013-03-11T11:18:11Z","abstract_excerpt":"We prove the existence of a function $f :\\mathbb{N} \\to \\mathbb{N}$ such that the vertices of every planar graph with maximum degree $\\Delta$ can be 3-colored in such a way that each monochromatic component has at most $f(\\Delta)$ vertices. This is best possible (the number of colors cannot be reduced and the dependence on the maximum degree cannot be avoided) and answers a question raised by Kleinberg, Motwani, Raghavan, and Venkatasubramanian in 1997. Our result extends to graphs of bounded genus."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2487","kind":"arxiv","version":3},"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-18T02:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8RoqcSe+6Zg2U2kxz8ZxzMJ6x9y4bePKfu20N4k/09Qp3IPCpfpIaaVDrbGPd5ziJjh7MKW09qPx7XL6TmlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:37:33.547827Z"},"content_sha256":"bde360e8b5d649636634a271073665765513a47e979a485499199554ca440b8f","schema_version":"1.0","event_id":"sha256:bde360e8b5d649636634a271073665765513a47e979a485499199554ca440b8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7J6GUOBNRM7ZIROFQGY3UWXFZ/bundle.json","state_url":"https://pith.science/pith/Z7J6GUOBNRM7ZIROFQGY3UWXFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7J6GUOBNRM7ZIROFQGY3UWXFZ/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-06-05T17:37:33Z","links":{"resolver":"https://pith.science/pith/Z7J6GUOBNRM7ZIROFQGY3UWXFZ","bundle":"https://pith.science/pith/Z7J6GUOBNRM7ZIROFQGY3UWXFZ/bundle.json","state":"https://pith.science/pith/Z7J6GUOBNRM7ZIROFQGY3UWXFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7J6GUOBNRM7ZIROFQGY3UWXFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Z7J6GUOBNRM7ZIROFQGY3UWXFZ","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":"b186fa6593c4c15f22b5c2e8cc8493bec9be569ba6675f9aff318377c1e294ab","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-11T11:18:11Z","title_canon_sha256":"fbc07f8be92509f649bec0652549a7cc7402b3fe888078a190600ac18616c8ac"},"schema_version":"1.0","source":{"id":"1303.2487","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2487","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2487v3","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2487","created_at":"2026-05-18T02:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"Z7J6GUOBNRM7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z7J6GUOBNRM7ZIRO","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z7J6GUOB","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:bde360e8b5d649636634a271073665765513a47e979a485499199554ca440b8f","target":"graph","created_at":"2026-05-18T02:49:31Z","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":"We prove the existence of a function $f :\\mathbb{N} \\to \\mathbb{N}$ such that the vertices of every planar graph with maximum degree $\\Delta$ can be 3-colored in such a way that each monochromatic component has at most $f(\\Delta)$ vertices. This is best possible (the number of colors cannot be reduced and the dependence on the maximum degree cannot be avoided) and answers a question raised by Kleinberg, Motwani, Raghavan, and Venkatasubramanian in 1997. Our result extends to graphs of bounded genus.","authors_text":"Gwena\\\"el Joret, Louis Esperet","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-11T11:18:11Z","title":"Coloring planar graphs with three colors and no large monochromatic components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2487","kind":"arxiv","version":3},"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:dbd2a0924e2961ec8b9eb72b9ac5142421e0ed7d4f0665e099ff749b9a90e70e","target":"record","created_at":"2026-05-18T02:49:31Z","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":"b186fa6593c4c15f22b5c2e8cc8493bec9be569ba6675f9aff318377c1e294ab","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-11T11:18:11Z","title_canon_sha256":"fbc07f8be92509f649bec0652549a7cc7402b3fe888078a190600ac18616c8ac"},"schema_version":"1.0","source":{"id":"1303.2487","kind":"arxiv","version":3}},"canonical_sha256":"cfd3e351c16c59fca22e2c0d8dd2d72e6be169a9ec5e1115ddfa7f1ad1975f91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfd3e351c16c59fca22e2c0d8dd2d72e6be169a9ec5e1115ddfa7f1ad1975f91","first_computed_at":"2026-05-18T02:49:31.850054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:31.850054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AEkBBUSqQLGpsopu7rktu/mDRH637in5kcb7H0xpxT1TJxpqi6+1nHXUMxabK5Txg3NcuwSYsQQP7f8tN43CCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:31.850528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2487","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbd2a0924e2961ec8b9eb72b9ac5142421e0ed7d4f0665e099ff749b9a90e70e","sha256:bde360e8b5d649636634a271073665765513a47e979a485499199554ca440b8f"],"state_sha256":"3b2508c05f13cef0085eda5c449754aa66abaa53bc2538c937facf872b72ed18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6GEIrE9jHYb3eZXRv3JQL6FfXxHPBh3rikXhXEYqrStXrzM8VT4nfxdKRb+Xs0xvzPsstaODQ1o2or3QPj4Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:37:33.549890Z","bundle_sha256":"d7a68e03b13d91bebcc8ddd71367c9a7bfca9986064817f6cd140f905650fa45"}}