{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HFUQGXSHEOAIIBB3QRQAK5P2I3","short_pith_number":"pith:HFUQGXSH","canonical_record":{"source":{"id":"1906.01506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-04T15:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"122ed6a2bd86b26bb13c2ed8e6a1fb7620701e92e06019150c94a9af1f12bdc9","abstract_canon_sha256":"595394783e94cfff65b27c1b80825ac9411fb39e52e77b7b0d1d6f3dd522fa09"},"schema_version":"1.0"},"canonical_sha256":"3969035e47238084043b84600575fa46cef7eebd24dea0b908be5f721bff1577","source":{"kind":"arxiv","id":"1906.01506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01506","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01506v1","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01506","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"HFUQGXSHEOAI","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HFUQGXSHEOAIIBB3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HFUQGXSH","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HFUQGXSHEOAIIBB3QRQAK5P2I3","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-04T15:14:59Z","cross_cats_sorted":[],"title_canon_sha256":"122ed6a2bd86b26bb13c2ed8e6a1fb7620701e92e06019150c94a9af1f12bdc9","abstract_canon_sha256":"595394783e94cfff65b27c1b80825ac9411fb39e52e77b7b0d1d6f3dd522fa09"},"schema_version":"1.0"},"canonical_sha256":"3969035e47238084043b84600575fa46cef7eebd24dea0b908be5f721bff1577","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:16.337754Z","signature_b64":"fd+5XERttdjuC68gu7YRHCIKbQ5bmXeIpCygSzYwlQJuqoksyjFp1iEoCTzEiOSk66HweLD2ALcUjmIB1Cu/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3969035e47238084043b84600575fa46cef7eebd24dea0b908be5f721bff1577","last_reissued_at":"2026-05-17T23:44:16.337102Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:16.337102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01506","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-17T23:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SKjQPamw4ghRSTC0IjxyEXnFVPvsjjL0zvJ3rIqEAJdkEzem/fhBINepFoPVRw0/lI0jsL3IMr/X7p9yjBAKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:12:27.036128Z"},"content_sha256":"a8e4d58c353928ccab5664164cb2106a8328c25b01a4b4db0a41b8d443c23139","schema_version":"1.0","event_id":"sha256:a8e4d58c353928ccab5664164cb2106a8328c25b01a4b4db0a41b8d443c23139"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HFUQGXSHEOAIIBB3QRQAK5P2I3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Alon-Tarsi number of subgraphs of a planar graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ringi Kim, Seog-Jin Kim, Xuding Zhu","submitted_at":"2019-06-04T15:14:59Z","abstract_excerpt":"This paper constructs a planar graph $G_1$ such that for any subgraph $H$ of $G_1$ with maximum degree $\\Delta(H) \\le 3$, $G_1-E(H)$ is not $3$-choosable, and a planar graph $G_2$ such that for any star forest $F$ in $G_2$, $G_2-E(F)$ contains a copy of $K_4$ and hence $G_2-E(F)$ is not $3$-colourable. On the other hand, we prove that every planar graph $G$ contains a forest $F$ such that the Alon-Tarsi number of $G - E(F)$ is at most $3$, and hence $G - E(F)$ is 3-paintable and 3-choosable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01506","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-17T23:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"si12iO43NRurTo+g2WVFkR370TN3Ic/1bKF394eCU0FWTFA9wqgeAghkaqEajS3RhAG0PaGPNmlG1DYA6tsdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:12:27.040650Z"},"content_sha256":"040bc2903643084c3f8124e151ae1daf93aa9c6fbf085ee92298cd621358d270","schema_version":"1.0","event_id":"sha256:040bc2903643084c3f8124e151ae1daf93aa9c6fbf085ee92298cd621358d270"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFUQGXSHEOAIIBB3QRQAK5P2I3/bundle.json","state_url":"https://pith.science/pith/HFUQGXSHEOAIIBB3QRQAK5P2I3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFUQGXSHEOAIIBB3QRQAK5P2I3/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-30T23:12:27Z","links":{"resolver":"https://pith.science/pith/HFUQGXSHEOAIIBB3QRQAK5P2I3","bundle":"https://pith.science/pith/HFUQGXSHEOAIIBB3QRQAK5P2I3/bundle.json","state":"https://pith.science/pith/HFUQGXSHEOAIIBB3QRQAK5P2I3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFUQGXSHEOAIIBB3QRQAK5P2I3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HFUQGXSHEOAIIBB3QRQAK5P2I3","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":"595394783e94cfff65b27c1b80825ac9411fb39e52e77b7b0d1d6f3dd522fa09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-04T15:14:59Z","title_canon_sha256":"122ed6a2bd86b26bb13c2ed8e6a1fb7620701e92e06019150c94a9af1f12bdc9"},"schema_version":"1.0","source":{"id":"1906.01506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01506","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01506v1","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01506","created_at":"2026-05-17T23:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"HFUQGXSHEOAI","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HFUQGXSHEOAIIBB3","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HFUQGXSH","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:040bc2903643084c3f8124e151ae1daf93aa9c6fbf085ee92298cd621358d270","target":"graph","created_at":"2026-05-17T23:44:16Z","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":"This paper constructs a planar graph $G_1$ such that for any subgraph $H$ of $G_1$ with maximum degree $\\Delta(H) \\le 3$, $G_1-E(H)$ is not $3$-choosable, and a planar graph $G_2$ such that for any star forest $F$ in $G_2$, $G_2-E(F)$ contains a copy of $K_4$ and hence $G_2-E(F)$ is not $3$-colourable. On the other hand, we prove that every planar graph $G$ contains a forest $F$ such that the Alon-Tarsi number of $G - E(F)$ is at most $3$, and hence $G - E(F)$ is 3-paintable and 3-choosable.","authors_text":"Ringi Kim, Seog-Jin Kim, Xuding Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-04T15:14:59Z","title":"The Alon-Tarsi number of subgraphs of a planar graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01506","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:a8e4d58c353928ccab5664164cb2106a8328c25b01a4b4db0a41b8d443c23139","target":"record","created_at":"2026-05-17T23:44:16Z","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":"595394783e94cfff65b27c1b80825ac9411fb39e52e77b7b0d1d6f3dd522fa09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-04T15:14:59Z","title_canon_sha256":"122ed6a2bd86b26bb13c2ed8e6a1fb7620701e92e06019150c94a9af1f12bdc9"},"schema_version":"1.0","source":{"id":"1906.01506","kind":"arxiv","version":1}},"canonical_sha256":"3969035e47238084043b84600575fa46cef7eebd24dea0b908be5f721bff1577","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3969035e47238084043b84600575fa46cef7eebd24dea0b908be5f721bff1577","first_computed_at":"2026-05-17T23:44:16.337102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:16.337102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fd+5XERttdjuC68gu7YRHCIKbQ5bmXeIpCygSzYwlQJuqoksyjFp1iEoCTzEiOSk66HweLD2ALcUjmIB1Cu/Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:16.337754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8e4d58c353928ccab5664164cb2106a8328c25b01a4b4db0a41b8d443c23139","sha256:040bc2903643084c3f8124e151ae1daf93aa9c6fbf085ee92298cd621358d270"],"state_sha256":"7acee7ae457a2ab0201da23ad2da80f0987160cb43d622ab1745b89aa28beb48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CX6fMkaPVt/PwlTIsTcpzBviyJNRCiZSN0q29jcEcvipUYm0pX/8TJrgdrmEwkG4nAP85S6hvzsSfa+KhkYwBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:12:27.043632Z","bundle_sha256":"6776a843251d7bf776488ecd952c1ecb1cb618995cfbf938bbcccaa61bb11ab9"}}