{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DIIGB2LKQXRYMRTGX573J5FYBX","short_pith_number":"pith:DIIGB2LK","schema_version":"1.0","canonical_sha256":"1a1060e96a85e3864666bf7fb4f4b80dcf8beebd55cc0cc01fa67fb82691a52b","source":{"kind":"arxiv","id":"1201.3014","version":3},"attestation_state":"computed","paper":{"title":"5-choosability of graphs with crossings far apart","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidicky, Bojan Mohar, Zdenek Dvorak","submitted_at":"2012-01-14T14:05:52Z","abstract_excerpt":"We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings is at least 15 is 5-choosable. At the same time we may allow some vertices to have lists of size four only, as long as they are far apart and far from the crossings."},"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":"1201.3014","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-14T14:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"c746c0bbacd8649cf4f401093c43a3282533923b658825d3bb5f7f368bcde2bb","abstract_canon_sha256":"8d5a3a2fb1c713f92782f5248848eaa05d4edf570deba7ca67a784560ba9897c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.501917Z","signature_b64":"WaIJJMi7bsuYGA6HmjsdEjEe/ARK2/qyblxuIXUiKCnhsQwuGzRGbbI+WgXsmjNxtBw31o8vDTVQz/y5Sq8xBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a1060e96a85e3864666bf7fb4f4b80dcf8beebd55cc0cc01fa67fb82691a52b","last_reissued_at":"2026-05-18T00:54:58.501211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.501211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"5-choosability of graphs with crossings far apart","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidicky, Bojan Mohar, Zdenek Dvorak","submitted_at":"2012-01-14T14:05:52Z","abstract_excerpt":"We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings is at least 15 is 5-choosable. At the same time we may allow some vertices to have lists of size four only, as long as they are far apart and far from the crossings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3014","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.3014","created_at":"2026-05-18T00:54:58.501334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3014v3","created_at":"2026-05-18T00:54:58.501334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3014","created_at":"2026-05-18T00:54:58.501334+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIIGB2LKQXRY","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIIGB2LKQXRYMRTG","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIIGB2LK","created_at":"2026-05-18T12:27:04.183437+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/DIIGB2LKQXRYMRTGX573J5FYBX","json":"https://pith.science/pith/DIIGB2LKQXRYMRTGX573J5FYBX.json","graph_json":"https://pith.science/api/pith-number/DIIGB2LKQXRYMRTGX573J5FYBX/graph.json","events_json":"https://pith.science/api/pith-number/DIIGB2LKQXRYMRTGX573J5FYBX/events.json","paper":"https://pith.science/paper/DIIGB2LK"},"agent_actions":{"view_html":"https://pith.science/pith/DIIGB2LKQXRYMRTGX573J5FYBX","download_json":"https://pith.science/pith/DIIGB2LKQXRYMRTGX573J5FYBX.json","view_paper":"https://pith.science/paper/DIIGB2LK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3014&json=true","fetch_graph":"https://pith.science/api/pith-number/DIIGB2LKQXRYMRTGX573J5FYBX/graph.json","fetch_events":"https://pith.science/api/pith-number/DIIGB2LKQXRYMRTGX573J5FYBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIIGB2LKQXRYMRTGX573J5FYBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIIGB2LKQXRYMRTGX573J5FYBX/action/storage_attestation","attest_author":"https://pith.science/pith/DIIGB2LKQXRYMRTGX573J5FYBX/action/author_attestation","sign_citation":"https://pith.science/pith/DIIGB2LKQXRYMRTGX573J5FYBX/action/citation_signature","submit_replication":"https://pith.science/pith/DIIGB2LKQXRYMRTGX573J5FYBX/action/replication_record"}},"created_at":"2026-05-18T00:54:58.501334+00:00","updated_at":"2026-05-18T00:54:58.501334+00:00"}