{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZGVKJAIDD33QXCJCMYX4QZHKO6","short_pith_number":"pith:ZGVKJAID","canonical_record":{"source":{"id":"1601.01768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-08T04:20:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"736c1e87a0fa2f67fe3970eed9273e891db80e7ef6c86a89b5f491defd475421","abstract_canon_sha256":"add955f88c75ccdf6d6a2b8ab7cf78122765fdfecbdaab85476a668f2ffd776a"},"schema_version":"1.0"},"canonical_sha256":"c9aaa481031ef70b8922662fc864ea7791dfcbbc41e2abf91abc6b30c7fb477b","source":{"kind":"arxiv","id":"1601.01768","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01768","created_at":"2026-05-18T00:38:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01768v2","created_at":"2026-05-18T00:38:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01768","created_at":"2026-05-18T00:38:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZGVKJAIDD33Q","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZGVKJAIDD33QXCJC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZGVKJAID","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZGVKJAIDD33QXCJCMYX4QZHKO6","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-08T04:20:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"736c1e87a0fa2f67fe3970eed9273e891db80e7ef6c86a89b5f491defd475421","abstract_canon_sha256":"add955f88c75ccdf6d6a2b8ab7cf78122765fdfecbdaab85476a668f2ffd776a"},"schema_version":"1.0"},"canonical_sha256":"c9aaa481031ef70b8922662fc864ea7791dfcbbc41e2abf91abc6b30c7fb477b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:13.976667Z","signature_b64":"wEEOb9YrCaP8+//DduTu3KK4moAo4VA7MTsEPEQv6dXkRJKjS+z89F3d9FkFRCLGqsHJ8R/U+xJUMfTiHAXWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9aaa481031ef70b8922662fc864ea7791dfcbbc41e2abf91abc6b30c7fb477b","last_reissued_at":"2026-05-18T00:38:13.976039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:13.976039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01768","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-18T00:38:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGwQVhYB2hmDnFlZFk46+aoFC++zyzpustqBjj8da5J/Ew3A2e52DnWgZM1Mcne8L2zKUZMymaJzbwMam122Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:23:57.340977Z"},"content_sha256":"b454ffe116c07435d793a1b33cd89b410c8499fd7d4d51f99c314edaac6fd311","schema_version":"1.0","event_id":"sha256:b454ffe116c07435d793a1b33cd89b410c8499fd7d4d51f99c314edaac6fd311"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZGVKJAIDD33QXCJCMYX4QZHKO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of choosability with a small palette of colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Dominique de Werra, Marc Demange","submitted_at":"2016-01-08T04:20:56Z","abstract_excerpt":"A graph is $\\ell$-choosable if, for any choice of lists of $\\ell$ colors for each vertex, there is a list coloring, which is a coloring where each vertex receives a color from its list. We study complexity issues of choosability of graphs when the number $k$ of colors is limited. We get results which differ surprisingly from the usual case where $k$ is implicit and which extend known results for the usual case. We also exhibit some classes of graphs (defined by structural properties of their blocks) which are choosable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01768","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-18T00:38:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+m6ENDJfqpnbnV8Z8AQ5+vzEivAMX+ICibDh2AiclPHEonIQvkzG6jJI+WZ0zWF437PwZYMdOFQ1AtBFu2KmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:23:57.341613Z"},"content_sha256":"c8f9f053cd6a84ecd8005d40cf72b4428266edd6c8e7ce6c46555b386371ab06","schema_version":"1.0","event_id":"sha256:c8f9f053cd6a84ecd8005d40cf72b4428266edd6c8e7ce6c46555b386371ab06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGVKJAIDD33QXCJCMYX4QZHKO6/bundle.json","state_url":"https://pith.science/pith/ZGVKJAIDD33QXCJCMYX4QZHKO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGVKJAIDD33QXCJCMYX4QZHKO6/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-05-28T14:23:57Z","links":{"resolver":"https://pith.science/pith/ZGVKJAIDD33QXCJCMYX4QZHKO6","bundle":"https://pith.science/pith/ZGVKJAIDD33QXCJCMYX4QZHKO6/bundle.json","state":"https://pith.science/pith/ZGVKJAIDD33QXCJCMYX4QZHKO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGVKJAIDD33QXCJCMYX4QZHKO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZGVKJAIDD33QXCJCMYX4QZHKO6","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":"add955f88c75ccdf6d6a2b8ab7cf78122765fdfecbdaab85476a668f2ffd776a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-08T04:20:56Z","title_canon_sha256":"736c1e87a0fa2f67fe3970eed9273e891db80e7ef6c86a89b5f491defd475421"},"schema_version":"1.0","source":{"id":"1601.01768","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01768","created_at":"2026-05-18T00:38:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01768v2","created_at":"2026-05-18T00:38:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01768","created_at":"2026-05-18T00:38:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZGVKJAIDD33Q","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZGVKJAIDD33QXCJC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZGVKJAID","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:c8f9f053cd6a84ecd8005d40cf72b4428266edd6c8e7ce6c46555b386371ab06","target":"graph","created_at":"2026-05-18T00:38:13Z","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":"A graph is $\\ell$-choosable if, for any choice of lists of $\\ell$ colors for each vertex, there is a list coloring, which is a coloring where each vertex receives a color from its list. We study complexity issues of choosability of graphs when the number $k$ of colors is limited. We get results which differ surprisingly from the usual case where $k$ is implicit and which extend known results for the usual case. We also exhibit some classes of graphs (defined by structural properties of their blocks) which are choosable.","authors_text":"Dominique de Werra, Marc Demange","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-08T04:20:56Z","title":"Complexity of choosability with a small palette of colors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01768","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:b454ffe116c07435d793a1b33cd89b410c8499fd7d4d51f99c314edaac6fd311","target":"record","created_at":"2026-05-18T00:38:13Z","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":"add955f88c75ccdf6d6a2b8ab7cf78122765fdfecbdaab85476a668f2ffd776a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-08T04:20:56Z","title_canon_sha256":"736c1e87a0fa2f67fe3970eed9273e891db80e7ef6c86a89b5f491defd475421"},"schema_version":"1.0","source":{"id":"1601.01768","kind":"arxiv","version":2}},"canonical_sha256":"c9aaa481031ef70b8922662fc864ea7791dfcbbc41e2abf91abc6b30c7fb477b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9aaa481031ef70b8922662fc864ea7791dfcbbc41e2abf91abc6b30c7fb477b","first_computed_at":"2026-05-18T00:38:13.976039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:13.976039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wEEOb9YrCaP8+//DduTu3KK4moAo4VA7MTsEPEQv6dXkRJKjS+z89F3d9FkFRCLGqsHJ8R/U+xJUMfTiHAXWBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:13.976667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01768","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b454ffe116c07435d793a1b33cd89b410c8499fd7d4d51f99c314edaac6fd311","sha256:c8f9f053cd6a84ecd8005d40cf72b4428266edd6c8e7ce6c46555b386371ab06"],"state_sha256":"c48aed17cc68f34369d087ce3ac5f68f78af046cbc1b19c44468772411a5eccb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzEx5I87PmOduQDKLn1/JV9eD6W/Jou6iYEPWCabtYRz+bB1z0Q2KJZc8+CW5pF0uEE8tU2acBKvPZ5GP+YOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:23:57.344724Z","bundle_sha256":"0d215943e0aac792041b4527542f5c066ae74eb9797c9cd2ba6698b6cea8edd5"}}