{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NFAIAQXRD3QCI4POWFNTZFRE2D","short_pith_number":"pith:NFAIAQXR","canonical_record":{"source":{"id":"1005.5194","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-27T23:35:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2f52e0efb80d7f01333bc1baf75b160f9e599e875e44317133886acababc780b","abstract_canon_sha256":"cf3b286eca031043c0ae6524168903e082aade227d03235c6297c361ee76e5a7"},"schema_version":"1.0"},"canonical_sha256":"69408042f11ee02471eeb15b3c9624d0cbedac5d4fbac262b989b45b10b1298e","source":{"kind":"arxiv","id":"1005.5194","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5194","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5194v3","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5194","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"NFAIAQXRD3QC","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NFAIAQXRD3QCI4PO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NFAIAQXR","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NFAIAQXRD3QCI4POWFNTZFRE2D","target":"record","payload":{"canonical_record":{"source":{"id":"1005.5194","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-27T23:35:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2f52e0efb80d7f01333bc1baf75b160f9e599e875e44317133886acababc780b","abstract_canon_sha256":"cf3b286eca031043c0ae6524168903e082aade227d03235c6297c361ee76e5a7"},"schema_version":"1.0"},"canonical_sha256":"69408042f11ee02471eeb15b3c9624d0cbedac5d4fbac262b989b45b10b1298e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:27.626517Z","signature_b64":"Y5ObQ83ugsJlvSJfvl/mBaPbAumLuR2Oe70r1JPt0jwdc+/vhUQ+rEbPhKu94c7aDwJ4gZ+8g946cBdC4Ru0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69408042f11ee02471eeb15b3c9624d0cbedac5d4fbac262b989b45b10b1298e","last_reissued_at":"2026-05-18T04:24:27.625808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:27.625808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.5194","source_version":3,"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-18T04:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5xH6H/LxfvuEBlofA4aRQarM43p0atQ4CkSUZzJ7xsBnY2foHMbStmM0K8bZtuCDth7nSu2eUR88SMRQomZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:33:11.417669Z"},"content_sha256":"1c7dad5e47ff8cf2a97b73bf25a0e84999edccd24f9c4262437c0be6f5224ee2","schema_version":"1.0","event_id":"sha256:1c7dad5e47ff8cf2a97b73bf25a0e84999edccd24f9c4262437c0be6f5224ee2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NFAIAQXRD3QCI4POWFNTZFRE2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thomassen's Choosability Argument Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Svante Linusson","submitted_at":"2010-05-27T23:35:49Z","abstract_excerpt":"Thomassen (1994) proved that every planar graph is 5-choosable. This result was generalised by {\\v{S}}krekovski (1998) and He et al. (2008), who proved that every $K_5$-minor-free graph is 5-choosable. Both proofs rely on the characterisation of $K_5$-minor-free graphs due to Wagner (1937). This paper proves the same result without using Wagner's structure theorem or even planar embeddings. Given that there is no structure theorem for graphs with no $K_6$-minor, we argue that this proof suggests a possible approach for attacking the Hadwiger Conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5194","kind":"arxiv","version":3},"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-18T04:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIBcTLzg/9h+qjEikHUDul7EvMsfNZQWhcNvNYmv3Z1ktvM+AIuYagN3ebWiqWBebK6oaZjES4y7A+UrXShCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:33:11.418013Z"},"content_sha256":"e0994112a021783f6b273764f5f18e6150c4aa8439e854e92fbd854e110b33f2","schema_version":"1.0","event_id":"sha256:e0994112a021783f6b273764f5f18e6150c4aa8439e854e92fbd854e110b33f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NFAIAQXRD3QCI4POWFNTZFRE2D/bundle.json","state_url":"https://pith.science/pith/NFAIAQXRD3QCI4POWFNTZFRE2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NFAIAQXRD3QCI4POWFNTZFRE2D/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-22T10:33:11Z","links":{"resolver":"https://pith.science/pith/NFAIAQXRD3QCI4POWFNTZFRE2D","bundle":"https://pith.science/pith/NFAIAQXRD3QCI4POWFNTZFRE2D/bundle.json","state":"https://pith.science/pith/NFAIAQXRD3QCI4POWFNTZFRE2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NFAIAQXRD3QCI4POWFNTZFRE2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NFAIAQXRD3QCI4POWFNTZFRE2D","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":"cf3b286eca031043c0ae6524168903e082aade227d03235c6297c361ee76e5a7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-27T23:35:49Z","title_canon_sha256":"2f52e0efb80d7f01333bc1baf75b160f9e599e875e44317133886acababc780b"},"schema_version":"1.0","source":{"id":"1005.5194","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5194","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5194v3","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5194","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"NFAIAQXRD3QC","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NFAIAQXRD3QCI4PO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NFAIAQXR","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:e0994112a021783f6b273764f5f18e6150c4aa8439e854e92fbd854e110b33f2","target":"graph","created_at":"2026-05-18T04:24:27Z","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":"Thomassen (1994) proved that every planar graph is 5-choosable. This result was generalised by {\\v{S}}krekovski (1998) and He et al. (2008), who proved that every $K_5$-minor-free graph is 5-choosable. Both proofs rely on the characterisation of $K_5$-minor-free graphs due to Wagner (1937). This paper proves the same result without using Wagner's structure theorem or even planar embeddings. Given that there is no structure theorem for graphs with no $K_6$-minor, we argue that this proof suggests a possible approach for attacking the Hadwiger Conjecture.","authors_text":"David R. Wood, Svante Linusson","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-27T23:35:49Z","title":"Thomassen's Choosability Argument Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5194","kind":"arxiv","version":3},"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:1c7dad5e47ff8cf2a97b73bf25a0e84999edccd24f9c4262437c0be6f5224ee2","target":"record","created_at":"2026-05-18T04:24:27Z","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":"cf3b286eca031043c0ae6524168903e082aade227d03235c6297c361ee76e5a7","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-27T23:35:49Z","title_canon_sha256":"2f52e0efb80d7f01333bc1baf75b160f9e599e875e44317133886acababc780b"},"schema_version":"1.0","source":{"id":"1005.5194","kind":"arxiv","version":3}},"canonical_sha256":"69408042f11ee02471eeb15b3c9624d0cbedac5d4fbac262b989b45b10b1298e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69408042f11ee02471eeb15b3c9624d0cbedac5d4fbac262b989b45b10b1298e","first_computed_at":"2026-05-18T04:24:27.625808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:27.625808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y5ObQ83ugsJlvSJfvl/mBaPbAumLuR2Oe70r1JPt0jwdc+/vhUQ+rEbPhKu94c7aDwJ4gZ+8g946cBdC4Ru0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:27.626517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.5194","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c7dad5e47ff8cf2a97b73bf25a0e84999edccd24f9c4262437c0be6f5224ee2","sha256:e0994112a021783f6b273764f5f18e6150c4aa8439e854e92fbd854e110b33f2"],"state_sha256":"4801df9ff43ab06df81b35f8ddc12fc6f2f8c2213c4d1e8216139a91a6342114"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pz3iL6D4MTlGXsGeBNK+3BboBcv4rQWzE/lp70KH1Q2WgGlgjn0StTg+cH4uwdxy0eu1/XNyNt0mLTwCwH6BBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:33:11.420064Z","bundle_sha256":"795617a5f52d50281ef12c2ed40a1cdec3906bddebe6674125ff43f4e5714d8a"}}