{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EKNIY7L6FCCB2KLRLPPAL2EH6Z","short_pith_number":"pith:EKNIY7L6","canonical_record":{"source":{"id":"1801.05137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T07:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"b34ba0a0b78704f897a7c910307b4355eb361b7f0276ee278fca8bf00d2517c7","abstract_canon_sha256":"7d35bac16b7dcb52530f2a380b3d4b9e6781cd7fc119956b9ab169389b741320"},"schema_version":"1.0"},"canonical_sha256":"229a8c7d7e28841d29715bde05e887f67aa7fdcf1f581e7907534ac94432c19a","source":{"kind":"arxiv","id":"1801.05137","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05137","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05137v3","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05137","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"EKNIY7L6FCCB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKNIY7L6FCCB2KLR","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKNIY7L6","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EKNIY7L6FCCB2KLRLPPAL2EH6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T07:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"b34ba0a0b78704f897a7c910307b4355eb361b7f0276ee278fca8bf00d2517c7","abstract_canon_sha256":"7d35bac16b7dcb52530f2a380b3d4b9e6781cd7fc119956b9ab169389b741320"},"schema_version":"1.0"},"canonical_sha256":"229a8c7d7e28841d29715bde05e887f67aa7fdcf1f581e7907534ac94432c19a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:36.470391Z","signature_b64":"R0rK6ae4QDotyCZgKBAiVGy21TfCwIFz6p9tTVTUaFdtn5fwZ3Yg8oAs4301o/a4AF+BoN5o3GdShLzn6ghyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229a8c7d7e28841d29715bde05e887f67aa7fdcf1f581e7907534ac94432c19a","last_reissued_at":"2026-05-18T00:16:36.469743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:36.469743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05137","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:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rSXK/PTVYobiot/nELippTbG3VXHnvr7lCiyRMY4AF6UqKmxC14g67pDNkFUU8Ym4U/Nj7mMYomiBoabJ8iBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:18:02.865959Z"},"content_sha256":"dc574b9d629cecdd59f61633c0473627f779e74b8501da2f10a2a681ae025ea1","schema_version":"1.0","event_id":"sha256:dc574b9d629cecdd59f61633c0473627f779e74b8501da2f10a2a681ae025ea1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EKNIY7L6FCCB2KLRLPPAL2EH6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Total dominator coloring of central graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi, Farshad Kazemnejad","submitted_at":"2018-01-16T07:19:30Z","abstract_excerpt":"A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes in a total dominator coloring of it. Here, we study the total dominator coloring on central graphs by giving some tight bounds for the total dominator chromatic number of the central of a graph, join of two graphs and Nordhaus-Gaddum-like relations. Also we will calculate the total dominator chromatic number of the central of a path, a cycle, a wheel, a comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05137","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:16:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtuOo051hDZmmbJikvzSeVjMqGbUEWkHI1G6JpCeJNub0kARYrtH/FaqnchdV5gO8RKIZn3XTfaZtcS4fxldDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:18:02.866289Z"},"content_sha256":"e85968f0ed990c51e73f9edacacc5cfe10bb9d63075eecce11a7bb6982994230","schema_version":"1.0","event_id":"sha256:e85968f0ed990c51e73f9edacacc5cfe10bb9d63075eecce11a7bb6982994230"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/bundle.json","state_url":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/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-06-22T06:18:02Z","links":{"resolver":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z","bundle":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/bundle.json","state":"https://pith.science/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKNIY7L6FCCB2KLRLPPAL2EH6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EKNIY7L6FCCB2KLRLPPAL2EH6Z","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":"7d35bac16b7dcb52530f2a380b3d4b9e6781cd7fc119956b9ab169389b741320","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T07:19:30Z","title_canon_sha256":"b34ba0a0b78704f897a7c910307b4355eb361b7f0276ee278fca8bf00d2517c7"},"schema_version":"1.0","source":{"id":"1801.05137","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05137","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05137v3","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05137","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"EKNIY7L6FCCB","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKNIY7L6FCCB2KLR","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKNIY7L6","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:e85968f0ed990c51e73f9edacacc5cfe10bb9d63075eecce11a7bb6982994230","target":"graph","created_at":"2026-05-18T00:16:36Z","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":"A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes in a total dominator coloring of it. Here, we study the total dominator coloring on central graphs by giving some tight bounds for the total dominator chromatic number of the central of a graph, join of two graphs and Nordhaus-Gaddum-like relations. Also we will calculate the total dominator chromatic number of the central of a path, a cycle, a wheel, a comp","authors_text":"Adel P. Kazemi, Farshad Kazemnejad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T07:19:30Z","title":"Total dominator coloring of central graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05137","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:dc574b9d629cecdd59f61633c0473627f779e74b8501da2f10a2a681ae025ea1","target":"record","created_at":"2026-05-18T00:16:36Z","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":"7d35bac16b7dcb52530f2a380b3d4b9e6781cd7fc119956b9ab169389b741320","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T07:19:30Z","title_canon_sha256":"b34ba0a0b78704f897a7c910307b4355eb361b7f0276ee278fca8bf00d2517c7"},"schema_version":"1.0","source":{"id":"1801.05137","kind":"arxiv","version":3}},"canonical_sha256":"229a8c7d7e28841d29715bde05e887f67aa7fdcf1f581e7907534ac94432c19a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"229a8c7d7e28841d29715bde05e887f67aa7fdcf1f581e7907534ac94432c19a","first_computed_at":"2026-05-18T00:16:36.469743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:36.469743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R0rK6ae4QDotyCZgKBAiVGy21TfCwIFz6p9tTVTUaFdtn5fwZ3Yg8oAs4301o/a4AF+BoN5o3GdShLzn6ghyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:36.470391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05137","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc574b9d629cecdd59f61633c0473627f779e74b8501da2f10a2a681ae025ea1","sha256:e85968f0ed990c51e73f9edacacc5cfe10bb9d63075eecce11a7bb6982994230"],"state_sha256":"903adcb65045e777536b7a8cf0eb48c0e42dbda1899aacd862153a32cc2f85a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDxNsJuImnE4TZMiMm52mrCPXLut9rffWi8rcisBwXNUgvZm+FCxAEMR6mwPwKTuW+/3OQuOsJA41kMzpW9TBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T06:18:02.868087Z","bundle_sha256":"49c4139d65cfdaecdb773a8640393c5f894c2fe436baa3cad5084b5b7c96fc9e"}}