{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YZQQIKQDJATPV2J2UU3322LU7I","short_pith_number":"pith:YZQQIKQD","schema_version":"1.0","canonical_sha256":"c661042a034826fae93aa537bd6974fa1bbfa2202fbe26d038b2acfd259c93db","source":{"kind":"arxiv","id":"2201.12028","version":1},"attestation_state":"computed","paper":{"title":"Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huan Zhou, Xuding Zhu","submitted_at":"2022-01-28T10:29:48Z","abstract_excerpt":"The concept of DP-coloring of a graph is a generalization of list coloring introduced by Dvo\\v{r}\\'{a}k and Postle in 2015. Multiple DP-coloring of graphs, as a generalization of multiple list coloring, was first studied by Bernshteyn, Kostochka and Zhu in 2019. This paper proves that planar graphs without 3-cycles and normally adjacent 4-cycles are $(7m, 2m)$-DP-colorable for every integer $m$. As a consequence, the strong fractional choice number of any planar graph without 3-cycles and normally adjacent 4-cycles is at most $7/2$."},"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":"2201.12028","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-01-28T10:29:48Z","cross_cats_sorted":[],"title_canon_sha256":"a182f4405ff30c537969b753e4bac28a7777dce40a1faa81bebd9defabe9c64e","abstract_canon_sha256":"bbd8264aa8ffee6d9a2d9b7cfecfb7c06a57bcd5ec86bb41c12f993d5331742c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:19.564670Z","signature_b64":"yO18ccApHhb81KMhJZ6JclPqhGUdtZQ8rnh7tWCg2qFm+QFZJXC0kLvnH2i6sDF6EgIR3OUR1Yb9APRWTG7aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c661042a034826fae93aa537bd6974fa1bbfa2202fbe26d038b2acfd259c93db","last_reissued_at":"2026-07-05T03:52:19.564332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:19.564332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huan Zhou, Xuding Zhu","submitted_at":"2022-01-28T10:29:48Z","abstract_excerpt":"The concept of DP-coloring of a graph is a generalization of list coloring introduced by Dvo\\v{r}\\'{a}k and Postle in 2015. Multiple DP-coloring of graphs, as a generalization of multiple list coloring, was first studied by Bernshteyn, Kostochka and Zhu in 2019. This paper proves that planar graphs without 3-cycles and normally adjacent 4-cycles are $(7m, 2m)$-DP-colorable for every integer $m$. As a consequence, the strong fractional choice number of any planar graph without 3-cycles and normally adjacent 4-cycles is at most $7/2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12028","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.12028/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":"2201.12028","created_at":"2026-07-05T03:52:19.564388+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12028v1","created_at":"2026-07-05T03:52:19.564388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12028","created_at":"2026-07-05T03:52:19.564388+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZQQIKQDJATP","created_at":"2026-07-05T03:52:19.564388+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZQQIKQDJATPV2J2","created_at":"2026-07-05T03:52:19.564388+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZQQIKQD","created_at":"2026-07-05T03:52:19.564388+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/YZQQIKQDJATPV2J2UU3322LU7I","json":"https://pith.science/pith/YZQQIKQDJATPV2J2UU3322LU7I.json","graph_json":"https://pith.science/api/pith-number/YZQQIKQDJATPV2J2UU3322LU7I/graph.json","events_json":"https://pith.science/api/pith-number/YZQQIKQDJATPV2J2UU3322LU7I/events.json","paper":"https://pith.science/paper/YZQQIKQD"},"agent_actions":{"view_html":"https://pith.science/pith/YZQQIKQDJATPV2J2UU3322LU7I","download_json":"https://pith.science/pith/YZQQIKQDJATPV2J2UU3322LU7I.json","view_paper":"https://pith.science/paper/YZQQIKQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12028&json=true","fetch_graph":"https://pith.science/api/pith-number/YZQQIKQDJATPV2J2UU3322LU7I/graph.json","fetch_events":"https://pith.science/api/pith-number/YZQQIKQDJATPV2J2UU3322LU7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZQQIKQDJATPV2J2UU3322LU7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZQQIKQDJATPV2J2UU3322LU7I/action/storage_attestation","attest_author":"https://pith.science/pith/YZQQIKQDJATPV2J2UU3322LU7I/action/author_attestation","sign_citation":"https://pith.science/pith/YZQQIKQDJATPV2J2UU3322LU7I/action/citation_signature","submit_replication":"https://pith.science/pith/YZQQIKQDJATPV2J2UU3322LU7I/action/replication_record"}},"created_at":"2026-07-05T03:52:19.564388+00:00","updated_at":"2026-07-05T03:52:19.564388+00:00"}