{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:V2MLRXYY7TKEHOACS7OX6EGDYO","short_pith_number":"pith:V2MLRXYY","schema_version":"1.0","canonical_sha256":"ae98b8df18fcd443b80297dd7f10c3c397ddd8c7db9e58f3ca4a9c3a37c45f60","source":{"kind":"arxiv","id":"1503.04492","version":3},"attestation_state":"computed","paper":{"title":"Dynamic choosability of triangle-free graphs and sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaehoon Kim, Seongmin Ok","submitted_at":"2015-03-16T00:11:34Z","abstract_excerpt":"The \\textit{$r$-dynamic choosability} of a graph $G$, written ${\\rm ch}_r(G)$, is the least $k$ such that whenever each vertex is assigned a list of at least $k$ colors a proper coloring can be chosen from the lists so that every vertex $v$ has at least $\\min\\{d_G(v),r\\}$ neighbors of distinct colors. Let ${\\rm ch}(G)$ denote the choice number of $G$. In this paper, we prove ${\\rm ch}_r(G)\\leq (1+o(1)){\\rm ch}(G)$ when $\\frac{\\Delta(G)}{\\delta(G)}$ is bounded. We also show that there exists a constant $C$ such that for the random graph $G=G(n,p)$ with $\\frac{2}{n}<p\\leq \\frac{1}{2}$, it holds "},"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":"1503.04492","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T00:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"2a76baa7953ca48820ba2e9e6d7a71cf76dc21207e75657bb280c71f5e5ab99b","abstract_canon_sha256":"a5d58fd971205a62ccf8f1bad669d558c823dd5710a72b161444e3cbff656250"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:21.663487Z","signature_b64":"JRZhFjRVGcuzeKlCsBj1q/x9SRpRpIhecxSo28vT/xLUCpk/r7SXHayAjm42Ires5X/h6T7vj50ilTYuAORHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae98b8df18fcd443b80297dd7f10c3c397ddd8c7db9e58f3ca4a9c3a37c45f60","last_reissued_at":"2026-05-18T00:25:21.663009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:21.663009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic choosability of triangle-free graphs and sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaehoon Kim, Seongmin Ok","submitted_at":"2015-03-16T00:11:34Z","abstract_excerpt":"The \\textit{$r$-dynamic choosability} of a graph $G$, written ${\\rm ch}_r(G)$, is the least $k$ such that whenever each vertex is assigned a list of at least $k$ colors a proper coloring can be chosen from the lists so that every vertex $v$ has at least $\\min\\{d_G(v),r\\}$ neighbors of distinct colors. Let ${\\rm ch}(G)$ denote the choice number of $G$. In this paper, we prove ${\\rm ch}_r(G)\\leq (1+o(1)){\\rm ch}(G)$ when $\\frac{\\Delta(G)}{\\delta(G)}$ is bounded. We also show that there exists a constant $C$ such that for the random graph $G=G(n,p)$ with $\\frac{2}{n}<p\\leq \\frac{1}{2}$, it holds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04492","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.04492","created_at":"2026-05-18T00:25:21.663078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04492v3","created_at":"2026-05-18T00:25:21.663078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04492","created_at":"2026-05-18T00:25:21.663078+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2MLRXYY7TKE","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2MLRXYY7TKEHOAC","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2MLRXYY","created_at":"2026-05-18T12:29:44.643036+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/V2MLRXYY7TKEHOACS7OX6EGDYO","json":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO.json","graph_json":"https://pith.science/api/pith-number/V2MLRXYY7TKEHOACS7OX6EGDYO/graph.json","events_json":"https://pith.science/api/pith-number/V2MLRXYY7TKEHOACS7OX6EGDYO/events.json","paper":"https://pith.science/paper/V2MLRXYY"},"agent_actions":{"view_html":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO","download_json":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO.json","view_paper":"https://pith.science/paper/V2MLRXYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04492&json=true","fetch_graph":"https://pith.science/api/pith-number/V2MLRXYY7TKEHOACS7OX6EGDYO/graph.json","fetch_events":"https://pith.science/api/pith-number/V2MLRXYY7TKEHOACS7OX6EGDYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/action/storage_attestation","attest_author":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/action/author_attestation","sign_citation":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/action/citation_signature","submit_replication":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/action/replication_record"}},"created_at":"2026-05-18T00:25:21.663078+00:00","updated_at":"2026-05-18T00:25:21.663078+00:00"}