{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LKSY6FD76K5BNRRY4AMFZUC6NX","short_pith_number":"pith:LKSY6FD7","canonical_record":{"source":{"id":"1809.00925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-04T12:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"effc3c9c79f5de111e1c9dbf237797a759471b470405f80f5cd41babbb69cf30","abstract_canon_sha256":"656a801cfbfbb27c998e5e90c0540761e6c4b97729101ba89e8edce7e54dfe54"},"schema_version":"1.0"},"canonical_sha256":"5aa58f147ff2ba16c638e0185cd05e6dc97dd77a6971d881eacde19079ab6918","source":{"kind":"arxiv","id":"1809.00925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00925","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00925v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00925","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"LKSY6FD76K5B","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LKSY6FD76K5BNRRY","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LKSY6FD7","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LKSY6FD76K5BNRRY4AMFZUC6NX","target":"record","payload":{"canonical_record":{"source":{"id":"1809.00925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-04T12:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"effc3c9c79f5de111e1c9dbf237797a759471b470405f80f5cd41babbb69cf30","abstract_canon_sha256":"656a801cfbfbb27c998e5e90c0540761e6c4b97729101ba89e8edce7e54dfe54"},"schema_version":"1.0"},"canonical_sha256":"5aa58f147ff2ba16c638e0185cd05e6dc97dd77a6971d881eacde19079ab6918","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:32.134424Z","signature_b64":"YvXocgIeaohMfhv7w4F92BGD1Zk7lhcBkv3rAy1/HNYPhtAqgh0oNxafyehLaqPFN0MD1fayxDBWQaBpHBtcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa58f147ff2ba16c638e0185cd05e6dc97dd77a6971d881eacde19079ab6918","last_reissued_at":"2026-05-18T00:06:32.133900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:32.133900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.00925","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:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2heMlyaKy0zZ/zMIR6utx/uU2nboRlNIa64bv0IlGL3inSxMXVLPeJ+Tje51z7O78C/BO/9oPX56U1jD8keDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:48:36.225287Z"},"content_sha256":"88bcc616db7023564e60954bf23ef994bc965ff58947181949b37d347f43c605","schema_version":"1.0","event_id":"sha256:88bcc616db7023564e60954bf23ef994bc965ff58947181949b37d347f43c605"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LKSY6FD76K5BNRRY4AMFZUC6NX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Yuxue Yin","submitted_at":"2018-09-04T12:53:32Z","abstract_excerpt":"Montassier, Raspaud, and Wang (2006) asked to find the smallest positive integers $d_0$ and $d_1$ such that planar graphs without $\\{4,5\\}$-cycles and $d^{\\Delta}\\ge d_0$ are $3$-choosable and planar graphs without $\\{4,5,6\\}$-cycles and $d^{\\Delta}\\ge d_1$ are $3$-choosable, where $d^{\\Delta}$ is the smallest distance between triangles. They showed that $2\\le d_0\\le 4$ and $d_1\\le 3$. In this paper, we show that the following planar graphs are DP-3-colorable: (1) planar graphs without $\\{4,5\\}$-cycles and $d^{\\Delta}\\ge 3$ are DP-$3$-colorable, and (2) planar graphs without $\\{4,5,6\\}$-cycles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00925","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:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gb/vq/bH1onuH5oWCm9EK/WPAhlclON0jfP0HQnC7RokEW+/x+OdroQRuMM5aNo09IFwZ7h2JaR4g5cT88ztAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:48:36.225653Z"},"content_sha256":"b1dd2ab5f72745b7173a8fb24894bf762a94ea5e65231557e9b3fc1dfb3953d9","schema_version":"1.0","event_id":"sha256:b1dd2ab5f72745b7173a8fb24894bf762a94ea5e65231557e9b3fc1dfb3953d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKSY6FD76K5BNRRY4AMFZUC6NX/bundle.json","state_url":"https://pith.science/pith/LKSY6FD76K5BNRRY4AMFZUC6NX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKSY6FD76K5BNRRY4AMFZUC6NX/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-02T05:48:36Z","links":{"resolver":"https://pith.science/pith/LKSY6FD76K5BNRRY4AMFZUC6NX","bundle":"https://pith.science/pith/LKSY6FD76K5BNRRY4AMFZUC6NX/bundle.json","state":"https://pith.science/pith/LKSY6FD76K5BNRRY4AMFZUC6NX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKSY6FD76K5BNRRY4AMFZUC6NX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LKSY6FD76K5BNRRY4AMFZUC6NX","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":"656a801cfbfbb27c998e5e90c0540761e6c4b97729101ba89e8edce7e54dfe54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-04T12:53:32Z","title_canon_sha256":"effc3c9c79f5de111e1c9dbf237797a759471b470405f80f5cd41babbb69cf30"},"schema_version":"1.0","source":{"id":"1809.00925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00925","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00925v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00925","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"LKSY6FD76K5B","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LKSY6FD76K5BNRRY","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LKSY6FD7","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:b1dd2ab5f72745b7173a8fb24894bf762a94ea5e65231557e9b3fc1dfb3953d9","target":"graph","created_at":"2026-05-18T00:06:32Z","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":"Montassier, Raspaud, and Wang (2006) asked to find the smallest positive integers $d_0$ and $d_1$ such that planar graphs without $\\{4,5\\}$-cycles and $d^{\\Delta}\\ge d_0$ are $3$-choosable and planar graphs without $\\{4,5,6\\}$-cycles and $d^{\\Delta}\\ge d_1$ are $3$-choosable, where $d^{\\Delta}$ is the smallest distance between triangles. They showed that $2\\le d_0\\le 4$ and $d_1\\le 3$. In this paper, we show that the following planar graphs are DP-3-colorable: (1) planar graphs without $\\{4,5\\}$-cycles and $d^{\\Delta}\\ge 3$ are DP-$3$-colorable, and (2) planar graphs without $\\{4,5,6\\}$-cycles","authors_text":"Gexin Yu, Yuxue Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-04T12:53:32Z","title":"Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00925","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:88bcc616db7023564e60954bf23ef994bc965ff58947181949b37d347f43c605","target":"record","created_at":"2026-05-18T00:06:32Z","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":"656a801cfbfbb27c998e5e90c0540761e6c4b97729101ba89e8edce7e54dfe54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-04T12:53:32Z","title_canon_sha256":"effc3c9c79f5de111e1c9dbf237797a759471b470405f80f5cd41babbb69cf30"},"schema_version":"1.0","source":{"id":"1809.00925","kind":"arxiv","version":1}},"canonical_sha256":"5aa58f147ff2ba16c638e0185cd05e6dc97dd77a6971d881eacde19079ab6918","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5aa58f147ff2ba16c638e0185cd05e6dc97dd77a6971d881eacde19079ab6918","first_computed_at":"2026-05-18T00:06:32.133900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:32.133900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YvXocgIeaohMfhv7w4F92BGD1Zk7lhcBkv3rAy1/HNYPhtAqgh0oNxafyehLaqPFN0MD1fayxDBWQaBpHBtcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:32.134424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88bcc616db7023564e60954bf23ef994bc965ff58947181949b37d347f43c605","sha256:b1dd2ab5f72745b7173a8fb24894bf762a94ea5e65231557e9b3fc1dfb3953d9"],"state_sha256":"89e04c9b742311bff2f2c0e823e0ce35a07086789b75cad853bbe16188002877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tRW0pRdIJgImDPymZ0SK7q6+iSgkIN/9KdRnJ6C12SwxL5ncNeMkyi1PuJpqHRTecAdfzxW5NDh4dWu0Jiy/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:48:36.227731Z","bundle_sha256":"5ab9998b99ab84901eee95b67868458c1a2a77451b3d9d0eacb171bf84429eca"}}