{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FGY7XXEJTBVMNJCFYOVPZ4OPDO","short_pith_number":"pith:FGY7XXEJ","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"},"canonical_sha256":"29b1fbdc89986ac6a445c3aafcf1cf1ba7c0a1e4e368cf8dc4239c03b76cb116","source":{"kind":"arxiv","id":"1811.02920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02920","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02920v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02920","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"FGY7XXEJTBVM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FGY7XXEJTBVMNJCF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FGY7XXEJ","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FGY7XXEJTBVMNJCFYOVPZ4OPDO","target":"record","payload":{"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"},"canonical_sha256":"29b1fbdc89986ac6a445c3aafcf1cf1ba7c0a1e4e368cf8dc4239c03b76cb116","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"},"source_kind":"arxiv","source_id":"1811.02920","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:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLqcIEWG5clBUS+Z3Y2zoxwxW++2Yb2wYuF5y83PUW1NyEbOVo8scHZbaIDqN8TSxeDESNJYQ3kyPXmlGNDaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:16:31.988037Z"},"content_sha256":"e5fe42136dfd6ad72fa2122e0097356e18b0894bdaef0a135e2dc6450ad3fd10","schema_version":"1.0","event_id":"sha256:e5fe42136dfd6ad72fa2122e0097356e18b0894bdaef0a135e2dc6450ad3fd10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FGY7XXEJTBVMNJCFYOVPZ4OPDO","target":"graph","payload":{"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"},"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:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulx0MYlZdRxGYTP1OvocM6JBVXqQKTVeKuFjlb0PImpyJ4qPncTuEt7bVY48OyNK+BEt7eCQ9J3t+jwjtupUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:16:31.988386Z"},"content_sha256":"6b9201e87a6b2b3bd9b10e824eaf485dedf5aaba52a22b94529e3eef2aea2810","schema_version":"1.0","event_id":"sha256:6b9201e87a6b2b3bd9b10e824eaf485dedf5aaba52a22b94529e3eef2aea2810"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/bundle.json","state_url":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/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-02T07:16:31Z","links":{"resolver":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO","bundle":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/bundle.json","state":"https://pith.science/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGY7XXEJTBVMNJCFYOVPZ4OPDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FGY7XXEJTBVMNJCFYOVPZ4OPDO","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":"5c6da9739ad798aa285bb2fd8519a24d7c37ce828badef1196c8f6ae0d18fed8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T15:04:19Z","title_canon_sha256":"d78f3754185bea5e9d45e2a33d8f27e03916620aba71dc96fd6ee63d3d71e801"},"schema_version":"1.0","source":{"id":"1811.02920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02920","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02920v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02920","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"FGY7XXEJTBVM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FGY7XXEJTBVMNJCF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FGY7XXEJ","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:6b9201e87a6b2b3bd9b10e824eaf485dedf5aaba52a22b94529e3eef2aea2810","target":"graph","created_at":"2026-05-18T00:01:20Z","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":"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.","authors_text":"Gexin Yu, Lily Chen, Ren Zhao, Runrun Liu, Xiangqian Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T15:04:19Z","title":"DP-4-colorability of two classes of planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02920","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:e5fe42136dfd6ad72fa2122e0097356e18b0894bdaef0a135e2dc6450ad3fd10","target":"record","created_at":"2026-05-18T00:01:20Z","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":"5c6da9739ad798aa285bb2fd8519a24d7c37ce828badef1196c8f6ae0d18fed8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-07T15:04:19Z","title_canon_sha256":"d78f3754185bea5e9d45e2a33d8f27e03916620aba71dc96fd6ee63d3d71e801"},"schema_version":"1.0","source":{"id":"1811.02920","kind":"arxiv","version":1}},"canonical_sha256":"29b1fbdc89986ac6a445c3aafcf1cf1ba7c0a1e4e368cf8dc4239c03b76cb116","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29b1fbdc89986ac6a445c3aafcf1cf1ba7c0a1e4e368cf8dc4239c03b76cb116","first_computed_at":"2026-05-18T00:01:20.416834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:20.416834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OJo1V4xNxgMVevY5XIlu26kUz7MNJdOQcR2D+D2pU9qAuTc7xdldi4D1QeEhbAw2+sAbuXqtrZBMY/i/z+EkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:20.417413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5fe42136dfd6ad72fa2122e0097356e18b0894bdaef0a135e2dc6450ad3fd10","sha256:6b9201e87a6b2b3bd9b10e824eaf485dedf5aaba52a22b94529e3eef2aea2810"],"state_sha256":"c0d09bfbd16c30ef985abc526288d8ee102be621112d174db66d31a93a2c3c8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vj65FKfkqp9JQxqXjG0MM0kWYDh5xceA22/+O4dfpTw871pB3tLyef4BPcIOz/Y8X/Iq/3Ptps8bc/kpiEj/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:16:31.990219Z","bundle_sha256":"6c43f9295c7f0bb61cd917c6a12274db8c683058cb3577e2b7f1fb771d1684f4"}}