{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:JFVKMKZLIRI3LE6JU6T3JGCCMS","short_pith_number":"pith:JFVKMKZL","canonical_record":{"source":{"id":"1010.2296","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T04:44:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"50c4cd441ecc588a4f7680a126267e7eae8494816238250c3762bf84a419a257","abstract_canon_sha256":"ef629d42684ad584e5d83dc6f1864e0b68c427dae2e73a0976b445607e122c0a"},"schema_version":"1.0"},"canonical_sha256":"496aa62b2b4451b593c9a7a7b4984264bcd17f25c84df6723aa43b1e804c7600","source":{"kind":"arxiv","id":"1010.2296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2296","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2296v1","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2296","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"pith_short_12","alias_value":"JFVKMKZLIRI3","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JFVKMKZLIRI3LE6J","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JFVKMKZL","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:JFVKMKZLIRI3LE6JU6T3JGCCMS","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2296","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T04:44:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"50c4cd441ecc588a4f7680a126267e7eae8494816238250c3762bf84a419a257","abstract_canon_sha256":"ef629d42684ad584e5d83dc6f1864e0b68c427dae2e73a0976b445607e122c0a"},"schema_version":"1.0"},"canonical_sha256":"496aa62b2b4451b593c9a7a7b4984264bcd17f25c84df6723aa43b1e804c7600","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:01.937504Z","signature_b64":"t18CerlbKAI1rnbBKF3A8d/dOILuQUUWAk/z08zqLatXtRmqhyduZAYjg37LiQB5R8b+oS96k9x/tLEzUqMqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"496aa62b2b4451b593c9a7a7b4984264bcd17f25c84df6723aa43b1e804c7600","last_reissued_at":"2026-05-18T04:02:01.936629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:01.936629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2296","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:02:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7S+5C9BFjJH6p+IKXpEvnumTtC7xBpr3gg6SJOcP+a9iniQ8rorBdTZLlfYoGQAkc7eghYNAsmeeJKmO/wMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:40:20.562105Z"},"content_sha256":"15cb3e88a29c1fdad767dee08b4866893b1ee8a2bfd599515db519f0e3264534","schema_version":"1.0","event_id":"sha256:15cb3e88a29c1fdad767dee08b4866893b1ee8a2bfd599515db519f0e3264534"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:JFVKMKZLIRI3LE6JU6T3JGCCMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow Connection Number and Connected Dominating Sets","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anita Das, Deepak Rajendraprasad, L. Sunil Chandran, Nithin M. Varma","submitted_at":"2010-10-12T04:44:21Z","abstract_excerpt":"Rainbow connection number rc(G) of a connected graph G is the minimum number of colours needed to colour the edges of G, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this paper we show that for every connected graph G, with minimum degree at least 2, the rainbow connection number is upper bounded by {\\gamma}_c(G) + 2, where {\\gamma}_c(G) is the connected domination number of G. Bounds of the form diameter(G) \\leq rc(G) \\leq diameter(G) + c, 1 \\leq c \\leq 4, for many special graph classes follow as easy corollaries from this re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2296","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:02:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSquDbXD5EjmOlmLIqzojDeuaB4LmnFqstoWhAs7T6DfP2Q75rwijE0EIds3rTlqsumKz+jAwDxQgnG6OXBEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:40:20.562477Z"},"content_sha256":"a211b464d1288388449fd3f9d974fa1c4b2f11b5bc8207f8f1a3b5e903a31bb4","schema_version":"1.0","event_id":"sha256:a211b464d1288388449fd3f9d974fa1c4b2f11b5bc8207f8f1a3b5e903a31bb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/bundle.json","state_url":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/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-01T14:40:20Z","links":{"resolver":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS","bundle":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/bundle.json","state":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:JFVKMKZLIRI3LE6JU6T3JGCCMS","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":"ef629d42684ad584e5d83dc6f1864e0b68c427dae2e73a0976b445607e122c0a","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T04:44:21Z","title_canon_sha256":"50c4cd441ecc588a4f7680a126267e7eae8494816238250c3762bf84a419a257"},"schema_version":"1.0","source":{"id":"1010.2296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2296","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2296v1","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2296","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"pith_short_12","alias_value":"JFVKMKZLIRI3","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JFVKMKZLIRI3LE6J","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JFVKMKZL","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:a211b464d1288388449fd3f9d974fa1c4b2f11b5bc8207f8f1a3b5e903a31bb4","target":"graph","created_at":"2026-05-18T04:02: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":"Rainbow connection number rc(G) of a connected graph G is the minimum number of colours needed to colour the edges of G, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this paper we show that for every connected graph G, with minimum degree at least 2, the rainbow connection number is upper bounded by {\\gamma}_c(G) + 2, where {\\gamma}_c(G) is the connected domination number of G. Bounds of the form diameter(G) \\leq rc(G) \\leq diameter(G) + c, 1 \\leq c \\leq 4, for many special graph classes follow as easy corollaries from this re","authors_text":"Anita Das, Deepak Rajendraprasad, L. Sunil Chandran, Nithin M. Varma","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T04:44:21Z","title":"Rainbow Connection Number and Connected Dominating Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2296","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:15cb3e88a29c1fdad767dee08b4866893b1ee8a2bfd599515db519f0e3264534","target":"record","created_at":"2026-05-18T04:02: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":"ef629d42684ad584e5d83dc6f1864e0b68c427dae2e73a0976b445607e122c0a","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T04:44:21Z","title_canon_sha256":"50c4cd441ecc588a4f7680a126267e7eae8494816238250c3762bf84a419a257"},"schema_version":"1.0","source":{"id":"1010.2296","kind":"arxiv","version":1}},"canonical_sha256":"496aa62b2b4451b593c9a7a7b4984264bcd17f25c84df6723aa43b1e804c7600","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"496aa62b2b4451b593c9a7a7b4984264bcd17f25c84df6723aa43b1e804c7600","first_computed_at":"2026-05-18T04:02:01.936629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:01.936629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t18CerlbKAI1rnbBKF3A8d/dOILuQUUWAk/z08zqLatXtRmqhyduZAYjg37LiQB5R8b+oS96k9x/tLEzUqMqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:01.937504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15cb3e88a29c1fdad767dee08b4866893b1ee8a2bfd599515db519f0e3264534","sha256:a211b464d1288388449fd3f9d974fa1c4b2f11b5bc8207f8f1a3b5e903a31bb4"],"state_sha256":"8586f11ecf37563596053fcb3baaf35b9159fcabf5dc0d5a729ddfa4f30a1368"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JhP5ywIDVIZsDzit7WQrT4A4BtwNEav4toL+uSry+A3zUA9pgGNSy/KuKaKGyxhs4XvzA6ghNH9EWo9GrCvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:40:20.564446Z","bundle_sha256":"aa8ca525e7aa3c2203e3ccaa9de08cd6dae373e2f73132b1717d8e3c8b192250"}}