{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2KW3SLC4MUE6DWWW3WKJZL774H","short_pith_number":"pith:2KW3SLC4","canonical_record":{"source":{"id":"1512.03787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-11T20:16:17Z","cross_cats_sorted":[],"title_canon_sha256":"a01812dfed298d1a838da44159bbb797385cf05bf1acbdaa901ee611a95241b1","abstract_canon_sha256":"c6e7694f6d54d2ded6606b35d88fa40515ea5a6124e0aa8caa1506e621eabfad"},"schema_version":"1.0"},"canonical_sha256":"d2adb92c5c6509e1dad6dd949cafffe1d13ceea86c75d79f79e5cd7d58bd32af","source":{"kind":"arxiv","id":"1512.03787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03787","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03787v1","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03787","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"2KW3SLC4MUE6","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2KW3SLC4MUE6DWWW","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2KW3SLC4","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2KW3SLC4MUE6DWWW3WKJZL774H","target":"record","payload":{"canonical_record":{"source":{"id":"1512.03787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-11T20:16:17Z","cross_cats_sorted":[],"title_canon_sha256":"a01812dfed298d1a838da44159bbb797385cf05bf1acbdaa901ee611a95241b1","abstract_canon_sha256":"c6e7694f6d54d2ded6606b35d88fa40515ea5a6124e0aa8caa1506e621eabfad"},"schema_version":"1.0"},"canonical_sha256":"d2adb92c5c6509e1dad6dd949cafffe1d13ceea86c75d79f79e5cd7d58bd32af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:41.589096Z","signature_b64":"NQdLLokUcEuKUu09w2lzOHVNmD2uXUa8UB9WJseeVtIYcqyXAtccBz1UI9sADgGCa/Qy9YRJUZwPm8yeGf50AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2adb92c5c6509e1dad6dd949cafffe1d13ceea86c75d79f79e5cd7d58bd32af","last_reissued_at":"2026-05-18T00:40:41.588377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:41.588377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.03787","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:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BimaENZYOnUs/yH2fkKaxZSIr0PS26XzxH9zgA96Iqr/qW0r7xXuemYooWgR8CdLeY8zPmX3lBNsWgcaw5EEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:27:20.778203Z"},"content_sha256":"3f5816e9f742fa720109a1a27848b7ad49b278ca08a778ddd763839a84f80b29","schema_version":"1.0","event_id":"sha256:3f5816e9f742fa720109a1a27848b7ad49b278ca08a778ddd763839a84f80b29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2KW3SLC4MUE6DWWW3WKJZL774H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"(4,2)-choosability of planar graphs with forbidden structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Christopher Cox, Derrick Stolee, Kacy Messerschmidt, Kathleen Nowak, Kevin F. Palmowski, Kevin Moss, Kirsten Hogenson, Michael Dairyko, Mohit Kumbhat, Zhanar Berikkyzy","submitted_at":"2015-12-11T20:16:17Z","abstract_excerpt":"All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lists of size four has received significant attention. In terms of constraining the structure of the graph, for any $\\ell \\in \\{3,4,5,6,7\\}$, a planar graph is 4-choosable if it is $\\ell$-cycle-free. In terms of constraining the list assignment, one refinement of $k$-choosability is choosability with separation. A graph is $(k,s)$-choosable if the graph is colorable from lists of size $k$ where adjacent vertices have at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03787","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:40:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqJclE3CXrZ0ESBSLh5FQNfvbFgbty6eZBVkIC1fm2McjXUPstckHN6oOpPbI+i+C8OYKQNDK1AwdFOGk7L3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:27:20.778576Z"},"content_sha256":"33a1bba7fd9e3064b6dffa6775dc3c45eb29ecd73491130ace2b7fc8e9b3a18c","schema_version":"1.0","event_id":"sha256:33a1bba7fd9e3064b6dffa6775dc3c45eb29ecd73491130ace2b7fc8e9b3a18c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H/bundle.json","state_url":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KW3SLC4MUE6DWWW3WKJZL774H/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-05-28T06:27:20Z","links":{"resolver":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H","bundle":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H/bundle.json","state":"https://pith.science/pith/2KW3SLC4MUE6DWWW3WKJZL774H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KW3SLC4MUE6DWWW3WKJZL774H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2KW3SLC4MUE6DWWW3WKJZL774H","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":"c6e7694f6d54d2ded6606b35d88fa40515ea5a6124e0aa8caa1506e621eabfad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-11T20:16:17Z","title_canon_sha256":"a01812dfed298d1a838da44159bbb797385cf05bf1acbdaa901ee611a95241b1"},"schema_version":"1.0","source":{"id":"1512.03787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03787","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03787v1","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03787","created_at":"2026-05-18T00:40:41Z"},{"alias_kind":"pith_short_12","alias_value":"2KW3SLC4MUE6","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2KW3SLC4MUE6DWWW","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2KW3SLC4","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:33a1bba7fd9e3064b6dffa6775dc3c45eb29ecd73491130ace2b7fc8e9b3a18c","target":"graph","created_at":"2026-05-18T00:40:41Z","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":"All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lists of size four has received significant attention. In terms of constraining the structure of the graph, for any $\\ell \\in \\{3,4,5,6,7\\}$, a planar graph is 4-choosable if it is $\\ell$-cycle-free. In terms of constraining the list assignment, one refinement of $k$-choosability is choosability with separation. A graph is $(k,s)$-choosable if the graph is colorable from lists of size $k$ where adjacent vertices have at","authors_text":"Bernard Lidick\\'y, Christopher Cox, Derrick Stolee, Kacy Messerschmidt, Kathleen Nowak, Kevin F. Palmowski, Kevin Moss, Kirsten Hogenson, Michael Dairyko, Mohit Kumbhat, Zhanar Berikkyzy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-11T20:16:17Z","title":"(4,2)-choosability of planar graphs with forbidden structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03787","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:3f5816e9f742fa720109a1a27848b7ad49b278ca08a778ddd763839a84f80b29","target":"record","created_at":"2026-05-18T00:40:41Z","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":"c6e7694f6d54d2ded6606b35d88fa40515ea5a6124e0aa8caa1506e621eabfad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-11T20:16:17Z","title_canon_sha256":"a01812dfed298d1a838da44159bbb797385cf05bf1acbdaa901ee611a95241b1"},"schema_version":"1.0","source":{"id":"1512.03787","kind":"arxiv","version":1}},"canonical_sha256":"d2adb92c5c6509e1dad6dd949cafffe1d13ceea86c75d79f79e5cd7d58bd32af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2adb92c5c6509e1dad6dd949cafffe1d13ceea86c75d79f79e5cd7d58bd32af","first_computed_at":"2026-05-18T00:40:41.588377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:41.588377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NQdLLokUcEuKUu09w2lzOHVNmD2uXUa8UB9WJseeVtIYcqyXAtccBz1UI9sADgGCa/Qy9YRJUZwPm8yeGf50AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:41.589096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f5816e9f742fa720109a1a27848b7ad49b278ca08a778ddd763839a84f80b29","sha256:33a1bba7fd9e3064b6dffa6775dc3c45eb29ecd73491130ace2b7fc8e9b3a18c"],"state_sha256":"05a8635d61d9d04c31c039cc0802eadd75a793c5c112888c53e956c89365e8d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8SfhIziFwRPaoG4odKjhIsU2nafhQ8mIBxvxv9LmUq8MLWyzLgGuMRniMgCQKdnZHi9XMILmaGtJiDwOJP3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:27:20.780595Z","bundle_sha256":"fc99e7a1102d5dbbac7795ef410162131003a69103900aa87e07d2d438e3d1ba"}}