{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ITXDNDBFNOYVEDDKIVQ37WROJ3","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":"b78b5a4b301869025adc67ba87273c81286613bdadd06a7dd5933d7b8775c8d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-21T11:22:09Z","title_canon_sha256":"dc52fa25aa1c4eccdeea455a134bb7b45bea2e34d51ce567d8740997a1ce2998"},"schema_version":"1.0","source":{"id":"1705.07434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07434","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07434v1","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07434","created_at":"2026-05-18T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"ITXDNDBFNOYV","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"ITXDNDBFNOYVEDDK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"ITXDNDBF","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:09844627ad8d100b937d448819845436fd6b1147fb0fed0645dd2a3451727680","target":"graph","created_at":"2026-05-18T00:44:05Z","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 $G$ is called uniquely k-list colorable (U$k$LC) if there exists a list of colors on its vertices, say $L=\\lbrace S_v \\mid v \\in V(G) \\rbrace $, each of size $k$, such that there is a unique proper list coloring of $G$ from this list of colors. A graph $G$ is said to have property $M(k)$ if it is not uniquely $k$-list colorable. Mahmoodian and Mahdian characterized all graphs with property $M(2)$. For $k\\geq 3$ property $M(k)$ has been studied only for multipartite graphs. Here we find bounds on $M(k)$ for graphs embedded on surfaces, and obtain new results on planar graphs. We begin a","authors_text":"E. S. Mahmoodian, J. P. Hutchinson, M. Abdolmaleki, M. A. Shabani, S. Gh. Ilchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-21T11:22:09Z","title":"On uniquely k-list colorable planar graphs, graphs on surfaces, and regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07434","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:2fca97a8c6c5cd57b820398ce411ad93b8f4a81b9eaa020bd6c6bc0050aba525","target":"record","created_at":"2026-05-18T00:44:05Z","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":"b78b5a4b301869025adc67ba87273c81286613bdadd06a7dd5933d7b8775c8d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-21T11:22:09Z","title_canon_sha256":"dc52fa25aa1c4eccdeea455a134bb7b45bea2e34d51ce567d8740997a1ce2998"},"schema_version":"1.0","source":{"id":"1705.07434","kind":"arxiv","version":1}},"canonical_sha256":"44ee368c256bb1520c6a4561bfda2e4ee68fe9a9e324ba2a8a2ce815fe78fb0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44ee368c256bb1520c6a4561bfda2e4ee68fe9a9e324ba2a8a2ce815fe78fb0b","first_computed_at":"2026-05-18T00:44:05.622280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:05.622280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1vS61oyrxHM8rG8e+nIUKW1M5oLnUip3H974qxBUjdTzUiUpOlKlUZ3RM5R04FBW6Py25P5fOGSJI+Q9N93dCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:05.623007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fca97a8c6c5cd57b820398ce411ad93b8f4a81b9eaa020bd6c6bc0050aba525","sha256:09844627ad8d100b937d448819845436fd6b1147fb0fed0645dd2a3451727680"],"state_sha256":"20652aeb342666dd83bd6b3a3e5f81c2f717571df47697381d4291b7a4ef5ab2"}