{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PONEVYH2K5X2QCPFXAJR2A7F7S","short_pith_number":"pith:PONEVYH2","schema_version":"1.0","canonical_sha256":"7b9a4ae0fa576fa809e5b8131d03e5fca6e17785186842355b26088615d777cb","source":{"kind":"arxiv","id":"1105.2532","version":1},"attestation_state":"computed","paper":{"title":"List colorings of $K_5$-minor-free graphs with special list assignments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anja Pruchnewski, Daniel W. Cranston, Margit Voigt, Zsolt Tuza","submitted_at":"2011-05-12T17:14:57Z","abstract_excerpt":"A {\\it list assignment} $L$ of a graph $G$ is a function that assigns a set (list) $L(v)$ of colors to every vertex $v$ of $G$. Graph $G$ is called {\\it $L$-list colorable} if it admits a vertex coloring $\\phi$ such that $\\phi(v)\\in L(v)$ for all $v\\in V(G)$ and $\\phi(v)\\not=\\phi(w)$ for all $vw\\in E(G)$.\n  The following question was raised by Bruce Richter. Let $G$ be a planar, 3-connected graph that is not a complete graph. Denoting by $d(v)$ the degree of vertex $v$, is $G$ $L$-list colorable for every list assignment $L$ with $|L(v)|=\\min \\{d(v), 6\\}$ for all $v\\in V(G)$?\n  More generally,"},"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":"1105.2532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-12T17:14:57Z","cross_cats_sorted":[],"title_canon_sha256":"b43db65bc215a35dba93ab75b964be69ba808cbd8aa1cc8b4b3cbcf11c48f6ea","abstract_canon_sha256":"98a0994eb2afbeea224104a3c6e3b621d02e582f95fdf1ac0ed6f5407e289a96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:02.585459Z","signature_b64":"YhoDAqzd2rxKdEqtz3FDfq7tJ7IEp+SBNNqgS8qtEXj2C5TIh4BKeqfHCrATjKEv1SjzwRumT6kY5G8Z2pACAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b9a4ae0fa576fa809e5b8131d03e5fca6e17785186842355b26088615d777cb","last_reissued_at":"2026-05-18T03:41:02.584886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:02.584886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List colorings of $K_5$-minor-free graphs with special list assignments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anja Pruchnewski, Daniel W. Cranston, Margit Voigt, Zsolt Tuza","submitted_at":"2011-05-12T17:14:57Z","abstract_excerpt":"A {\\it list assignment} $L$ of a graph $G$ is a function that assigns a set (list) $L(v)$ of colors to every vertex $v$ of $G$. Graph $G$ is called {\\it $L$-list colorable} if it admits a vertex coloring $\\phi$ such that $\\phi(v)\\in L(v)$ for all $v\\in V(G)$ and $\\phi(v)\\not=\\phi(w)$ for all $vw\\in E(G)$.\n  The following question was raised by Bruce Richter. Let $G$ be a planar, 3-connected graph that is not a complete graph. Denoting by $d(v)$ the degree of vertex $v$, is $G$ $L$-list colorable for every list assignment $L$ with $|L(v)|=\\min \\{d(v), 6\\}$ for all $v\\in V(G)$?\n  More generally,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2532","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":"1105.2532","created_at":"2026-05-18T03:41:02.584980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2532v1","created_at":"2026-05-18T03:41:02.584980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2532","created_at":"2026-05-18T03:41:02.584980+00:00"},{"alias_kind":"pith_short_12","alias_value":"PONEVYH2K5X2","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PONEVYH2K5X2QCPF","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PONEVYH2","created_at":"2026-05-18T12:26:39.201973+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/PONEVYH2K5X2QCPFXAJR2A7F7S","json":"https://pith.science/pith/PONEVYH2K5X2QCPFXAJR2A7F7S.json","graph_json":"https://pith.science/api/pith-number/PONEVYH2K5X2QCPFXAJR2A7F7S/graph.json","events_json":"https://pith.science/api/pith-number/PONEVYH2K5X2QCPFXAJR2A7F7S/events.json","paper":"https://pith.science/paper/PONEVYH2"},"agent_actions":{"view_html":"https://pith.science/pith/PONEVYH2K5X2QCPFXAJR2A7F7S","download_json":"https://pith.science/pith/PONEVYH2K5X2QCPFXAJR2A7F7S.json","view_paper":"https://pith.science/paper/PONEVYH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2532&json=true","fetch_graph":"https://pith.science/api/pith-number/PONEVYH2K5X2QCPFXAJR2A7F7S/graph.json","fetch_events":"https://pith.science/api/pith-number/PONEVYH2K5X2QCPFXAJR2A7F7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PONEVYH2K5X2QCPFXAJR2A7F7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PONEVYH2K5X2QCPFXAJR2A7F7S/action/storage_attestation","attest_author":"https://pith.science/pith/PONEVYH2K5X2QCPFXAJR2A7F7S/action/author_attestation","sign_citation":"https://pith.science/pith/PONEVYH2K5X2QCPFXAJR2A7F7S/action/citation_signature","submit_replication":"https://pith.science/pith/PONEVYH2K5X2QCPFXAJR2A7F7S/action/replication_record"}},"created_at":"2026-05-18T03:41:02.584980+00:00","updated_at":"2026-05-18T03:41:02.584980+00:00"}