{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BNJU3K2S647HOLBTX7XOAHEMOK","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":"c6e01cefba680eda4099d9f6496c7f89cb3d039b676f3264aa540e0c301801f0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-03T09:40:13Z","title_canon_sha256":"d3ebf8bfa399f974fb79a47332d2dff297e429858990882ddcc9de43c2623dea"},"schema_version":"1.0","source":{"id":"1701.00614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00614","created_at":"2026-05-18T00:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00614v1","created_at":"2026-05-18T00:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00614","created_at":"2026-05-18T00:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"BNJU3K2S647H","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BNJU3K2S647HOLBT","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BNJU3K2S","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:4f1e43fd034b4cf39ee561c06762c557917bbe6a1cd0386dd3e384014052b73d","target":"graph","created_at":"2026-05-18T00:53:28Z","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":"Let $G=G(n)$ be a graph on $n$ vertices with maximum degree $\\Delta=\\Delta(n)$. Assign to each vertex $v$ of $G$ a list $L(v)$ of colors by choosing each list independently and uniformly at random from all $k$-subsets of a color set $\\mathcal{C}$ of size $\\sigma= \\sigma(n)$. Such a list assignment is called a \\emph{random $(k,\\mathcal{C})$-list assignment}. In this paper, we are interested in determining the asymptotic probability (as $n \\to \\infty$) of the existence of a proper coloring $\\varphi$ of $G$, such that $\\varphi(v) \\in L(v)$ for every vertex $v$ of $G$, a so-called $L$-coloring. We","authors_text":"Carl Johan Casselgren","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-03T09:40:13Z","title":"Coloring graphs of various maximum degree from random lists"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00614","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:fb430524cf1a366cd47ab9c85a6c4ffb1407ddf73d8ff7b56469fd319a17e1b7","target":"record","created_at":"2026-05-18T00:53:28Z","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":"c6e01cefba680eda4099d9f6496c7f89cb3d039b676f3264aa540e0c301801f0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-03T09:40:13Z","title_canon_sha256":"d3ebf8bfa399f974fb79a47332d2dff297e429858990882ddcc9de43c2623dea"},"schema_version":"1.0","source":{"id":"1701.00614","kind":"arxiv","version":1}},"canonical_sha256":"0b534dab52f73e772c33bfeee01c8c72b779ed3e1594a97d8a41a9b5705d94ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b534dab52f73e772c33bfeee01c8c72b779ed3e1594a97d8a41a9b5705d94ef","first_computed_at":"2026-05-18T00:53:28.832788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:28.832788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gq3r2YmOsfGOderKjGvf2UJCIGvQlPIx23esS/sUpCkyxJdOjflCPAeNhuTe0phWpbfuoq2bnyxjticobLTXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:28.833379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb430524cf1a366cd47ab9c85a6c4ffb1407ddf73d8ff7b56469fd319a17e1b7","sha256:4f1e43fd034b4cf39ee561c06762c557917bbe6a1cd0386dd3e384014052b73d"],"state_sha256":"2bf92ce21d4cf29da2965ee592dd45c2354855b8bc9d6f27ee0b8b61b5054a55"}