{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FGY7XXEJTBVMNJCFYOVPZ4OPDO","short_pith_number":"pith:FGY7XXEJ","schema_version":"1.0","canonical_sha256":"29b1fbdc89986ac6a445c3aafcf1cf1ba7c0a1e4e368cf8dc4239c03b76cb116","source":{"kind":"arxiv","id":"1811.02920","version":1},"attestation_state":"computed","paper":{"title":"DP-4-colorability of two classes of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Lily Chen, Ren Zhao, Runrun Liu, Xiangqian Zhou","submitted_at":"2018-11-07T15:04:19Z","abstract_excerpt":"DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvo\\v{r}\\'ak and Postle (2017). In this paper, we prove that every planar graph $G$ without $4$-cycles adjacent to $k$-cycles is DP-$4$-colorable for $k=5$ and $6$. As a consequence, we obtain two new classes of $4$-choosable planar graphs. We use identification of verticec in the proof, and actually prove stronger statements that every pre-coloring of some short cycles can be extended to the whole graph."},"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":"1811.02920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T15:04:19Z","cross_cats_sorted":[],"title_canon_sha256":"d78f3754185bea5e9d45e2a33d8f27e03916620aba71dc96fd6ee63d3d71e801","abstract_canon_sha256":"5c6da9739ad798aa285bb2fd8519a24d7c37ce828badef1196c8f6ae0d18fed8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.417413Z","signature_b64":"OJo1V4xNxgMVevY5XIlu26kUz7MNJdOQcR2D+D2pU9qAuTc7xdldi4D1QeEhbAw2+sAbuXqtrZBMY/i/z+EkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b1fbdc89986ac6a445c3aafcf1cf1ba7c0a1e4e368cf8dc4239c03b76cb116","last_reissued_at":"2026-05-18T00:01:20.416834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.416834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DP-4-colorability of two classes of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Lily Chen, Ren Zhao, Runrun Liu, Xiangqian Zhou","submitted_at":"2018-11-07T15:04:19Z","abstract_excerpt":"DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvo\\v{r}\\'ak and Postle (2017). In this paper, we prove that every planar graph $G$ without $4$-cycles adjacent to $k$-cycles is DP-$4$-colorable for $k=5$ and $6$. As a consequence, we obtain two new classes of $4$-choosable planar graphs. We use identification of verticec in the proof, and actually prove stronger statements that every pre-coloring of some short cycles can be extended to the whole graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02920","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.02920","created_at":"2026-05-18T00:01:20.416910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02920v1","created_at":"2026-05-18T00:01:20.416910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02920","created_at":"2026-05-18T00:01:20.416910+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGY7XXEJTBVM","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGY7XXEJTBVMNJCF","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGY7XXEJ","created_at":"2026-05-18T12:32:22.470017+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/FGY7XXEJTBVMNJCFYOVPZ4OPDO","json":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO.json","graph_json":"https://pith.science/api/pith-number/FGY7XXEJTBVMNJCFYOVPZ4OPDO/graph.json","events_json":"https://pith.science/api/pith-number/FGY7XXEJTBVMNJCFYOVPZ4OPDO/events.json","paper":"https://pith.science/paper/FGY7XXEJ"},"agent_actions":{"view_html":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO","download_json":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO.json","view_paper":"https://pith.science/paper/FGY7XXEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02920&json=true","fetch_graph":"https://pith.science/api/pith-number/FGY7XXEJTBVMNJCFYOVPZ4OPDO/graph.json","fetch_events":"https://pith.science/api/pith-number/FGY7XXEJTBVMNJCFYOVPZ4OPDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/action/storage_attestation","attest_author":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/action/author_attestation","sign_citation":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/action/citation_signature","submit_replication":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/action/replication_record"}},"created_at":"2026-05-18T00:01:20.416910+00:00","updated_at":"2026-05-18T00:01:20.416910+00:00"}