{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZG2O7RKXVYSW2JZI567T2YPYOV","short_pith_number":"pith:ZG2O7RKX","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"},"canonical_sha256":"c9b4efc557ae256d2728efbf3d61f8754485b6ec1e07e6d904f26f0ab00b811b","source":{"kind":"arxiv","id":"2501.13617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13617","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13617v1","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13617","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZG2O7RKXVYSW","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZG2O7RKXVYSW2JZI","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZG2O7RKX","created_at":"2026-07-05T10:04:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZG2O7RKXVYSW2JZI567T2YPYOV","target":"record","payload":{"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"},"canonical_sha256":"c9b4efc557ae256d2728efbf3d61f8754485b6ec1e07e6d904f26f0ab00b811b","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"},"source_kind":"arxiv","source_id":"2501.13617","source_version":1,"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-07-05T10:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nDv7zlwBrb/SSUoV8jBTmtJUf9Knv1uViTzV3HQuNJieRi3FzAcNZl0S80M5YSzhFFN6cbYiZ5Zyvmk68LlaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:36:03.637770Z"},"content_sha256":"1e4f89326d91cefdc8e14a11984f7f63ad88167fa6044466b91db0866152db9b","schema_version":"1.0","event_id":"sha256:1e4f89326d91cefdc8e14a11984f7f63ad88167fa6044466b91db0866152db9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZG2O7RKXVYSW2JZI567T2YPYOV","target":"graph","payload":{"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"},"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-07-05T10:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwJMT3eOE5uVJqihtF//lCZv1RXF5wZSWTaO7f8m2/6k4pm1ASADG6OB1PR9G0rxSab1uFRndi4cC19+l1BFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:36:03.638287Z"},"content_sha256":"b86a0d3bb960b968ea0bbdac0c6140c9ae4da8b794e12e789bb426257f75d984","schema_version":"1.0","event_id":"sha256:b86a0d3bb960b968ea0bbdac0c6140c9ae4da8b794e12e789bb426257f75d984"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/bundle.json","state_url":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/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-08-13T18:36:03Z","links":{"resolver":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV","bundle":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/bundle.json","state":"https://pith.science/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZG2O7RKXVYSW2JZI567T2YPYOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZG2O7RKXVYSW2JZI567T2YPYOV","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":"0cd96c7401c4ef71979b408fd5c719fe277055a61e01a75e33309ce938fc4f8a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-23T12:38:15Z","title_canon_sha256":"ba0a160d0c6844e4f1de47ded768d736ef2f500752d398afb59a7fa658703f23"},"schema_version":"1.0","source":{"id":"2501.13617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13617","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13617v1","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13617","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"ZG2O7RKXVYSW","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"ZG2O7RKXVYSW2JZI","created_at":"2026-07-05T10:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"ZG2O7RKX","created_at":"2026-07-05T10:04:31Z"}],"graph_snapshots":[{"event_id":"sha256:b86a0d3bb960b968ea0bbdac0c6140c9ae4da8b794e12e789bb426257f75d984","target":"graph","created_at":"2026-07-05T10:04:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.13617/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Miriam Goetze, Torsten Ueckerdt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-23T12:38:15Z","title":"The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13617","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:1e4f89326d91cefdc8e14a11984f7f63ad88167fa6044466b91db0866152db9b","target":"record","created_at":"2026-07-05T10:04:31Z","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":"0cd96c7401c4ef71979b408fd5c719fe277055a61e01a75e33309ce938fc4f8a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-23T12:38:15Z","title_canon_sha256":"ba0a160d0c6844e4f1de47ded768d736ef2f500752d398afb59a7fa658703f23"},"schema_version":"1.0","source":{"id":"2501.13617","kind":"arxiv","version":1}},"canonical_sha256":"c9b4efc557ae256d2728efbf3d61f8754485b6ec1e07e6d904f26f0ab00b811b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9b4efc557ae256d2728efbf3d61f8754485b6ec1e07e6d904f26f0ab00b811b","first_computed_at":"2026-07-05T10:04:31.644049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:04:31.644049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tcWwuSghamkwCRFl10EoLtUdw0m9Z8/gMDVFLc/4k9gHDVagoiQCaS/Gjh23LRwRCvh9zRFamVu2+6YzTO8qCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:04:31.644514Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.13617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e4f89326d91cefdc8e14a11984f7f63ad88167fa6044466b91db0866152db9b","sha256:b86a0d3bb960b968ea0bbdac0c6140c9ae4da8b794e12e789bb426257f75d984"],"state_sha256":"d9ee72df2aa15e1a99a971d059936c4c9b6200a0ce6642085912d0b83c358125"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"somWEwgiUPF0Tl0jeoj8PE8lTK7vGkJpgcc+g0PgQgdwAdMxcewElwFy7vObxWtbdn6cTnxLapqZCMvHkoGNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T18:36:03.664740Z","bundle_sha256":"f002048f9a0b2dc0228aff81a2c2a5ddb9a08a5aafeec665263032bbdf1529dc"}}