{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7UBURUU6AEUUSFZGLDHHHXYKA5","short_pith_number":"pith:7UBURUU6","schema_version":"1.0","canonical_sha256":"fd0348d29e012949172658ce73df0a0778a2db5c46376c4adbb98069453e90b7","source":{"kind":"arxiv","id":"1103.1801","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.1801","created_at":"2026-05-18T00:02:22.792255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1801v1","created_at":"2026-05-18T00:02:22.792255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1801","created_at":"2026-05-18T00:02:22.792255+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UBURUU6AEUU","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UBURUU6AEUUSFZG","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UBURUU6","created_at":"2026-05-18T12:26:22.705136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5","json":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5.json","graph_json":"https://pith.science/api/pith-number/7UBURUU6AEUUSFZGLDHHHXYKA5/graph.json","events_json":"https://pith.science/api/pith-number/7UBURUU6AEUUSFZGLDHHHXYKA5/events.json","paper":"https://pith.science/paper/7UBURUU6"},"agent_actions":{"view_html":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5","download_json":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5.json","view_paper":"https://pith.science/paper/7UBURUU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1801&json=true","fetch_graph":"https://pith.science/api/pith-number/7UBURUU6AEUUSFZGLDHHHXYKA5/graph.json","fetch_events":"https://pith.science/api/pith-number/7UBURUU6AEUUSFZGLDHHHXYKA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/action/storage_attestation","attest_author":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/action/author_attestation","sign_citation":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/action/citation_signature","submit_replication":"https://pith.science/pith/7UBURUU6AEUUSFZGLDHHHXYKA5/action/replication_record"}},"created_at":"2026-05-18T00:02:22.792255+00:00","updated_at":"2026-05-18T00:02:22.792255+00:00"}