{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V2MLRXYY7TKEHOACS7OX6EGDYO","short_pith_number":"pith:V2MLRXYY","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"},"canonical_sha256":"ae98b8df18fcd443b80297dd7f10c3c397ddd8c7db9e58f3ca4a9c3a37c45f60","source":{"kind":"arxiv","id":"1503.04492","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04492","created_at":"2026-05-18T00:25:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04492v3","created_at":"2026-05-18T00:25:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04492","created_at":"2026-05-18T00:25:21Z"},{"alias_kind":"pith_short_12","alias_value":"V2MLRXYY7TKE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V2MLRXYY7TKEHOAC","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V2MLRXYY","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V2MLRXYY7TKEHOACS7OX6EGDYO","target":"record","payload":{"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"},"canonical_sha256":"ae98b8df18fcd443b80297dd7f10c3c397ddd8c7db9e58f3ca4a9c3a37c45f60","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"},"source_kind":"arxiv","source_id":"1503.04492","source_version":3,"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:25:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YxssaURV8X3Leg0v4mfQGzPzlV0bXoAiMVwVJKcNOs8msAvDdRJNt4VNNAqKFfTjV6fydGLvp+D9tu38qmdPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:52:37.926162Z"},"content_sha256":"c69d2528ac0b66ce8b93b148793b028184f82c77da1764e6199ea98ad21654c0","schema_version":"1.0","event_id":"sha256:c69d2528ac0b66ce8b93b148793b028184f82c77da1764e6199ea98ad21654c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V2MLRXYY7TKEHOACS7OX6EGDYO","target":"graph","payload":{"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"},"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:25:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNM0Ve6ZiR/BSUfUe/v0z9G5TcBqJGAnegsyY9ZHomgpRULHpP+oYMSpP8n3zhI3Jm4rWnH5gLu31wmfA8lUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:52:37.926856Z"},"content_sha256":"b45e10e01854e43ed744385fca30f9ef552cf2db3c1d3375e28c2f6f22df7049","schema_version":"1.0","event_id":"sha256:b45e10e01854e43ed744385fca30f9ef552cf2db3c1d3375e28c2f6f22df7049"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/bundle.json","state_url":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/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-27T13:52:37Z","links":{"resolver":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO","bundle":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/bundle.json","state":"https://pith.science/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2MLRXYY7TKEHOACS7OX6EGDYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V2MLRXYY7TKEHOACS7OX6EGDYO","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":"a5d58fd971205a62ccf8f1bad669d558c823dd5710a72b161444e3cbff656250","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T00:11:34Z","title_canon_sha256":"2a76baa7953ca48820ba2e9e6d7a71cf76dc21207e75657bb280c71f5e5ab99b"},"schema_version":"1.0","source":{"id":"1503.04492","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04492","created_at":"2026-05-18T00:25:21Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04492v3","created_at":"2026-05-18T00:25:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04492","created_at":"2026-05-18T00:25:21Z"},{"alias_kind":"pith_short_12","alias_value":"V2MLRXYY7TKE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V2MLRXYY7TKEHOAC","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V2MLRXYY","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:b45e10e01854e43ed744385fca30f9ef552cf2db3c1d3375e28c2f6f22df7049","target":"graph","created_at":"2026-05-18T00:25:21Z","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":"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 ","authors_text":"Jaehoon Kim, Seongmin Ok","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T00:11:34Z","title":"Dynamic choosability of triangle-free graphs and sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04492","kind":"arxiv","version":3},"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:c69d2528ac0b66ce8b93b148793b028184f82c77da1764e6199ea98ad21654c0","target":"record","created_at":"2026-05-18T00:25:21Z","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":"a5d58fd971205a62ccf8f1bad669d558c823dd5710a72b161444e3cbff656250","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T00:11:34Z","title_canon_sha256":"2a76baa7953ca48820ba2e9e6d7a71cf76dc21207e75657bb280c71f5e5ab99b"},"schema_version":"1.0","source":{"id":"1503.04492","kind":"arxiv","version":3}},"canonical_sha256":"ae98b8df18fcd443b80297dd7f10c3c397ddd8c7db9e58f3ca4a9c3a37c45f60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae98b8df18fcd443b80297dd7f10c3c397ddd8c7db9e58f3ca4a9c3a37c45f60","first_computed_at":"2026-05-18T00:25:21.663009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:21.663009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JRZhFjRVGcuzeKlCsBj1q/x9SRpRpIhecxSo28vT/xLUCpk/r7SXHayAjm42Ires5X/h6T7vj50ilTYuAORHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:21.663487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04492","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c69d2528ac0b66ce8b93b148793b028184f82c77da1764e6199ea98ad21654c0","sha256:b45e10e01854e43ed744385fca30f9ef552cf2db3c1d3375e28c2f6f22df7049"],"state_sha256":"3de5bfa7f9b55bdf4c921d7808ef3d06ebf16a31a3b3f5df4f0d1a04f6b1dd28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m4EmzUuinZwH11aEXktNTWBowR8WBzVHRyr/LSFK6R4WsBvsh0sqmmwn+zTdDkIuH8yy7kgaZT+QKgdMyY1RBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:52:37.929565Z","bundle_sha256":"99cc339f83bfc68896511c18f04d3c309c27728031693171ad467dfd32f1378e"}}