{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BSZCKAAXZPK6GPTXIEYR3LJBXH","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":"e64bc38e5e6d1793fe62d70bab244d1fcce4b1445581a537d9a680fa739cf43a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T00:57:30Z","title_canon_sha256":"5c983aeb1e0f09d6f793b45eefa22870a9aaefaf88ad2265d894321abd353edc"},"schema_version":"1.0","source":{"id":"1908.04902","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04902","created_at":"2026-07-05T04:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04902v4","created_at":"2026-07-05T04:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04902","created_at":"2026-07-05T04:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"BSZCKAAXZPK6","created_at":"2026-07-05T04:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"BSZCKAAXZPK6GPTX","created_at":"2026-07-05T04:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"BSZCKAAX","created_at":"2026-07-05T04:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:7b2d6071e986b7880f7e48b040b09a28bd61bd023a3ebf69d29686744a043b4c","target":"graph","created_at":"2026-07-05T04:30:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.04902/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathscr{G}$ be the class of plane graphs without triangles normally adjacent to $8^{-}$-cycles, without $4$-cycles normally adjacent to $6^{-}$-cycles, and without normally adjacent $5$-cycles. In this paper, it is shown that every graph in $\\mathscr{G}$ is $3$-choosable. Instead of proving this result, we directly prove a stronger result in the form of ``weakly'' DP-$3$-coloring. The main theorem improves the results in [J. Combin. Theory Ser. B 129 (2018) 38--54; European J. Combin. 82 (2019) 102995]. Consequently, every planar graph without $4$-, $6$-, $8$-cycles is $3$-choosable, and","authors_text":"Fangyao Lu, Mengjiao Rao, Qianqian Wang, Tao Wang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T00:57:30Z","title":"Planar graphs without normally adjacent short cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04902","kind":"arxiv","version":4},"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:0bbec93b0d6a1c6ff9a3341e3b109dcfecd0f22317dafe70fc4aaad56d121452","target":"record","created_at":"2026-07-05T04:30:36Z","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":"e64bc38e5e6d1793fe62d70bab244d1fcce4b1445581a537d9a680fa739cf43a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T00:57:30Z","title_canon_sha256":"5c983aeb1e0f09d6f793b45eefa22870a9aaefaf88ad2265d894321abd353edc"},"schema_version":"1.0","source":{"id":"1908.04902","kind":"arxiv","version":4}},"canonical_sha256":"0cb2250017cbd5e33e7741311dad21b9d4cf9ea63c833ea03ba487fd79b1b920","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cb2250017cbd5e33e7741311dad21b9d4cf9ea63c833ea03ba487fd79b1b920","first_computed_at":"2026-07-05T04:30:36.173153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:30:36.173153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kAhXXGXaTzqnkUPfnyZNOzuN3RpZWuBwF8EM/mBPXa7NX7DFHnpM5oYBPEPIpxpXo6m8Xf0WOPf/xkvPoB/xDw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:30:36.173527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04902","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bbec93b0d6a1c6ff9a3341e3b109dcfecd0f22317dafe70fc4aaad56d121452","sha256:7b2d6071e986b7880f7e48b040b09a28bd61bd023a3ebf69d29686744a043b4c"],"state_sha256":"a657f7e3b591a8b9991b8e0bfc34f8c4a62befc13eb867154491c25fdad58068"}