{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4ZMGRDFZIRAOCLYKHWH2JX7PKM","short_pith_number":"pith:4ZMGRDFZ","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"},"canonical_sha256":"e658688cb94440e12f0a3d8fa4dfef53082142fc8ca8b7dfb45478e2828f5076","source":{"kind":"arxiv","id":"2002.02729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02729","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02729v1","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02729","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"pith_short_12","alias_value":"4ZMGRDFZIRAO","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ZMGRDFZIRAOCLYK","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ZMGRDFZ","created_at":"2026-07-05T00:38:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4ZMGRDFZIRAOCLYKHWH2JX7PKM","target":"record","payload":{"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"},"canonical_sha256":"e658688cb94440e12f0a3d8fa4dfef53082142fc8ca8b7dfb45478e2828f5076","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"},"source_kind":"arxiv","source_id":"2002.02729","source_version":1,"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-07-05T00:38:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJ8hzHyJ0pfcXR7ELbagH+oN3stW5jKQXG71bo5PGsJ6wpwr94kVgQI4e9OO+KNG+LsCGU9ssCG+Ec7lYYEBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:23:10.395897Z"},"content_sha256":"054ffa5ec16a58b6f6ef1aada6855b4dc187bdb2b0d812745c8295f542fc4d12","schema_version":"1.0","event_id":"sha256:054ffa5ec16a58b6f6ef1aada6855b4dc187bdb2b0d812745c8295f542fc4d12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4ZMGRDFZIRAOCLYKHWH2JX7PKM","target":"graph","payload":{"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"},"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-07-05T00:38:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mW/1ZfQBM9pSkt3SasCkiKCb6h94EbYkIgteRI9rN3Q+JkwVzjwc3r/NUl7VoetXZsQPhhHFOfeCiq7kpS71Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:23:10.396265Z"},"content_sha256":"191b9f8f66301705c443d33cc81f7cd5c1ae3709f7cb94a5d1039ef7ca056776","schema_version":"1.0","event_id":"sha256:191b9f8f66301705c443d33cc81f7cd5c1ae3709f7cb94a5d1039ef7ca056776"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/bundle.json","state_url":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/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-07-07T03:23:10Z","links":{"resolver":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM","bundle":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/bundle.json","state":"https://pith.science/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZMGRDFZIRAOCLYKHWH2JX7PKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4ZMGRDFZIRAOCLYKHWH2JX7PKM","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":"e1f42387f7569be542f384226edf0fd964e3ffc16aaa5974504a532c9d3c170d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-02-07T12:06:41Z","title_canon_sha256":"d78e8525e845d2f7b4d621dec7e880f70a3297fb50e6f033fd0586abea84306f"},"schema_version":"1.0","source":{"id":"2002.02729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02729","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02729v1","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02729","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"pith_short_12","alias_value":"4ZMGRDFZIRAO","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ZMGRDFZIRAOCLYK","created_at":"2026-07-05T00:38:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ZMGRDFZ","created_at":"2026-07-05T00:38:58Z"}],"graph_snapshots":[{"event_id":"sha256:191b9f8f66301705c443d33cc81f7cd5c1ae3709f7cb94a5d1039ef7ca056776","target":"graph","created_at":"2026-07-05T00:38:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.02729/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Josep D\\'iaz, Maria Serna, Oriol Serra, \\\"Oznur Ya\\c{s}ar Diner","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-02-07T12:06:41Z","title":"On List k-Coloring Convex Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02729","kind":"arxiv","version":1},"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:054ffa5ec16a58b6f6ef1aada6855b4dc187bdb2b0d812745c8295f542fc4d12","target":"record","created_at":"2026-07-05T00:38:58Z","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":"e1f42387f7569be542f384226edf0fd964e3ffc16aaa5974504a532c9d3c170d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-02-07T12:06:41Z","title_canon_sha256":"d78e8525e845d2f7b4d621dec7e880f70a3297fb50e6f033fd0586abea84306f"},"schema_version":"1.0","source":{"id":"2002.02729","kind":"arxiv","version":1}},"canonical_sha256":"e658688cb94440e12f0a3d8fa4dfef53082142fc8ca8b7dfb45478e2828f5076","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e658688cb94440e12f0a3d8fa4dfef53082142fc8ca8b7dfb45478e2828f5076","first_computed_at":"2026-07-05T00:38:58.392999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:38:58.392999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RWHnVx/pBD9Chqi1cVGJ1U3A3cLOisuhh2WzPfhh5KkQY04wfkbfJsU3Ec0rWTO9xt0skaIzMHgUxInDHGdYAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:38:58.393469Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.02729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:054ffa5ec16a58b6f6ef1aada6855b4dc187bdb2b0d812745c8295f542fc4d12","sha256:191b9f8f66301705c443d33cc81f7cd5c1ae3709f7cb94a5d1039ef7ca056776"],"state_sha256":"bdd9a82d9a3f54d77878a86e9d890cfca8cb8b2f71ec24e042355a362986fa20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chDbxOA6uDSd4FBqKPp/eg2Xuw4FaTg3MaGCoakiMEHjjFyOfcu3P0+0kHwtRMifEmuhVEKhQlN+mDbyOSLPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T03:23:10.398254Z","bundle_sha256":"7c86aeb9832a9dfa727697948c12c07b735afe5f37a51223bc3a77028621846d"}}