{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7UBURUU6AEUUSFZGLDHHHXYKA5","short_pith_number":"pith:7UBURUU6","canonical_record":{"source":{"id":"1103.1801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-09T15:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"218fd52666e8ef517028cd24cb3ad37c70a21ab8d5a6f14aefe3dbd971175b80","abstract_canon_sha256":"1e0213b543e6a699b3803e062b6a306a0f42bb4036aaf1d3ed1edc9f408131f1"},"schema_version":"1.0"},"canonical_sha256":"fd0348d29e012949172658ce73df0a0778a2db5c46376c4adbb98069453e90b7","source":{"kind":"arxiv","id":"1103.1801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1801","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1801v1","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1801","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"7UBURUU6AEUU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7UBURUU6AEUUSFZG","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7UBURUU6","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7UBURUU6AEUUSFZGLDHHHXYKA5","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-09T15:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"218fd52666e8ef517028cd24cb3ad37c70a21ab8d5a6f14aefe3dbd971175b80","abstract_canon_sha256":"1e0213b543e6a699b3803e062b6a306a0f42bb4036aaf1d3ed1edc9f408131f1"},"schema_version":"1.0"},"canonical_sha256":"fd0348d29e012949172658ce73df0a0778a2db5c46376c4adbb98069453e90b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:22.792799Z","signature_b64":"VNhrK6BZdl9BDrWz7rFWNqjeJuLAwrZGK+7bpgxIETaYznVS1ah0R48b6OoGHcTGvLnyQLuHPxHS9o2lqKHSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd0348d29e012949172658ce73df0a0778a2db5c46376c4adbb98069453e90b7","last_reissued_at":"2026-05-18T00:02:22.792171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:22.792171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1801","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:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jd7PBi1+I0D2WEY1JzM/jM/2RgUW8ltVSa/MsYbAUfZt7ipDLopqKvQ/MPGgKosxo7UqcFTF9RqtUen0wpZ8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:21:10.278845Z"},"content_sha256":"67f58e11e783047d8e06f7fab06f8257daff3b4d64e63373f1c1e4769a5665bd","schema_version":"1.0","event_id":"sha256:67f58e11e783047d8e06f7fab06f8257daff3b4d64e63373f1c1e4769a5665bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7UBURUU6AEUUSFZGLDHHHXYKA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs with two crossings are 5-choosable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Riste \\v{S}krekovski, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2011-03-09T15:17:58Z","abstract_excerpt":"A graph G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen's theorem states that every planar graph is 5-choosable. We extend the result by showing that every graph with at most two crossings is 5-choosable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1801","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:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDOSSrQm9b+ypFutz+T0V2u3A9MOnd8okbvaDnmatSTOa7xwnbbSR6eDMvUR8YaPv4nmtS3z8LCmuxxm7EdrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:21:10.279183Z"},"content_sha256":"2f1fce789399717b1de68b78cdaf5ea3c0a400e16b887c2d5d02918b8403dbcc","schema_version":"1.0","event_id":"sha256:2f1fce789399717b1de68b78cdaf5ea3c0a400e16b887c2d5d02918b8403dbcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/bundle.json","state_url":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/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-20T02:21:10Z","links":{"resolver":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5","bundle":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/bundle.json","state":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7UBURUU6AEUUSFZGLDHHHXYKA5","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":"1e0213b543e6a699b3803e062b6a306a0f42bb4036aaf1d3ed1edc9f408131f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-09T15:17:58Z","title_canon_sha256":"218fd52666e8ef517028cd24cb3ad37c70a21ab8d5a6f14aefe3dbd971175b80"},"schema_version":"1.0","source":{"id":"1103.1801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1801","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1801v1","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1801","created_at":"2026-05-18T00:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"7UBURUU6AEUU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7UBURUU6AEUUSFZG","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7UBURUU6","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:2f1fce789399717b1de68b78cdaf5ea3c0a400e16b887c2d5d02918b8403dbcc","target":"graph","created_at":"2026-05-18T00:02:22Z","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 G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen's theorem states that every planar graph is 5-choosable. We extend the result by showing that every graph with at most two crossings is 5-choosable.","authors_text":"Bernard Lidick\\'y, Riste \\v{S}krekovski, Zden\\v{e}k Dvo\\v{r}\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-09T15:17:58Z","title":"Graphs with two crossings are 5-choosable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1801","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:67f58e11e783047d8e06f7fab06f8257daff3b4d64e63373f1c1e4769a5665bd","target":"record","created_at":"2026-05-18T00:02:22Z","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":"1e0213b543e6a699b3803e062b6a306a0f42bb4036aaf1d3ed1edc9f408131f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-09T15:17:58Z","title_canon_sha256":"218fd52666e8ef517028cd24cb3ad37c70a21ab8d5a6f14aefe3dbd971175b80"},"schema_version":"1.0","source":{"id":"1103.1801","kind":"arxiv","version":1}},"canonical_sha256":"fd0348d29e012949172658ce73df0a0778a2db5c46376c4adbb98069453e90b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd0348d29e012949172658ce73df0a0778a2db5c46376c4adbb98069453e90b7","first_computed_at":"2026-05-18T00:02:22.792171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:22.792171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNhrK6BZdl9BDrWz7rFWNqjeJuLAwrZGK+7bpgxIETaYznVS1ah0R48b6OoGHcTGvLnyQLuHPxHS9o2lqKHSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:22.792799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67f58e11e783047d8e06f7fab06f8257daff3b4d64e63373f1c1e4769a5665bd","sha256:2f1fce789399717b1de68b78cdaf5ea3c0a400e16b887c2d5d02918b8403dbcc"],"state_sha256":"b26ee052f513760aba09715f7c2caf23de65ae34f71164b3d5e07c092ca9375e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpDZbXf+gesvvNbETGyM75JRZMf1qhKjq8AIW3dDwZi33qm3l1J1JAvZBOnaByzJnVtfl/s4vbglpMROu92dDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:21:10.281084Z","bundle_sha256":"2262d5cfa699cd4e9f3658c4d9b7839d27e784fa1defca8c2c5b7b42fe4aa8eb"}}