{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YFMLX5GDSWY5ZR2KSHQ27HQH4H","short_pith_number":"pith:YFMLX5GD","schema_version":"1.0","canonical_sha256":"c158bbf4c395b1dcc74a91e1af9e07e1d6a5ee963b3227d354d1f85ffd1a75af","source":{"kind":"arxiv","id":"1603.02841","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.02841","created_at":"2026-05-17T23:51:15.050955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02841v3","created_at":"2026-05-17T23:51:15.050955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02841","created_at":"2026-05-17T23:51:15.050955+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFMLX5GDSWY5","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFMLX5GDSWY5ZR2K","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFMLX5GD","created_at":"2026-05-18T12:30:53.716459+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/YFMLX5GDSWY5ZR2KSHQ27HQH4H","json":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H.json","graph_json":"https://pith.science/api/pith-number/YFMLX5GDSWY5ZR2KSHQ27HQH4H/graph.json","events_json":"https://pith.science/api/pith-number/YFMLX5GDSWY5ZR2KSHQ27HQH4H/events.json","paper":"https://pith.science/paper/YFMLX5GD"},"agent_actions":{"view_html":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H","download_json":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H.json","view_paper":"https://pith.science/paper/YFMLX5GD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02841&json=true","fetch_graph":"https://pith.science/api/pith-number/YFMLX5GDSWY5ZR2KSHQ27HQH4H/graph.json","fetch_events":"https://pith.science/api/pith-number/YFMLX5GDSWY5ZR2KSHQ27HQH4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/action/storage_attestation","attest_author":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/action/author_attestation","sign_citation":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/action/citation_signature","submit_replication":"https://pith.science/pith/YFMLX5GDSWY5ZR2KSHQ27HQH4H/action/replication_record"}},"created_at":"2026-05-17T23:51:15.050955+00:00","updated_at":"2026-05-17T23:51:15.050955+00:00"}