{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BSZCKAAXZPK6GPTXIEYR3LJBXH","short_pith_number":"pith:BSZCKAAX","schema_version":"1.0","canonical_sha256":"0cb2250017cbd5e33e7741311dad21b9d4cf9ea63c833ea03ba487fd79b1b920","source":{"kind":"arxiv","id":"1908.04902","version":4},"attestation_state":"computed","paper":{"title":"Planar graphs without normally adjacent short cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Fangyao Lu, Mengjiao Rao, Qianqian Wang, Tao Wang","submitted_at":"2019-08-14T00:57:30Z","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"},"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":"1908.04902","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T00:57:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5c983aeb1e0f09d6f793b45eefa22870a9aaefaf88ad2265d894321abd353edc","abstract_canon_sha256":"e64bc38e5e6d1793fe62d70bab244d1fcce4b1445581a537d9a680fa739cf43a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:36.173527Z","signature_b64":"kAhXXGXaTzqnkUPfnyZNOzuN3RpZWuBwF8EM/mBPXa7NX7DFHnpM5oYBPEPIpxpXo6m8Xf0WOPf/xkvPoB/xDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cb2250017cbd5e33e7741311dad21b9d4cf9ea63c833ea03ba487fd79b1b920","last_reissued_at":"2026-07-05T04:30:36.173153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:36.173153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar graphs without normally adjacent short cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Fangyao Lu, Mengjiao Rao, Qianqian Wang, Tao Wang","submitted_at":"2019-08-14T00:57:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04902","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04902/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.04902","created_at":"2026-07-05T04:30:36.173208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04902v4","created_at":"2026-07-05T04:30:36.173208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04902","created_at":"2026-07-05T04:30:36.173208+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSZCKAAXZPK6","created_at":"2026-07-05T04:30:36.173208+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSZCKAAXZPK6GPTX","created_at":"2026-07-05T04:30:36.173208+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSZCKAAX","created_at":"2026-07-05T04:30:36.173208+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/BSZCKAAXZPK6GPTXIEYR3LJBXH","json":"https://pith.science/pith/BSZCKAAXZPK6GPTXIEYR3LJBXH.json","graph_json":"https://pith.science/api/pith-number/BSZCKAAXZPK6GPTXIEYR3LJBXH/graph.json","events_json":"https://pith.science/api/pith-number/BSZCKAAXZPK6GPTXIEYR3LJBXH/events.json","paper":"https://pith.science/paper/BSZCKAAX"},"agent_actions":{"view_html":"https://pith.science/pith/BSZCKAAXZPK6GPTXIEYR3LJBXH","download_json":"https://pith.science/pith/BSZCKAAXZPK6GPTXIEYR3LJBXH.json","view_paper":"https://pith.science/paper/BSZCKAAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04902&json=true","fetch_graph":"https://pith.science/api/pith-number/BSZCKAAXZPK6GPTXIEYR3LJBXH/graph.json","fetch_events":"https://pith.science/api/pith-number/BSZCKAAXZPK6GPTXIEYR3LJBXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSZCKAAXZPK6GPTXIEYR3LJBXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSZCKAAXZPK6GPTXIEYR3LJBXH/action/storage_attestation","attest_author":"https://pith.science/pith/BSZCKAAXZPK6GPTXIEYR3LJBXH/action/author_attestation","sign_citation":"https://pith.science/pith/BSZCKAAXZPK6GPTXIEYR3LJBXH/action/citation_signature","submit_replication":"https://pith.science/pith/BSZCKAAXZPK6GPTXIEYR3LJBXH/action/replication_record"}},"created_at":"2026-07-05T04:30:36.173208+00:00","updated_at":"2026-07-05T04:30:36.173208+00:00"}