{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OGIUGG3CMKILVQT4RCSJWJ3KPT","short_pith_number":"pith:OGIUGG3C","schema_version":"1.0","canonical_sha256":"7191431b626290bac27c88a49b276a7cc08ea4c041ab898699fea95a3e99e8e5","source":{"kind":"arxiv","id":"1804.03976","version":2},"attestation_state":"computed","paper":{"title":"Every planar graph without adjacent cycles of length at most $8$ is $3$-choosable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Runrun Liu, Xiangwen Li","submitted_at":"2018-04-11T13:31:37Z","abstract_excerpt":"DP-coloring as a generalization of list coloring was introduced by Dvo\\v{r}\\'{a}k and Postle in 2017, who proved that every planar graph without cycles from 4 to 8 is 3-choosable, which was conjectured by Borodin {\\it et al.} in 2007. In this paper, we prove that every planar graph without adjacent cycles of length at most $8$ is $3$-choosable, which extends this result of Dvo\\v{r}\\'{a}k and Postle."},"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":"1804.03976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T13:31:37Z","cross_cats_sorted":[],"title_canon_sha256":"93e11fc1d5595f4980b2ffef614bedc531d0c768c26b93b023257c01da2961a3","abstract_canon_sha256":"1e081aad3b426be17071d101b332d75dd201cd6b0e4431073222e72f54c2130d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:36.507010Z","signature_b64":"Iyyadws8+67p/rVBlr3/+jFIJVN5cCPTASsWogySKhmsilbxKA8lrOfxDeQnCrxS4sFzFgXPJHd3PNHcscBhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7191431b626290bac27c88a49b276a7cc08ea4c041ab898699fea95a3e99e8e5","last_reissued_at":"2026-05-17T23:40:36.506625Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:36.506625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every planar graph without adjacent cycles of length at most $8$ is $3$-choosable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Runrun Liu, Xiangwen Li","submitted_at":"2018-04-11T13:31:37Z","abstract_excerpt":"DP-coloring as a generalization of list coloring was introduced by Dvo\\v{r}\\'{a}k and Postle in 2017, who proved that every planar graph without cycles from 4 to 8 is 3-choosable, which was conjectured by Borodin {\\it et al.} in 2007. In this paper, we prove that every planar graph without adjacent cycles of length at most $8$ is $3$-choosable, which extends this result of Dvo\\v{r}\\'{a}k and Postle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03976","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":""},"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":"1804.03976","created_at":"2026-05-17T23:40:36.506682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03976v2","created_at":"2026-05-17T23:40:36.506682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03976","created_at":"2026-05-17T23:40:36.506682+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGIUGG3CMKIL","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGIUGG3CMKILVQT4","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGIUGG3C","created_at":"2026-05-18T12:32:43.782077+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/OGIUGG3CMKILVQT4RCSJWJ3KPT","json":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT.json","graph_json":"https://pith.science/api/pith-number/OGIUGG3CMKILVQT4RCSJWJ3KPT/graph.json","events_json":"https://pith.science/api/pith-number/OGIUGG3CMKILVQT4RCSJWJ3KPT/events.json","paper":"https://pith.science/paper/OGIUGG3C"},"agent_actions":{"view_html":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT","download_json":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT.json","view_paper":"https://pith.science/paper/OGIUGG3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03976&json=true","fetch_graph":"https://pith.science/api/pith-number/OGIUGG3CMKILVQT4RCSJWJ3KPT/graph.json","fetch_events":"https://pith.science/api/pith-number/OGIUGG3CMKILVQT4RCSJWJ3KPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/action/storage_attestation","attest_author":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/action/author_attestation","sign_citation":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/action/citation_signature","submit_replication":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/action/replication_record"}},"created_at":"2026-05-17T23:40:36.506682+00:00","updated_at":"2026-05-17T23:40:36.506682+00:00"}