{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JFVKMKZLIRI3LE6JU6T3JGCCMS","short_pith_number":"pith:JFVKMKZL","schema_version":"1.0","canonical_sha256":"496aa62b2b4451b593c9a7a7b4984264bcd17f25c84df6723aa43b1e804c7600","source":{"kind":"arxiv","id":"1010.2296","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.2296","created_at":"2026-05-18T04:02:01.936765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2296v1","created_at":"2026-05-18T04:02:01.936765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2296","created_at":"2026-05-18T04:02:01.936765+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFVKMKZLIRI3","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFVKMKZLIRI3LE6J","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFVKMKZL","created_at":"2026-05-18T12:26:09.077623+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/JFVKMKZLIRI3LE6JU6T3JGCCMS","json":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS.json","graph_json":"https://pith.science/api/pith-number/JFVKMKZLIRI3LE6JU6T3JGCCMS/graph.json","events_json":"https://pith.science/api/pith-number/JFVKMKZLIRI3LE6JU6T3JGCCMS/events.json","paper":"https://pith.science/paper/JFVKMKZL"},"agent_actions":{"view_html":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS","download_json":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS.json","view_paper":"https://pith.science/paper/JFVKMKZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2296&json=true","fetch_graph":"https://pith.science/api/pith-number/JFVKMKZLIRI3LE6JU6T3JGCCMS/graph.json","fetch_events":"https://pith.science/api/pith-number/JFVKMKZLIRI3LE6JU6T3JGCCMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/action/storage_attestation","attest_author":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/action/author_attestation","sign_citation":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/action/citation_signature","submit_replication":"https://pith.science/pith/JFVKMKZLIRI3LE6JU6T3JGCCMS/action/replication_record"}},"created_at":"2026-05-18T04:02:01.936765+00:00","updated_at":"2026-05-18T04:02:01.936765+00:00"}