{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4ZMGRDFZIRAOCLYKHWH2JX7PKM","short_pith_number":"pith:4ZMGRDFZ","schema_version":"1.0","canonical_sha256":"e658688cb94440e12f0a3d8fa4dfef53082142fc8ca8b7dfb45478e2828f5076","source":{"kind":"arxiv","id":"2002.02729","version":1},"attestation_state":"computed","paper":{"title":"On List k-Coloring Convex Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Josep D\\'iaz, Maria Serna, Oriol Serra, \\\"Oznur Ya\\c{s}ar Diner","submitted_at":"2020-02-07T12:06:41Z","abstract_excerpt":"List k-Coloring (Li k-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..,k}. The problem is known to be NP-hard even for k=3 within the class of 3-regular planar bipartite graphs and for k=4 within the class of chordal bipartite graphs. In 2015, Huang, Johnson and Paulusma asked for the complexity of Li 3-Col in the class of chordal bipartite graphs. In this paper we give a partial answer to this question by showing that Li k-Col is polynomial in the class of convex bipartite graphs. We sh"},"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":"2002.02729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-02-07T12:06:41Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"d78e8525e845d2f7b4d621dec7e880f70a3297fb50e6f033fd0586abea84306f","abstract_canon_sha256":"e1f42387f7569be542f384226edf0fd964e3ffc16aaa5974504a532c9d3c170d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:58.393469Z","signature_b64":"RWHnVx/pBD9Chqi1cVGJ1U3A3cLOisuhh2WzPfhh5KkQY04wfkbfJsU3Ec0rWTO9xt0skaIzMHgUxInDHGdYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e658688cb94440e12f0a3d8fa4dfef53082142fc8ca8b7dfb45478e2828f5076","last_reissued_at":"2026-07-05T00:38:58.392999Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:58.392999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On List k-Coloring Convex Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Josep D\\'iaz, Maria Serna, Oriol Serra, \\\"Oznur Ya\\c{s}ar Diner","submitted_at":"2020-02-07T12:06:41Z","abstract_excerpt":"List k-Coloring (Li k-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..,k}. The problem is known to be NP-hard even for k=3 within the class of 3-regular planar bipartite graphs and for k=4 within the class of chordal bipartite graphs. In 2015, Huang, Johnson and Paulusma asked for the complexity of Li 3-Col in the class of chordal bipartite graphs. In this paper we give a partial answer to this question by showing that Li k-Col is polynomial in the class of convex bipartite graphs. We sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02729","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.02729/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2002.02729","created_at":"2026-07-05T00:38:58.393056+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.02729v1","created_at":"2026-07-05T00:38:58.393056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02729","created_at":"2026-07-05T00:38:58.393056+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZMGRDFZIRAO","created_at":"2026-07-05T00:38:58.393056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZMGRDFZIRAOCLYK","created_at":"2026-07-05T00:38:58.393056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZMGRDFZ","created_at":"2026-07-05T00:38:58.393056+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/4ZMGRDFZIRAOCLYKHWH2JX7PKM","json":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM.json","graph_json":"https://pith.science/api/pith-number/4ZMGRDFZIRAOCLYKHWH2JX7PKM/graph.json","events_json":"https://pith.science/api/pith-number/4ZMGRDFZIRAOCLYKHWH2JX7PKM/events.json","paper":"https://pith.science/paper/4ZMGRDFZ"},"agent_actions":{"view_html":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM","download_json":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM.json","view_paper":"https://pith.science/paper/4ZMGRDFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.02729&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZMGRDFZIRAOCLYKHWH2JX7PKM/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZMGRDFZIRAOCLYKHWH2JX7PKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/action/storage_attestation","attest_author":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/action/author_attestation","sign_citation":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/action/citation_signature","submit_replication":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/action/replication_record"}},"created_at":"2026-07-05T00:38:58.393056+00:00","updated_at":"2026-07-05T00:38:58.393056+00:00"}