{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DAJHGWQFUENIAKDAVVAKW6N5GW","short_pith_number":"pith:DAJHGWQF","canonical_record":{"source":{"id":"1401.1399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-07T14:33:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e9f51ecaa39853930dc39a5ca85e309a685bd8f14c8f56e38cb92be36d1f0ac7","abstract_canon_sha256":"769a9c011172237acd6d004d6c37aab318c2bd75339e7249c83ef36388b49270"},"schema_version":"1.0"},"canonical_sha256":"1812735a05a11a802860ad40ab79bd3581006677e1efc04be8cd0e0cc91cc7b5","source":{"kind":"arxiv","id":"1401.1399","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1399","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1399v2","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1399","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"DAJHGWQFUENI","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DAJHGWQFUENIAKDA","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DAJHGWQF","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DAJHGWQFUENIAKDAVVAKW6N5GW","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-07T14:33:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e9f51ecaa39853930dc39a5ca85e309a685bd8f14c8f56e38cb92be36d1f0ac7","abstract_canon_sha256":"769a9c011172237acd6d004d6c37aab318c2bd75339e7249c83ef36388b49270"},"schema_version":"1.0"},"canonical_sha256":"1812735a05a11a802860ad40ab79bd3581006677e1efc04be8cd0e0cc91cc7b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:04.087218Z","signature_b64":"e1PYDSL4R/USJlXY1ozbDYTWg6YYw/I0bwCuUyP886XgvB24rxWtO+MgyGWAhgsCE+UFYSAy+y8g6BKa69WACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1812735a05a11a802860ad40ab79bd3581006677e1efc04be8cd0e0cc91cc7b5","last_reissued_at":"2026-05-18T00:54:04.086773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:04.086773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1399","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-18T00:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBdpGQnUKV1Uhkq363xBYrEqVUzLSds08y0gc0E4tFkPbqoqQ858EV53xIAc0FUp6DRs30xjTSA6zdb+lXHQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:47:01.691617Z"},"content_sha256":"11bdc8ea0cf6a5f901fb3e0a3aea4b7fb93e1fa5498e3174f8ae0ed6a8dae1ed","schema_version":"1.0","event_id":"sha256:11bdc8ea0cf6a5f901fb3e0a3aea4b7fb93e1fa5498e3174f8ae0ed6a8dae1ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DAJHGWQFUENIAKDAVVAKW6N5GW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List-coloring apex-minor-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Robin Thomas, Zdenek Dvorak","submitted_at":"2014-01-07T14:33:51Z","abstract_excerpt":"A graph H is t-apex if H-X is planar for some subset X of V(H) of size t. For any integer t>=0 and a fixed t-apex graph H, we give a polynomial-time algorithm to decide whether a (t+3)-connected H-minor-free graph is colorable from a given assignment of lists of size t+4. The connectivity requirement is the best possible in the sense that for every t>=1, there exists a t-apex graph H such that testing (t+4)-colorability of (t+2)-connected H-minor-free graphs is NP-complete. Similarly, the size of the lists cannot be decreased (unless P=NP), since for every t>=1, testing (t+3)-list-colorability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1399","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-18T00:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/RiUMPpXUQ83ZbkWydsQa3SIuITDQEZKNHJ6/03uBN2UwkzwPc1xjZMK09R+tjUBdW1iSCYPB/Z0hI113K8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:47:01.691965Z"},"content_sha256":"884ec363f2202fbaa0ae7523f028b629df590f24bbcf3ffb4c9113382c1bc089","schema_version":"1.0","event_id":"sha256:884ec363f2202fbaa0ae7523f028b629df590f24bbcf3ffb4c9113382c1bc089"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAJHGWQFUENIAKDAVVAKW6N5GW/bundle.json","state_url":"https://pith.science/pith/DAJHGWQFUENIAKDAVVAKW6N5GW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAJHGWQFUENIAKDAVVAKW6N5GW/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-08T22:47:01Z","links":{"resolver":"https://pith.science/pith/DAJHGWQFUENIAKDAVVAKW6N5GW","bundle":"https://pith.science/pith/DAJHGWQFUENIAKDAVVAKW6N5GW/bundle.json","state":"https://pith.science/pith/DAJHGWQFUENIAKDAVVAKW6N5GW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAJHGWQFUENIAKDAVVAKW6N5GW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DAJHGWQFUENIAKDAVVAKW6N5GW","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":"769a9c011172237acd6d004d6c37aab318c2bd75339e7249c83ef36388b49270","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-07T14:33:51Z","title_canon_sha256":"e9f51ecaa39853930dc39a5ca85e309a685bd8f14c8f56e38cb92be36d1f0ac7"},"schema_version":"1.0","source":{"id":"1401.1399","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1399","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1399v2","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1399","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"DAJHGWQFUENI","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DAJHGWQFUENIAKDA","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DAJHGWQF","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:884ec363f2202fbaa0ae7523f028b629df590f24bbcf3ffb4c9113382c1bc089","target":"graph","created_at":"2026-05-18T00:54:04Z","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 graph H is t-apex if H-X is planar for some subset X of V(H) of size t. For any integer t>=0 and a fixed t-apex graph H, we give a polynomial-time algorithm to decide whether a (t+3)-connected H-minor-free graph is colorable from a given assignment of lists of size t+4. The connectivity requirement is the best possible in the sense that for every t>=1, there exists a t-apex graph H such that testing (t+4)-colorability of (t+2)-connected H-minor-free graphs is NP-complete. Similarly, the size of the lists cannot be decreased (unless P=NP), since for every t>=1, testing (t+3)-list-colorability","authors_text":"Robin Thomas, Zdenek Dvorak","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-07T14:33:51Z","title":"List-coloring apex-minor-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1399","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:11bdc8ea0cf6a5f901fb3e0a3aea4b7fb93e1fa5498e3174f8ae0ed6a8dae1ed","target":"record","created_at":"2026-05-18T00:54:04Z","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":"769a9c011172237acd6d004d6c37aab318c2bd75339e7249c83ef36388b49270","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-07T14:33:51Z","title_canon_sha256":"e9f51ecaa39853930dc39a5ca85e309a685bd8f14c8f56e38cb92be36d1f0ac7"},"schema_version":"1.0","source":{"id":"1401.1399","kind":"arxiv","version":2}},"canonical_sha256":"1812735a05a11a802860ad40ab79bd3581006677e1efc04be8cd0e0cc91cc7b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1812735a05a11a802860ad40ab79bd3581006677e1efc04be8cd0e0cc91cc7b5","first_computed_at":"2026-05-18T00:54:04.086773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:04.086773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e1PYDSL4R/USJlXY1ozbDYTWg6YYw/I0bwCuUyP886XgvB24rxWtO+MgyGWAhgsCE+UFYSAy+y8g6BKa69WACA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:04.087218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1399","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11bdc8ea0cf6a5f901fb3e0a3aea4b7fb93e1fa5498e3174f8ae0ed6a8dae1ed","sha256:884ec363f2202fbaa0ae7523f028b629df590f24bbcf3ffb4c9113382c1bc089"],"state_sha256":"68dae23cbe864d48b3b04f1567a9aa66ed1c7d2a1b159d5d5946a9cb543c1ad1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"itUjWFTTFbXAMbldaQmu14MIXx1h9P4wCWoI7aKGbp188lpk20yz4Ai6FSue8e9x/aw6AbZiRSKY/VOrpWAgDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:47:01.693952Z","bundle_sha256":"246754d3c41ac1cbbab2ebad0694941555ab3cffbce2da930b2dc9fb0e8deafb"}}