{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OGIUGG3CMKILVQT4RCSJWJ3KPT","short_pith_number":"pith:OGIUGG3C","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"},"canonical_sha256":"7191431b626290bac27c88a49b276a7cc08ea4c041ab898699fea95a3e99e8e5","source":{"kind":"arxiv","id":"1804.03976","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03976","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03976v2","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03976","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"OGIUGG3CMKIL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OGIUGG3CMKILVQT4","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OGIUGG3C","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OGIUGG3CMKILVQT4RCSJWJ3KPT","target":"record","payload":{"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"},"canonical_sha256":"7191431b626290bac27c88a49b276a7cc08ea4c041ab898699fea95a3e99e8e5","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"},"source_kind":"arxiv","source_id":"1804.03976","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rae1Kuhi56xfHHSDLsTrqVKvZGIkIr2Sf6LZctIUVCNfxD+mJSEikQLXwVmmovb3B57bR3+9H6iznLCE8z8JAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:01:55.129447Z"},"content_sha256":"c264068f78e15fcb72217580e2679aa26a956e932a22644113b63dfa79d818c0","schema_version":"1.0","event_id":"sha256:c264068f78e15fcb72217580e2679aa26a956e932a22644113b63dfa79d818c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OGIUGG3CMKILVQT4RCSJWJ3KPT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"px2eHWvOwCzEC92PQAy2y26sMM2D0T12qJLMxC7O5YVtwjmvnQxzKt/1ZtFtwrZLWdAUc9+AriCkQ+CzFpsODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:01:55.130170Z"},"content_sha256":"8ba2ad16f453b038464d871b38dbab31a9a7cef760b29c7fa5b403375fa247f9","schema_version":"1.0","event_id":"sha256:8ba2ad16f453b038464d871b38dbab31a9a7cef760b29c7fa5b403375fa247f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/bundle.json","state_url":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T12:01:55Z","links":{"resolver":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT","bundle":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/bundle.json","state":"https://pith.science/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGIUGG3CMKILVQT4RCSJWJ3KPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OGIUGG3CMKILVQT4RCSJWJ3KPT","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":"1e081aad3b426be17071d101b332d75dd201cd6b0e4431073222e72f54c2130d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T13:31:37Z","title_canon_sha256":"93e11fc1d5595f4980b2ffef614bedc531d0c768c26b93b023257c01da2961a3"},"schema_version":"1.0","source":{"id":"1804.03976","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03976","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03976v2","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03976","created_at":"2026-05-17T23:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"OGIUGG3CMKIL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OGIUGG3CMKILVQT4","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OGIUGG3C","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:8ba2ad16f453b038464d871b38dbab31a9a7cef760b29c7fa5b403375fa247f9","target":"graph","created_at":"2026-05-17T23:40: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"},"paper":{"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.","authors_text":"Runrun Liu, Xiangwen Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T13:31:37Z","title":"Every planar graph without adjacent cycles of length at most $8$ is $3$-choosable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03976","kind":"arxiv","version":2},"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:c264068f78e15fcb72217580e2679aa26a956e932a22644113b63dfa79d818c0","target":"record","created_at":"2026-05-17T23:40: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":"1e081aad3b426be17071d101b332d75dd201cd6b0e4431073222e72f54c2130d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T13:31:37Z","title_canon_sha256":"93e11fc1d5595f4980b2ffef614bedc531d0c768c26b93b023257c01da2961a3"},"schema_version":"1.0","source":{"id":"1804.03976","kind":"arxiv","version":2}},"canonical_sha256":"7191431b626290bac27c88a49b276a7cc08ea4c041ab898699fea95a3e99e8e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7191431b626290bac27c88a49b276a7cc08ea4c041ab898699fea95a3e99e8e5","first_computed_at":"2026-05-17T23:40:36.506625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:36.506625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iyyadws8+67p/rVBlr3/+jFIJVN5cCPTASsWogySKhmsilbxKA8lrOfxDeQnCrxS4sFzFgXPJHd3PNHcscBhAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:36.507010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03976","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c264068f78e15fcb72217580e2679aa26a956e932a22644113b63dfa79d818c0","sha256:8ba2ad16f453b038464d871b38dbab31a9a7cef760b29c7fa5b403375fa247f9"],"state_sha256":"eb66c82b8dce0b4e2c8eb4a2f083ee5b8bf19b261e1b7b5a0544d1460b37562d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJJO0yy1MAmAEOYxIWWCmROs3s4biKNrtaGChUxoa0Dy+ANkOPebBJVX/iVnOURCj+odv04vIPEWOFTZKhKFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:01:55.133624Z","bundle_sha256":"d7b269ed217da7005b70cef6b43488dcb8be551f4dbbe1c34c7b595b28f63869"}}