{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EWEGPEGRMT4S7Q7XM5SDBFZUDO","short_pith_number":"pith:EWEGPEGR","canonical_record":{"source":{"id":"1306.5283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-22T02:36:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c9cd7d7987cbdf70049269ed3a897c3fbbf2634b498bee7f6fda33324edf1679","abstract_canon_sha256":"e679aa9729d268d9b7eb7ab8cb9942ca7db444def1a8c37c3ec35405c292081b"},"schema_version":"1.0"},"canonical_sha256":"25886790d164f92fc3f767643097341bae1b54a0642df335a228d3ffd314e7e4","source":{"kind":"arxiv","id":"1306.5283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5283","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5283v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5283","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"EWEGPEGRMT4S","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EWEGPEGRMT4S7Q7X","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EWEGPEGR","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EWEGPEGRMT4S7Q7XM5SDBFZUDO","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-22T02:36:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c9cd7d7987cbdf70049269ed3a897c3fbbf2634b498bee7f6fda33324edf1679","abstract_canon_sha256":"e679aa9729d268d9b7eb7ab8cb9942ca7db444def1a8c37c3ec35405c292081b"},"schema_version":"1.0"},"canonical_sha256":"25886790d164f92fc3f767643097341bae1b54a0642df335a228d3ffd314e7e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.410087Z","signature_b64":"Rexj9faKaPki8d3nhd+8BrP+BJbHPU0I6J2ZUVMnbOBZl8xy8rNmqXxUSaeQvSE7Qd5dgW+k6/G6YPat4iNuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25886790d164f92fc3f767643097341bae1b54a0642df335a228d3ffd314e7e4","last_reissued_at":"2026-05-18T00:54:58.409701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.409701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5283","source_version":1,"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-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MqIUL4OEOnLrGl8d2lmT2BhwFT2YmSdhKZfOGh+6vOjaDFwfnGfFeB1CCYHHn7+E/oCeJ8zA5S9u5L+Nj4uNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:37:58.875632Z"},"content_sha256":"ede13ec395127f9aef1b054d925fff706119ea7f05909cf7827d8dfaffee2af9","schema_version":"1.0","event_id":"sha256:ede13ec395127f9aef1b054d925fff706119ea7f05909cf7827d8dfaffee2af9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EWEGPEGRMT4S7Q7XM5SDBFZUDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On choosability with separation of planar graphs with lists of different sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Hal Kierstead","submitted_at":"2013-06-22T02:36:14Z","abstract_excerpt":"A (k,d)-list assignment L of a graph G is a mapping that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at most d colors. A graph G is (k,d)-choosable if there exists an L-coloring of G for every (k,d)-list assignment L. This concept is also known as choosability with separation.\n  It is known that planar graphs are (4,1)-choosable but it is not known if planar graphs are (3,1)-choosable. We strengthen the result that planar graphs are (4,1)-choosable by allowing an independent set of vertices to have lists of size 3 instea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5283","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":""},"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-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKcDjswnfBsxP9GN5Afcm4CXVi7hFtA1oKKlYBDH2btXp7e5PoBLlqfc2YU5jlZVYE78/NdMLGTXalSm022YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:37:58.876354Z"},"content_sha256":"95336cbd1761d2ef873becbab6ae71759601d43391965239500452ad4fa3406e","schema_version":"1.0","event_id":"sha256:95336cbd1761d2ef873becbab6ae71759601d43391965239500452ad4fa3406e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWEGPEGRMT4S7Q7XM5SDBFZUDO/bundle.json","state_url":"https://pith.science/pith/EWEGPEGRMT4S7Q7XM5SDBFZUDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWEGPEGRMT4S7Q7XM5SDBFZUDO/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-11T06:37:58Z","links":{"resolver":"https://pith.science/pith/EWEGPEGRMT4S7Q7XM5SDBFZUDO","bundle":"https://pith.science/pith/EWEGPEGRMT4S7Q7XM5SDBFZUDO/bundle.json","state":"https://pith.science/pith/EWEGPEGRMT4S7Q7XM5SDBFZUDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWEGPEGRMT4S7Q7XM5SDBFZUDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EWEGPEGRMT4S7Q7XM5SDBFZUDO","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":"e679aa9729d268d9b7eb7ab8cb9942ca7db444def1a8c37c3ec35405c292081b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-22T02:36:14Z","title_canon_sha256":"c9cd7d7987cbdf70049269ed3a897c3fbbf2634b498bee7f6fda33324edf1679"},"schema_version":"1.0","source":{"id":"1306.5283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5283","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5283v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5283","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"EWEGPEGRMT4S","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EWEGPEGRMT4S7Q7X","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EWEGPEGR","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:95336cbd1761d2ef873becbab6ae71759601d43391965239500452ad4fa3406e","target":"graph","created_at":"2026-05-18T00:54:58Z","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":"A (k,d)-list assignment L of a graph G is a mapping that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at most d colors. A graph G is (k,d)-choosable if there exists an L-coloring of G for every (k,d)-list assignment L. This concept is also known as choosability with separation.\n  It is known that planar graphs are (4,1)-choosable but it is not known if planar graphs are (3,1)-choosable. We strengthen the result that planar graphs are (4,1)-choosable by allowing an independent set of vertices to have lists of size 3 instea","authors_text":"Bernard Lidick\\'y, Hal Kierstead","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-22T02:36:14Z","title":"On choosability with separation of planar graphs with lists of different sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5283","kind":"arxiv","version":1},"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:ede13ec395127f9aef1b054d925fff706119ea7f05909cf7827d8dfaffee2af9","target":"record","created_at":"2026-05-18T00:54:58Z","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":"e679aa9729d268d9b7eb7ab8cb9942ca7db444def1a8c37c3ec35405c292081b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-22T02:36:14Z","title_canon_sha256":"c9cd7d7987cbdf70049269ed3a897c3fbbf2634b498bee7f6fda33324edf1679"},"schema_version":"1.0","source":{"id":"1306.5283","kind":"arxiv","version":1}},"canonical_sha256":"25886790d164f92fc3f767643097341bae1b54a0642df335a228d3ffd314e7e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25886790d164f92fc3f767643097341bae1b54a0642df335a228d3ffd314e7e4","first_computed_at":"2026-05-18T00:54:58.409701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.409701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rexj9faKaPki8d3nhd+8BrP+BJbHPU0I6J2ZUVMnbOBZl8xy8rNmqXxUSaeQvSE7Qd5dgW+k6/G6YPat4iNuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.410087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ede13ec395127f9aef1b054d925fff706119ea7f05909cf7827d8dfaffee2af9","sha256:95336cbd1761d2ef873becbab6ae71759601d43391965239500452ad4fa3406e"],"state_sha256":"b886e360e8786a09fbd9010d7ec2cb79ab3fb23a349d4921f694ff6813190efb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LfM3wxa8DuRSyN3wcEFSqxlFSONhTuV+SEX1gfWo+xZLTNDGw30xqhEBROZhHkaZXPyd9SB544Qs31Q06bqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:37:58.880666Z","bundle_sha256":"cd3f47e3ffec38b59fcbb9a129bf9259cc5c5ebf1b64112330ed339a9b5184d6"}}