{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4HEFOV7OAGZONL6MDJ4CMN4GY4","short_pith_number":"pith:4HEFOV7O","canonical_record":{"source":{"id":"1105.0790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-04T11:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"3e17a967b19f6349b189301f3eaef581727d84b8d20712ae9bb3c0018ab84d58","abstract_canon_sha256":"60362aa8f2daf1566b993c51b6e43953defeeae8687d5458149390793ea4b021"},"schema_version":"1.0"},"canonical_sha256":"e1c85757ee01b2e6afcc1a78263786c732d7d4832dbdf2b238cdf8a592760627","source":{"kind":"arxiv","id":"1105.0790","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0790","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0790v1","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0790","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"4HEFOV7OAGZO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4HEFOV7OAGZONL6M","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4HEFOV7O","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4HEFOV7OAGZONL6MDJ4CMN4GY4","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-04T11:07:36Z","cross_cats_sorted":[],"title_canon_sha256":"3e17a967b19f6349b189301f3eaef581727d84b8d20712ae9bb3c0018ab84d58","abstract_canon_sha256":"60362aa8f2daf1566b993c51b6e43953defeeae8687d5458149390793ea4b021"},"schema_version":"1.0"},"canonical_sha256":"e1c85757ee01b2e6afcc1a78263786c732d7d4832dbdf2b238cdf8a592760627","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:01.824754Z","signature_b64":"p8EF9Zp5abhuFMHMvxTosc6iYZroQsXcbi3QYhwkdOAdbHw7XQeKaHVvBp7j253s6I0i8V9XomSTLTVmNg0RCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1c85757ee01b2e6afcc1a78263786c732d7d4832dbdf2b238cdf8a592760627","last_reissued_at":"2026-05-18T04:23:01.824293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:01.824293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0790","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-05-18T04:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ee+FSwQqMDprGR1zj2OcB24sji4TNUXuumDW1g+gzMTKzFbziqGUiqJKq1j8UesAjV0NxXVuK+DNrC5W+IsEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:48:37.485280Z"},"content_sha256":"dc09b86a2938cb222d6f3035d6a17d74e9422d63d3c193620c967afad57f5907","schema_version":"1.0","event_id":"sha256:dc09b86a2938cb222d6f3035d6a17d74e9422d63d3c193620c967afad57f5907"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4HEFOV7OAGZONL6MDJ4CMN4GY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow connection number, bridges and radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiuying Dong, Xueliang Li","submitted_at":"2011-05-04T11:07:36Z","abstract_excerpt":"Let $G$ be a connected graph. The notion \\emph{the rainbow connection number $rc(G)$} of a graph $G$ was introduced recently by Chartrand et al. Basavaraju et al. showed that for every bridgeless graph $G$ with radius $r$, $rc(G)\\leq r(r+2)$, and the bound is tight. In this paper, we prove that if $G$ is a connected graph, and $D^{k}$ is a connected $k$-step dominating set of $G$, then $G$ has a connected $(k-1)$-step dominating set $D^{k-1}\\supset D^{k}$ such that $rc(G[D^{k-1}])\\leq rc(G[D^{k}])+\\max\\{2k+1,b_k\\}$, where $b_k$ is the number of bridges in $ E(D^{k}, N(D^{k}))$. Furthermore, fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0790","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"},"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-18T04:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cXcukTMBFGwvXh9Ct2O6aMpI6V057MAThFrluciKIRMdViO1YML+Ay6DajynAAv1xSbLC5LGA24kvt+DW0tqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:48:37.485637Z"},"content_sha256":"23d08666d515d3c447e9e7b952b3f9c9a469075f1ed5305752d31c3a1703741c","schema_version":"1.0","event_id":"sha256:23d08666d515d3c447e9e7b952b3f9c9a469075f1ed5305752d31c3a1703741c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HEFOV7OAGZONL6MDJ4CMN4GY4/bundle.json","state_url":"https://pith.science/pith/4HEFOV7OAGZONL6MDJ4CMN4GY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HEFOV7OAGZONL6MDJ4CMN4GY4/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-01T22:48:37Z","links":{"resolver":"https://pith.science/pith/4HEFOV7OAGZONL6MDJ4CMN4GY4","bundle":"https://pith.science/pith/4HEFOV7OAGZONL6MDJ4CMN4GY4/bundle.json","state":"https://pith.science/pith/4HEFOV7OAGZONL6MDJ4CMN4GY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HEFOV7OAGZONL6MDJ4CMN4GY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4HEFOV7OAGZONL6MDJ4CMN4GY4","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":"60362aa8f2daf1566b993c51b6e43953defeeae8687d5458149390793ea4b021","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-04T11:07:36Z","title_canon_sha256":"3e17a967b19f6349b189301f3eaef581727d84b8d20712ae9bb3c0018ab84d58"},"schema_version":"1.0","source":{"id":"1105.0790","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0790","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0790v1","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0790","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"4HEFOV7OAGZO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4HEFOV7OAGZONL6M","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4HEFOV7O","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:23d08666d515d3c447e9e7b952b3f9c9a469075f1ed5305752d31c3a1703741c","target":"graph","created_at":"2026-05-18T04:23:01Z","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":"Let $G$ be a connected graph. The notion \\emph{the rainbow connection number $rc(G)$} of a graph $G$ was introduced recently by Chartrand et al. Basavaraju et al. showed that for every bridgeless graph $G$ with radius $r$, $rc(G)\\leq r(r+2)$, and the bound is tight. In this paper, we prove that if $G$ is a connected graph, and $D^{k}$ is a connected $k$-step dominating set of $G$, then $G$ has a connected $(k-1)$-step dominating set $D^{k-1}\\supset D^{k}$ such that $rc(G[D^{k-1}])\\leq rc(G[D^{k}])+\\max\\{2k+1,b_k\\}$, where $b_k$ is the number of bridges in $ E(D^{k}, N(D^{k}))$. Furthermore, fo","authors_text":"Jiuying Dong, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-04T11:07:36Z","title":"Rainbow connection number, bridges and radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0790","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:dc09b86a2938cb222d6f3035d6a17d74e9422d63d3c193620c967afad57f5907","target":"record","created_at":"2026-05-18T04:23:01Z","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":"60362aa8f2daf1566b993c51b6e43953defeeae8687d5458149390793ea4b021","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-04T11:07:36Z","title_canon_sha256":"3e17a967b19f6349b189301f3eaef581727d84b8d20712ae9bb3c0018ab84d58"},"schema_version":"1.0","source":{"id":"1105.0790","kind":"arxiv","version":1}},"canonical_sha256":"e1c85757ee01b2e6afcc1a78263786c732d7d4832dbdf2b238cdf8a592760627","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1c85757ee01b2e6afcc1a78263786c732d7d4832dbdf2b238cdf8a592760627","first_computed_at":"2026-05-18T04:23:01.824293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:01.824293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p8EF9Zp5abhuFMHMvxTosc6iYZroQsXcbi3QYhwkdOAdbHw7XQeKaHVvBp7j253s6I0i8V9XomSTLTVmNg0RCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:01.824754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0790","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc09b86a2938cb222d6f3035d6a17d74e9422d63d3c193620c967afad57f5907","sha256:23d08666d515d3c447e9e7b952b3f9c9a469075f1ed5305752d31c3a1703741c"],"state_sha256":"c9c3eb611c1f996890039a3dd2c6975bea22d753d2f5fd8479e32dec9c248013"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LLHk+fXwHi90tlMbY1aoSYYuLuFwixtEUM/3qN3NiZXjiLJXR/TQ7k+JfKu361GTtx2yKOsbJAJ+A+UCIk7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:48:37.487560Z","bundle_sha256":"ecd65326934c88ef55a7c342ea015e9a6391d3b22fb1079ca3c06af604953ea8"}}