{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RBBHIOR7AQGRGNIXG27U3SEZB4","short_pith_number":"pith:RBBHIOR7","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"},"canonical_sha256":"8842743a3f040d13351736bf4dc8990f3330983313a4e86c1063d9c3c48a5668","source":{"kind":"arxiv","id":"1808.02018","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02018","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02018v2","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02018","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"RBBHIOR7AQGR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RBBHIOR7AQGRGNIX","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RBBHIOR7","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RBBHIOR7AQGRGNIXG27U3SEZB4","target":"record","payload":{"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"},"canonical_sha256":"8842743a3f040d13351736bf4dc8990f3330983313a4e86c1063d9c3c48a5668","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"},"source_kind":"arxiv","source_id":"1808.02018","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7axPziDY0fdbUW1qj6Kf/xBpKwAs0hZBhDEBlCtTFyT1nNlwtYR8ZP7dnZK0PTFxFHPowuQ+oKsszkGH9vaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:24:10.691888Z"},"content_sha256":"cebd499926b494c0a9fe3bfa1cebc4de2339ef9a083d544f1165c91b7055de65","schema_version":"1.0","event_id":"sha256:cebd499926b494c0a9fe3bfa1cebc4de2339ef9a083d544f1165c91b7055de65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RBBHIOR7AQGRGNIXG27U3SEZB4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+yGldfqfnwjSDGjLrkBBQRXab6zIwBSOzX96ExIUXI75KYn7hZEDEvOFQP+oOXkf3tG4VgBqB/9MqvvOngCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:24:10.692233Z"},"content_sha256":"c91e9c92ff8ceab66d548935c2d737fc874d561491889e29dc1d1d8ed14a35f6","schema_version":"1.0","event_id":"sha256:c91e9c92ff8ceab66d548935c2d737fc874d561491889e29dc1d1d8ed14a35f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/bundle.json","state_url":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T18:24:10Z","links":{"resolver":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4","bundle":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/bundle.json","state":"https://pith.science/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBBHIOR7AQGRGNIXG27U3SEZB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RBBHIOR7AQGRGNIXG27U3SEZB4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"086f4d4cfbac37f5653dcb1bdd1444d25b86a4316c2f31ea0787e2f76c2e4616","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-04T18:21:52Z","title_canon_sha256":"c831db0e3f061a4c70cd0a8760b5224a69e67264caba030d710baad848e5b1d0"},"schema_version":"1.0","source":{"id":"1808.02018","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02018","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02018v2","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02018","created_at":"2026-05-17T23:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"RBBHIOR7AQGR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RBBHIOR7AQGRGNIX","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RBBHIOR7","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:c91e9c92ff8ceab66d548935c2d737fc874d561491889e29dc1d1d8ed14a35f6","target":"graph","created_at":"2026-05-17T23:56:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Ezekiel Thornburgh, Isaac Kadera, Jeffrey A. Mudrock, Madelynn Chase, Tim Wagstrom","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-04T18:21:52Z","title":"A Note on the Equitable Choosability of Complete Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02018","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cebd499926b494c0a9fe3bfa1cebc4de2339ef9a083d544f1165c91b7055de65","target":"record","created_at":"2026-05-17T23:56:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"086f4d4cfbac37f5653dcb1bdd1444d25b86a4316c2f31ea0787e2f76c2e4616","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-04T18:21:52Z","title_canon_sha256":"c831db0e3f061a4c70cd0a8760b5224a69e67264caba030d710baad848e5b1d0"},"schema_version":"1.0","source":{"id":"1808.02018","kind":"arxiv","version":2}},"canonical_sha256":"8842743a3f040d13351736bf4dc8990f3330983313a4e86c1063d9c3c48a5668","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8842743a3f040d13351736bf4dc8990f3330983313a4e86c1063d9c3c48a5668","first_computed_at":"2026-05-17T23:56:35.095243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:35.095243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gDbZMIhU0L2+TJBROQZcTH1L4oRukcI0VUQH0OM5hkUPT4rlW1V3thzhZhjzuIts6ku3ulvsFStQJ5iDpddcDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:35.095900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02018","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cebd499926b494c0a9fe3bfa1cebc4de2339ef9a083d544f1165c91b7055de65","sha256:c91e9c92ff8ceab66d548935c2d737fc874d561491889e29dc1d1d8ed14a35f6"],"state_sha256":"b1ed28051d50d1d4881621db335b3c2781d09f989e476388a54880cfe3c4086b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOaNZNGA/1PxE742+YuqFtnwhKsMzupuqsVqTW1BhBCvz4FToTqEj5xTkbc3p064cvHC9Dv5emrZhvymUi53Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:24:10.694192Z","bundle_sha256":"5e93aa10cc34283e8193aef1bdc530ebea35137092fb37481cd1e29504ff51b0"}}