{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZG2O7RKXVYSW2JZI567T2YPYOV","short_pith_number":"pith:ZG2O7RKX","schema_version":"1.0","canonical_sha256":"c9b4efc557ae256d2728efbf3d61f8754485b6ec1e07e6d904f26f0ab00b811b","source":{"kind":"arxiv","id":"2501.13617","version":1},"attestation_state":"computed","paper":{"title":"The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Miriam Goetze, Torsten Ueckerdt","submitted_at":"2025-01-23T12:38:15Z","abstract_excerpt":"A proper vertex-coloring of a graph is $r$-dynamic if the neighbors of each vertex $v$ receive at least $\\min(r, \\mathrm{deg}(v))$ different colors. In this note, we prove that if $G$ has a strong $2$-coloring number at most $k$, then $G$ admits an $r$-dynamic coloring with no more than $(k-1)r+1$ colors. As a consequence, for every class of graphs of bounded expansion, the $r$-dynamic chromatic number is bounded by a linear function in $r$. We give a concrete upper bound for graphs of bounded row-treewidth, which includes for example all planar graphs."},"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":"2501.13617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-23T12:38:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ba0a160d0c6844e4f1de47ded768d736ef2f500752d398afb59a7fa658703f23","abstract_canon_sha256":"0cd96c7401c4ef71979b408fd5c719fe277055a61e01a75e33309ce938fc4f8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:31.644514Z","signature_b64":"tcWwuSghamkwCRFl10EoLtUdw0m9Z8/gMDVFLc/4k9gHDVagoiQCaS/Gjh23LRwRCvh9zRFamVu2+6YzTO8qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9b4efc557ae256d2728efbf3d61f8754485b6ec1e07e6d904f26f0ab00b811b","last_reissued_at":"2026-07-05T10:04:31.644049Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:31.644049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Miriam Goetze, Torsten Ueckerdt","submitted_at":"2025-01-23T12:38:15Z","abstract_excerpt":"A proper vertex-coloring of a graph is $r$-dynamic if the neighbors of each vertex $v$ receive at least $\\min(r, \\mathrm{deg}(v))$ different colors. In this note, we prove that if $G$ has a strong $2$-coloring number at most $k$, then $G$ admits an $r$-dynamic coloring with no more than $(k-1)r+1$ colors. As a consequence, for every class of graphs of bounded expansion, the $r$-dynamic chromatic number is bounded by a linear function in $r$. We give a concrete upper bound for graphs of bounded row-treewidth, which includes for example all planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13617","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.13617/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.13617","created_at":"2026-07-05T10:04:31.644106+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13617v1","created_at":"2026-07-05T10:04:31.644106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13617","created_at":"2026-07-05T10:04:31.644106+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZG2O7RKXVYSW","created_at":"2026-07-05T10:04:31.644106+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZG2O7RKXVYSW2JZI","created_at":"2026-07-05T10:04:31.644106+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZG2O7RKX","created_at":"2026-07-05T10:04:31.644106+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/ZG2O7RKXVYSW2JZI567T2YPYOV","json":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV.json","graph_json":"https://pith.science/api/pith-number/ZG2O7RKXVYSW2JZI567T2YPYOV/graph.json","events_json":"https://pith.science/api/pith-number/ZG2O7RKXVYSW2JZI567T2YPYOV/events.json","paper":"https://pith.science/paper/ZG2O7RKX"},"agent_actions":{"view_html":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV","download_json":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV.json","view_paper":"https://pith.science/paper/ZG2O7RKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13617&json=true","fetch_graph":"https://pith.science/api/pith-number/ZG2O7RKXVYSW2JZI567T2YPYOV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZG2O7RKXVYSW2JZI567T2YPYOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/action/storage_attestation","attest_author":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/action/author_attestation","sign_citation":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/action/citation_signature","submit_replication":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/action/replication_record"}},"created_at":"2026-07-05T10:04:31.644106+00:00","updated_at":"2026-07-05T10:04:31.644106+00:00"}