{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MNXMJGSLOYPWBM7SSNGIPOODTZ","short_pith_number":"pith:MNXMJGSL","canonical_record":{"source":{"id":"1809.07445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-20T01:49:54Z","cross_cats_sorted":[],"title_canon_sha256":"a1741b50ad694e00bcc9c9066bab65acc56416b8717e6cbb4620648c1c9d3588","abstract_canon_sha256":"2867e5b7ff104e0fbf633789e9fd6d1a3fe69cd260329179ce98943078ca01eb"},"schema_version":"1.0"},"canonical_sha256":"636ec49a4b761f60b3f2934c87b9c39e47ded9f1f390062974cf4197ca217551","source":{"kind":"arxiv","id":"1809.07445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07445","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07445v1","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07445","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"MNXMJGSLOYPW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MNXMJGSLOYPWBM7S","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MNXMJGSL","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MNXMJGSLOYPWBM7SSNGIPOODTZ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-20T01:49:54Z","cross_cats_sorted":[],"title_canon_sha256":"a1741b50ad694e00bcc9c9066bab65acc56416b8717e6cbb4620648c1c9d3588","abstract_canon_sha256":"2867e5b7ff104e0fbf633789e9fd6d1a3fe69cd260329179ce98943078ca01eb"},"schema_version":"1.0"},"canonical_sha256":"636ec49a4b761f60b3f2934c87b9c39e47ded9f1f390062974cf4197ca217551","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:16.297406Z","signature_b64":"gYOsSoua1i9y5OWmHcavcHf6Th48Uy3BWLN9CjFtI79j20NaQXDbkBNVtZaH7jtkoVMD8g69h80LVvDjQ3OgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"636ec49a4b761f60b3f2934c87b9c39e47ded9f1f390062974cf4197ca217551","last_reissued_at":"2026-05-18T00:05:16.296806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:16.296806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07445","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:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZaKFhc5GTONL7yhR0lSVfhiZfwPL3rnz3MdKR2Vu5/nunn7Oha3e6ZKioo1eqHkh59gV3NWhAn1hqaNMPjvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:38:15.788786Z"},"content_sha256":"3bb2ba78cdaed2ec517bc939f079a9b79d116e91857bfc51e0bf3ad7217ff9f9","schema_version":"1.0","event_id":"sha256:3bb2ba78cdaed2ec517bc939f079a9b79d116e91857bfc51e0bf3ad7217ff9f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MNXMJGSLOYPWBM7SSNGIPOODTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\\{5,6,7,8\\}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Martin Rolek, Runrun Liu, Sarah Loeb, Yuxue Yin","submitted_at":"2018-09-20T01:49:54Z","abstract_excerpt":"A generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvo\\v{r}\\'{a}k and Postle. Essentially, DP-coloring assigns an arbitrary matching between lists of colors at adjacent vertices, as opposed to only matching identical colors as is done for list-coloring. Several results on list-coloring of planar graphs have since been extended to the setting of DP-coloring. We note that list-coloring results do not always extend to DP-coloring results. Our main result in this paper is to prove that every planar graph without cycles of length $\\{4, a, b, 9\\}$ for $a, b \\in \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07445","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:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/fTzU3lKZtgBF6BjLrrXL+9v8KnYxxm+Yvi/2ffdGLlAWPYAU67DCeFALv6HRSSo9aPkbJ3DQGlA3Qpdx1gCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:38:15.789134Z"},"content_sha256":"3f8940de1d9db4b26c6eea1b04b0c3170b2141906c3ad5af6dce6b858326330e","schema_version":"1.0","event_id":"sha256:3f8940de1d9db4b26c6eea1b04b0c3170b2141906c3ad5af6dce6b858326330e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNXMJGSLOYPWBM7SSNGIPOODTZ/bundle.json","state_url":"https://pith.science/pith/MNXMJGSLOYPWBM7SSNGIPOODTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNXMJGSLOYPWBM7SSNGIPOODTZ/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-02T09:38:15Z","links":{"resolver":"https://pith.science/pith/MNXMJGSLOYPWBM7SSNGIPOODTZ","bundle":"https://pith.science/pith/MNXMJGSLOYPWBM7SSNGIPOODTZ/bundle.json","state":"https://pith.science/pith/MNXMJGSLOYPWBM7SSNGIPOODTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNXMJGSLOYPWBM7SSNGIPOODTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MNXMJGSLOYPWBM7SSNGIPOODTZ","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":"2867e5b7ff104e0fbf633789e9fd6d1a3fe69cd260329179ce98943078ca01eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-20T01:49:54Z","title_canon_sha256":"a1741b50ad694e00bcc9c9066bab65acc56416b8717e6cbb4620648c1c9d3588"},"schema_version":"1.0","source":{"id":"1809.07445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07445","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07445v1","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07445","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"MNXMJGSLOYPW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MNXMJGSLOYPWBM7S","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MNXMJGSL","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:3f8940de1d9db4b26c6eea1b04b0c3170b2141906c3ad5af6dce6b858326330e","target":"graph","created_at":"2026-05-18T00:05:16Z","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 generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvo\\v{r}\\'{a}k and Postle. Essentially, DP-coloring assigns an arbitrary matching between lists of colors at adjacent vertices, as opposed to only matching identical colors as is done for list-coloring. Several results on list-coloring of planar graphs have since been extended to the setting of DP-coloring. We note that list-coloring results do not always extend to DP-coloring results. Our main result in this paper is to prove that every planar graph without cycles of length $\\{4, a, b, 9\\}$ for $a, b \\in \\","authors_text":"Gexin Yu, Martin Rolek, Runrun Liu, Sarah Loeb, Yuxue Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-20T01:49:54Z","title":"DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\\{5,6,7,8\\}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07445","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:3bb2ba78cdaed2ec517bc939f079a9b79d116e91857bfc51e0bf3ad7217ff9f9","target":"record","created_at":"2026-05-18T00:05:16Z","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":"2867e5b7ff104e0fbf633789e9fd6d1a3fe69cd260329179ce98943078ca01eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-20T01:49:54Z","title_canon_sha256":"a1741b50ad694e00bcc9c9066bab65acc56416b8717e6cbb4620648c1c9d3588"},"schema_version":"1.0","source":{"id":"1809.07445","kind":"arxiv","version":1}},"canonical_sha256":"636ec49a4b761f60b3f2934c87b9c39e47ded9f1f390062974cf4197ca217551","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"636ec49a4b761f60b3f2934c87b9c39e47ded9f1f390062974cf4197ca217551","first_computed_at":"2026-05-18T00:05:16.296806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:16.296806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gYOsSoua1i9y5OWmHcavcHf6Th48Uy3BWLN9CjFtI79j20NaQXDbkBNVtZaH7jtkoVMD8g69h80LVvDjQ3OgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:16.297406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bb2ba78cdaed2ec517bc939f079a9b79d116e91857bfc51e0bf3ad7217ff9f9","sha256:3f8940de1d9db4b26c6eea1b04b0c3170b2141906c3ad5af6dce6b858326330e"],"state_sha256":"d18afed126bfbde6164f912a2d197ce5a397b32d355f0af08922e52f93488981"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yrmCpvnTAHTZ3LqhPSORdG0+5l3bGk46BMkGr0uz1bHUC2+KcrNkFVUzObxHcbUVVPzgHkPFfmN/3D693aIfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:38:15.791333Z","bundle_sha256":"e53ea89e49880b3303e21a4267d6d91f93330e8e33c738662f1c6fe3b51c62f2"}}