{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YFMLX5GDSWY5ZR2KSHQ27HQH4H","short_pith_number":"pith:YFMLX5GD","canonical_record":{"source":{"id":"1603.02841","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-09T10:58:00Z","cross_cats_sorted":[],"title_canon_sha256":"552eed1ba1b7732c538f73625be4f399e27b5c0e061cc66bdf9ec9e7b93dec60","abstract_canon_sha256":"11116bdba41787e6967997c2326cbe94f769141edf59d02c65c57e2ede522856"},"schema_version":"1.0"},"canonical_sha256":"c158bbf4c395b1dcc74a91e1af9e07e1d6a5ee963b3227d354d1f85ffd1a75af","source":{"kind":"arxiv","id":"1603.02841","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02841","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02841v3","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02841","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"YFMLX5GDSWY5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YFMLX5GDSWY5ZR2K","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YFMLX5GD","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YFMLX5GDSWY5ZR2KSHQ27HQH4H","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02841","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-09T10:58:00Z","cross_cats_sorted":[],"title_canon_sha256":"552eed1ba1b7732c538f73625be4f399e27b5c0e061cc66bdf9ec9e7b93dec60","abstract_canon_sha256":"11116bdba41787e6967997c2326cbe94f769141edf59d02c65c57e2ede522856"},"schema_version":"1.0"},"canonical_sha256":"c158bbf4c395b1dcc74a91e1af9e07e1d6a5ee963b3227d354d1f85ffd1a75af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:15.051477Z","signature_b64":"4kNYYA3p8oGHPRo8OXoe0i0ngJOfUqSzcGgWXYgrC3MWvBbItNCC3f3KKfevW0mZDvyaF8js0+iAzySqK+d8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c158bbf4c395b1dcc74a91e1af9e07e1d6a5ee963b3227d354d1f85ffd1a75af","last_reissued_at":"2026-05-17T23:51:15.050695Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:15.050695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02841","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-17T23:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PeiQ8Ao3jENc7LR6XcsP8Npe1+jA3D64KfO6XwG2Tz9uRG318zT8iDLInbXphfSlE7dQg9QSBhrkYwwhPMNwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:42:52.604010Z"},"content_sha256":"e92f931f0c3aa7c5681a72fa412854264fb399881335ed20d87d62fed15612e4","schema_version":"1.0","event_id":"sha256:e92f931f0c3aa7c5681a72fa412854264fb399881335ed20d87d62fed15612e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YFMLX5GDSWY5ZR2KSHQ27HQH4H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improper coloring of graphs on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilkyoo Choi, Louis Esperet","submitted_at":"2016-03-09T10:58:00Z","abstract_excerpt":"A graph $G$ is $(d_1,\\ldots,d_k)$-colorable if its vertex set can be partitioned into $k$ sets $V_1,\\ldots,V_k$, such that for each $i\\in\\{1, \\ldots, k\\}$, the subgraph of $G$ induced by $V_i$ has maximum degree at most $d_i$. The Four Color Theorem states that every planar graph is $(0,0,0,0)$-colorable, and a classical result of Cowen, Cowen, and Woodall shows that every planar graph is $(2,2,2)$-colorable. In this paper, we extend both of these results to graphs on surfaces. Namely, we show that every graph embeddable on a surface of Euler genus $g>0$ is $(0,0,0,9g-4)$-colorable and $(2,2,9"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02841","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-17T23:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YcrvZcb0PkwHhbIGhvK9lBcBNlEejQfbk82jUDn6OscTNFvVz2UmjeFTZ8KF5XpbcLsJh1K2QA/873/QYGvNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:42:52.604666Z"},"content_sha256":"6d16c1bd51d9a69e1516396dcb22ca7226b94cee27f83521e82b13b8a5a9be4a","schema_version":"1.0","event_id":"sha256:6d16c1bd51d9a69e1516396dcb22ca7226b94cee27f83521e82b13b8a5a9be4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/bundle.json","state_url":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/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-11T17:42:52Z","links":{"resolver":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H","bundle":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/bundle.json","state":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YFMLX5GDSWY5ZR2KSHQ27HQH4H","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":"11116bdba41787e6967997c2326cbe94f769141edf59d02c65c57e2ede522856","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-09T10:58:00Z","title_canon_sha256":"552eed1ba1b7732c538f73625be4f399e27b5c0e061cc66bdf9ec9e7b93dec60"},"schema_version":"1.0","source":{"id":"1603.02841","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02841","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02841v3","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02841","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"YFMLX5GDSWY5","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YFMLX5GDSWY5ZR2K","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YFMLX5GD","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:6d16c1bd51d9a69e1516396dcb22ca7226b94cee27f83521e82b13b8a5a9be4a","target":"graph","created_at":"2026-05-17T23:51:15Z","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 graph $G$ is $(d_1,\\ldots,d_k)$-colorable if its vertex set can be partitioned into $k$ sets $V_1,\\ldots,V_k$, such that for each $i\\in\\{1, \\ldots, k\\}$, the subgraph of $G$ induced by $V_i$ has maximum degree at most $d_i$. The Four Color Theorem states that every planar graph is $(0,0,0,0)$-colorable, and a classical result of Cowen, Cowen, and Woodall shows that every planar graph is $(2,2,2)$-colorable. In this paper, we extend both of these results to graphs on surfaces. Namely, we show that every graph embeddable on a surface of Euler genus $g>0$ is $(0,0,0,9g-4)$-colorable and $(2,2,9","authors_text":"Ilkyoo Choi, Louis Esperet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-09T10:58:00Z","title":"Improper coloring of graphs on surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02841","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:e92f931f0c3aa7c5681a72fa412854264fb399881335ed20d87d62fed15612e4","target":"record","created_at":"2026-05-17T23:51:15Z","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":"11116bdba41787e6967997c2326cbe94f769141edf59d02c65c57e2ede522856","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-09T10:58:00Z","title_canon_sha256":"552eed1ba1b7732c538f73625be4f399e27b5c0e061cc66bdf9ec9e7b93dec60"},"schema_version":"1.0","source":{"id":"1603.02841","kind":"arxiv","version":3}},"canonical_sha256":"c158bbf4c395b1dcc74a91e1af9e07e1d6a5ee963b3227d354d1f85ffd1a75af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c158bbf4c395b1dcc74a91e1af9e07e1d6a5ee963b3227d354d1f85ffd1a75af","first_computed_at":"2026-05-17T23:51:15.050695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:15.050695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4kNYYA3p8oGHPRo8OXoe0i0ngJOfUqSzcGgWXYgrC3MWvBbItNCC3f3KKfevW0mZDvyaF8js0+iAzySqK+d8CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:15.051477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02841","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e92f931f0c3aa7c5681a72fa412854264fb399881335ed20d87d62fed15612e4","sha256:6d16c1bd51d9a69e1516396dcb22ca7226b94cee27f83521e82b13b8a5a9be4a"],"state_sha256":"c8e2be600d072a171cdde5b7a5b2c5ccd0dfb862e140cdf45bf59ce740473bb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uLCSv3WJrUujV9u61rw0l+rga8aG5nPfLyWep7tX7rpxLEVoAPnKq07TsQrHnnij9M2IVZx5jYR04fc//pJ8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:42:52.608352Z","bundle_sha256":"c917a4979c0ab086bd8ac07e0f4b7580b73ce1f4b87a789f2e0dc395a3a4ab9f"}}