{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AEKSUGHG3Q5VUQSD7IHIESVKJO","short_pith_number":"pith:AEKSUGHG","schema_version":"1.0","canonical_sha256":"01152a18e6dc3b5a4243fa0e824aaa4baeb2f6b737e569b167647c5901bcd616","source":{"kind":"arxiv","id":"1909.08511","version":2},"attestation_state":"computed","paper":{"title":"DP-4-coloring of planar graphs with some restrictions on cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Rui Li, Tao Wang","submitted_at":"2019-09-17T08:29:39Z","abstract_excerpt":"DP-coloring was introduced by Dvo\\v{r}\\'{a}k and Postle as a generalization of list coloring. It was originally used to solve a longstanding conjecture by Borodin, stating that every planar graph without cycles of lengths 4 to 8 is 3-choosable. In this paper, we give three sufficient conditions for a planar graph to be DP-4-colorable. Actually all the results (Theorem 1.3, 1.4 and 1.7) are stated in the ``color extendability'' form, and uniformly proved by vertex identification and discharging method."},"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":"1909.08511","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-17T08:29:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f3f422b48e64272483affadaa976b6d0448be0f17525ee667ecd7728fd0e38f5","abstract_canon_sha256":"0f301768385e8f554f9bbb56ffae91c65bc3c938258f01bbfd62049864753ffc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:36.218175Z","signature_b64":"JqkJavHQOgku0aeWwj2VHi1rcvTWdJkEwNg8/U32olVstgT4/Fttf0/7lQJKztk8/QdR5hEJy/vPbfVC+iCPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01152a18e6dc3b5a4243fa0e824aaa4baeb2f6b737e569b167647c5901bcd616","last_reissued_at":"2026-07-05T04:30:36.217772Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:36.217772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DP-4-coloring of planar graphs with some restrictions on cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Rui Li, Tao Wang","submitted_at":"2019-09-17T08:29:39Z","abstract_excerpt":"DP-coloring was introduced by Dvo\\v{r}\\'{a}k and Postle as a generalization of list coloring. It was originally used to solve a longstanding conjecture by Borodin, stating that every planar graph without cycles of lengths 4 to 8 is 3-choosable. In this paper, we give three sufficient conditions for a planar graph to be DP-4-colorable. Actually all the results (Theorem 1.3, 1.4 and 1.7) are stated in the ``color extendability'' form, and uniformly proved by vertex identification and discharging method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.08511","kind":"arxiv","version":2},"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/1909.08511/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":"1909.08511","created_at":"2026-07-05T04:30:36.217829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.08511v2","created_at":"2026-07-05T04:30:36.217829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.08511","created_at":"2026-07-05T04:30:36.217829+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEKSUGHG3Q5V","created_at":"2026-07-05T04:30:36.217829+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEKSUGHG3Q5VUQSD","created_at":"2026-07-05T04:30:36.217829+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEKSUGHG","created_at":"2026-07-05T04:30:36.217829+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04902","citing_title":"Planar graphs without normally adjacent short cycles","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AEKSUGHG3Q5VUQSD7IHIESVKJO","json":"https://pith.science/pith/AEKSUGHG3Q5VUQSD7IHIESVKJO.json","graph_json":"https://pith.science/api/pith-number/AEKSUGHG3Q5VUQSD7IHIESVKJO/graph.json","events_json":"https://pith.science/api/pith-number/AEKSUGHG3Q5VUQSD7IHIESVKJO/events.json","paper":"https://pith.science/paper/AEKSUGHG"},"agent_actions":{"view_html":"https://pith.science/pith/AEKSUGHG3Q5VUQSD7IHIESVKJO","download_json":"https://pith.science/pith/AEKSUGHG3Q5VUQSD7IHIESVKJO.json","view_paper":"https://pith.science/paper/AEKSUGHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.08511&json=true","fetch_graph":"https://pith.science/api/pith-number/AEKSUGHG3Q5VUQSD7IHIESVKJO/graph.json","fetch_events":"https://pith.science/api/pith-number/AEKSUGHG3Q5VUQSD7IHIESVKJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEKSUGHG3Q5VUQSD7IHIESVKJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEKSUGHG3Q5VUQSD7IHIESVKJO/action/storage_attestation","attest_author":"https://pith.science/pith/AEKSUGHG3Q5VUQSD7IHIESVKJO/action/author_attestation","sign_citation":"https://pith.science/pith/AEKSUGHG3Q5VUQSD7IHIESVKJO/action/citation_signature","submit_replication":"https://pith.science/pith/AEKSUGHG3Q5VUQSD7IHIESVKJO/action/replication_record"}},"created_at":"2026-07-05T04:30:36.217829+00:00","updated_at":"2026-07-05T04:30:36.217829+00:00"}