{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FVU4KMJR3DDP6FSK7G7UB62IVS","short_pith_number":"pith:FVU4KMJR","schema_version":"1.0","canonical_sha256":"2d69c53131d8c6ff164af9bf40fb48ac96a18551a83d41d7df97276f95e0a2a0","source":{"kind":"arxiv","id":"1401.6470","version":1},"attestation_state":"computed","paper":{"title":"r-Dynamic Chromatic Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Taherkhani","submitted_at":"2014-01-24T22:30:40Z","abstract_excerpt":"An $r$-dynamic $k$-coloring of a graph $G$ is a proper vertex $k$-coloring such that the neighbors of any vertex $v$ receive at least $\\min\\{r,{\\rm deg}(v)\\}$ different colors. The $r$-dynamic chromatic number of $G$, $\\chi_r(G)$, is defined as the smallest $k$ such that $G$ admits an $r$-dynamic $k$-coloring. In this paper we introduce an upper bound for $\\chi_r(G)$ in terms of $r$, chromatic number, maximum degree and minimum degree. In 2001, Montgomery \\cite{MR2702379} conjectured that, for a $d$-regular graph $G$, $\\chi_2(G)-\\chi(G)\\leq 2$. In this regard, for a $d$-regular graph $G$, we p"},"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":"1401.6470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-24T22:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"96801de214800344853cbd5a58b1c2e264da82bf67b8529d49eb0f68a9c21a30","abstract_canon_sha256":"994a804887c5b64d55a974415518dbc5889f7e1437e492b109a7679602918ce2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:01.741691Z","signature_b64":"czsu9T1E8Zhxh5aA/rcYhXfV2a0+7oCsgyrl//b9DGZL8IhBtKHzPSDxMWqsT3iagaEp4yGn0cpbQOj5ydkaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d69c53131d8c6ff164af9bf40fb48ac96a18551a83d41d7df97276f95e0a2a0","last_reissued_at":"2026-05-18T03:01:01.741021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:01.741021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"r-Dynamic Chromatic Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Taherkhani","submitted_at":"2014-01-24T22:30:40Z","abstract_excerpt":"An $r$-dynamic $k$-coloring of a graph $G$ is a proper vertex $k$-coloring such that the neighbors of any vertex $v$ receive at least $\\min\\{r,{\\rm deg}(v)\\}$ different colors. The $r$-dynamic chromatic number of $G$, $\\chi_r(G)$, is defined as the smallest $k$ such that $G$ admits an $r$-dynamic $k$-coloring. In this paper we introduce an upper bound for $\\chi_r(G)$ in terms of $r$, chromatic number, maximum degree and minimum degree. In 2001, Montgomery \\cite{MR2702379} conjectured that, for a $d$-regular graph $G$, $\\chi_2(G)-\\chi(G)\\leq 2$. In this regard, for a $d$-regular graph $G$, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6470","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":""},"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":"1401.6470","created_at":"2026-05-18T03:01:01.741128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6470v1","created_at":"2026-05-18T03:01:01.741128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6470","created_at":"2026-05-18T03:01:01.741128+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVU4KMJR3DDP","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVU4KMJR3DDP6FSK","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVU4KMJR","created_at":"2026-05-18T12:28:28.263976+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/FVU4KMJR3DDP6FSK7G7UB62IVS","json":"https://pith.science/pith/FVU4KMJR3DDP6FSK7G7UB62IVS.json","graph_json":"https://pith.science/api/pith-number/FVU4KMJR3DDP6FSK7G7UB62IVS/graph.json","events_json":"https://pith.science/api/pith-number/FVU4KMJR3DDP6FSK7G7UB62IVS/events.json","paper":"https://pith.science/paper/FVU4KMJR"},"agent_actions":{"view_html":"https://pith.science/pith/FVU4KMJR3DDP6FSK7G7UB62IVS","download_json":"https://pith.science/pith/FVU4KMJR3DDP6FSK7G7UB62IVS.json","view_paper":"https://pith.science/paper/FVU4KMJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6470&json=true","fetch_graph":"https://pith.science/api/pith-number/FVU4KMJR3DDP6FSK7G7UB62IVS/graph.json","fetch_events":"https://pith.science/api/pith-number/FVU4KMJR3DDP6FSK7G7UB62IVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVU4KMJR3DDP6FSK7G7UB62IVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVU4KMJR3DDP6FSK7G7UB62IVS/action/storage_attestation","attest_author":"https://pith.science/pith/FVU4KMJR3DDP6FSK7G7UB62IVS/action/author_attestation","sign_citation":"https://pith.science/pith/FVU4KMJR3DDP6FSK7G7UB62IVS/action/citation_signature","submit_replication":"https://pith.science/pith/FVU4KMJR3DDP6FSK7G7UB62IVS/action/replication_record"}},"created_at":"2026-05-18T03:01:01.741128+00:00","updated_at":"2026-05-18T03:01:01.741128+00:00"}