{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6D4AEW3AOXJCXNBOPNZIDO4TIR","short_pith_number":"pith:6D4AEW3A","schema_version":"1.0","canonical_sha256":"f0f8025b6075d22bb42e7b7281bb9344537aa9ff0d20d270bb0d72d3b7a46187","source":{"kind":"arxiv","id":"1806.06966","version":1},"attestation_state":"computed","paper":{"title":"Proportional Choosability: A New List Analogue of Equitable Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer","submitted_at":"2018-06-18T22:10:24Z","abstract_excerpt":"In 2003, Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. In this paper, we motivate and define a new list analogue of equitable coloring called proportional choosability. A $k$-assignment $L$ for a graph $G$ specifies a list $L(v)$ of $k$ available colors for each vertex $v$ of $G$. An $L$-coloring assigns a color to each vertex $v$ from its list $L(v)$. For each color $c$, let $\\eta(c)$ be the number of vertices $v$ whose list $L(v)$ contains $c$. A proportional $L$-coloring of $G$ is a proper $L$-coloring in which each color $c \\"},"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":"1806.06966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-18T22:10:24Z","cross_cats_sorted":[],"title_canon_sha256":"fbb07d79730750b3cf09200825dab09e8a34b65c00da5a2b124a67d0667d1ada","abstract_canon_sha256":"0a64ca700aae8693718bc689df420779bf269e001a6c8301828c8aa5479a1834"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:57.928963Z","signature_b64":"vl31nkYy9m/5MCM/BJgYN31rAtnhUzpFCjyUTewsI9cDmPV76H0JW0jj/M+De1iqwHT6jhU8Jno/dWf72SFBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f8025b6075d22bb42e7b7281bb9344537aa9ff0d20d270bb0d72d3b7a46187","last_reissued_at":"2026-05-18T00:12:57.928402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:57.928402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proportional Choosability: A New List Analogue of Equitable Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Reiniger, Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer","submitted_at":"2018-06-18T22:10:24Z","abstract_excerpt":"In 2003, Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. In this paper, we motivate and define a new list analogue of equitable coloring called proportional choosability. A $k$-assignment $L$ for a graph $G$ specifies a list $L(v)$ of $k$ available colors for each vertex $v$ of $G$. An $L$-coloring assigns a color to each vertex $v$ from its list $L(v)$. For each color $c$, let $\\eta(c)$ be the number of vertices $v$ whose list $L(v)$ contains $c$. A proportional $L$-coloring of $G$ is a proper $L$-coloring in which each color $c \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06966","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":"1806.06966","created_at":"2026-05-18T00:12:57.928471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06966v1","created_at":"2026-05-18T00:12:57.928471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06966","created_at":"2026-05-18T00:12:57.928471+00:00"},{"alias_kind":"pith_short_12","alias_value":"6D4AEW3AOXJC","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6D4AEW3AOXJCXNBO","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6D4AEW3A","created_at":"2026-05-18T12:32:08.215937+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/6D4AEW3AOXJCXNBOPNZIDO4TIR","json":"https://pith.science/pith/6D4AEW3AOXJCXNBOPNZIDO4TIR.json","graph_json":"https://pith.science/api/pith-number/6D4AEW3AOXJCXNBOPNZIDO4TIR/graph.json","events_json":"https://pith.science/api/pith-number/6D4AEW3AOXJCXNBOPNZIDO4TIR/events.json","paper":"https://pith.science/paper/6D4AEW3A"},"agent_actions":{"view_html":"https://pith.science/pith/6D4AEW3AOXJCXNBOPNZIDO4TIR","download_json":"https://pith.science/pith/6D4AEW3AOXJCXNBOPNZIDO4TIR.json","view_paper":"https://pith.science/paper/6D4AEW3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06966&json=true","fetch_graph":"https://pith.science/api/pith-number/6D4AEW3AOXJCXNBOPNZIDO4TIR/graph.json","fetch_events":"https://pith.science/api/pith-number/6D4AEW3AOXJCXNBOPNZIDO4TIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6D4AEW3AOXJCXNBOPNZIDO4TIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6D4AEW3AOXJCXNBOPNZIDO4TIR/action/storage_attestation","attest_author":"https://pith.science/pith/6D4AEW3AOXJCXNBOPNZIDO4TIR/action/author_attestation","sign_citation":"https://pith.science/pith/6D4AEW3AOXJCXNBOPNZIDO4TIR/action/citation_signature","submit_replication":"https://pith.science/pith/6D4AEW3AOXJCXNBOPNZIDO4TIR/action/replication_record"}},"created_at":"2026-05-18T00:12:57.928471+00:00","updated_at":"2026-05-18T00:12:57.928471+00:00"}