{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RBBHIOR7AQGRGNIXG27U3SEZB4","short_pith_number":"pith:RBBHIOR7","schema_version":"1.0","canonical_sha256":"8842743a3f040d13351736bf4dc8990f3330983313a4e86c1063d9c3c48a5668","source":{"kind":"arxiv","id":"1808.02018","version":2},"attestation_state":"computed","paper":{"title":"A Note on the Equitable Choosability of Complete Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ezekiel Thornburgh, Isaac Kadera, Jeffrey A. Mudrock, Madelynn Chase, Tim Wagstrom","submitted_at":"2018-08-04T18:21:52Z","abstract_excerpt":"In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A $k$-assignment, $L$, for a graph $G$ assigns a list, $L(v)$, of $k$ available colors to each $v \\in V(G)$, and an equitable $L$-coloring of $G$ is a proper coloring, $f$, of $G$ such that $f(v) \\in L(v)$ for each $v \\in V(G)$ and each color class of $f$ has size at most $\\lceil |V(G)|/k \\rceil$. Graph $G$ is said to be equitably $k$-choosable if an equitable $L$-coloring of $G$ exists whenever $L$ is a $k$-assignment for $G$. In this note we study the equitable choosability "},"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":"1808.02018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-04T18:21:52Z","cross_cats_sorted":[],"title_canon_sha256":"c831db0e3f061a4c70cd0a8760b5224a69e67264caba030d710baad848e5b1d0","abstract_canon_sha256":"086f4d4cfbac37f5653dcb1bdd1444d25b86a4316c2f31ea0787e2f76c2e4616"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:35.095900Z","signature_b64":"gDbZMIhU0L2+TJBROQZcTH1L4oRukcI0VUQH0OM5hkUPT4rlW1V3thzhZhjzuIts6ku3ulvsFStQJ5iDpddcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8842743a3f040d13351736bf4dc8990f3330983313a4e86c1063d9c3c48a5668","last_reissued_at":"2026-05-17T23:56:35.095243Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:35.095243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Equitable Choosability of Complete Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ezekiel Thornburgh, Isaac Kadera, Jeffrey A. Mudrock, Madelynn Chase, Tim Wagstrom","submitted_at":"2018-08-04T18:21:52Z","abstract_excerpt":"In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A $k$-assignment, $L$, for a graph $G$ assigns a list, $L(v)$, of $k$ available colors to each $v \\in V(G)$, and an equitable $L$-coloring of $G$ is a proper coloring, $f$, of $G$ such that $f(v) \\in L(v)$ for each $v \\in V(G)$ and each color class of $f$ has size at most $\\lceil |V(G)|/k \\rceil$. Graph $G$ is said to be equitably $k$-choosable if an equitable $L$-coloring of $G$ exists whenever $L$ is a $k$-assignment for $G$. In this note we study the equitable choosability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02018","kind":"arxiv","version":2},"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":"1808.02018","created_at":"2026-05-17T23:56:35.095336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02018v2","created_at":"2026-05-17T23:56:35.095336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02018","created_at":"2026-05-17T23:56:35.095336+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBBHIOR7AQGR","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBBHIOR7AQGRGNIX","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBBHIOR7","created_at":"2026-05-18T12:32:50.500415+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/RBBHIOR7AQGRGNIXG27U3SEZB4","json":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4.json","graph_json":"https://pith.science/api/pith-number/RBBHIOR7AQGRGNIXG27U3SEZB4/graph.json","events_json":"https://pith.science/api/pith-number/RBBHIOR7AQGRGNIXG27U3SEZB4/events.json","paper":"https://pith.science/paper/RBBHIOR7"},"agent_actions":{"view_html":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4","download_json":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4.json","view_paper":"https://pith.science/paper/RBBHIOR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02018&json=true","fetch_graph":"https://pith.science/api/pith-number/RBBHIOR7AQGRGNIXG27U3SEZB4/graph.json","fetch_events":"https://pith.science/api/pith-number/RBBHIOR7AQGRGNIXG27U3SEZB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/action/storage_attestation","attest_author":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/action/author_attestation","sign_citation":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/action/citation_signature","submit_replication":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/action/replication_record"}},"created_at":"2026-05-17T23:56:35.095336+00:00","updated_at":"2026-05-17T23:56:35.095336+00:00"}