{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:J5CANQY4DDRCBMU4LYXNXAKVUT","short_pith_number":"pith:J5CANQY4","canonical_record":{"source":{"id":"1011.0620","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-02T13:56:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6964602fa001210b4aeab533da71e115cb03bc5d2086404f3f0c68698eb535cf","abstract_canon_sha256":"bbdd429a3758bae47efcb2d091fe16d6de384eebd05f0ea302dc3df6b67a5f0a"},"schema_version":"1.0"},"canonical_sha256":"4f4406c31c18e220b29c5e2edb8155a4d3fea860dbd89c584dde4cbf10733f95","source":{"kind":"arxiv","id":"1011.0620","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0620","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0620v2","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0620","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"J5CANQY4DDRC","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"J5CANQY4DDRCBMU4","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"J5CANQY4","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:J5CANQY4DDRCBMU4LYXNXAKVUT","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0620","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-02T13:56:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6964602fa001210b4aeab533da71e115cb03bc5d2086404f3f0c68698eb535cf","abstract_canon_sha256":"bbdd429a3758bae47efcb2d091fe16d6de384eebd05f0ea302dc3df6b67a5f0a"},"schema_version":"1.0"},"canonical_sha256":"4f4406c31c18e220b29c5e2edb8155a4d3fea860dbd89c584dde4cbf10733f95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:53.467046Z","signature_b64":"ihVP6mGOKoJBDJM1PUkkjgZsO/LBCsN/EMGJxEI8IhyEjCg1oRvefYPgnYuSI7AoeivqQjBFmu3obR4ZQaNUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f4406c31c18e220b29c5e2edb8155a4d3fea860dbd89c584dde4cbf10733f95","last_reissued_at":"2026-05-18T03:45:53.466293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:53.466293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0620","source_version":2,"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-18T03:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P7nRsCvnMms++1MLTHeMHmhVPF3jGvSa0zdFfYfowmTj9i1+KOIo25gko6wZNMmxp8zlKYw4Y8QQbTlJ0wh7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:11:25.556278Z"},"content_sha256":"d4a3db8ef944ef1ada5a532efbf735f54f76d1d1de13b327dd8f1fd93b06ba03","schema_version":"1.0","event_id":"sha256:d4a3db8ef944ef1ada5a532efbf735f54f76d1d1de13b327dd8f1fd93b06ba03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:J5CANQY4DDRCBMU4LYXNXAKVUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow Connection Number and Radius","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Arunselvan Ramaswamy, Deepak Rajendraprasad, L. Sunil Chandran, Manu Basavaraju","submitted_at":"2010-11-02T13:56:26Z","abstract_excerpt":"The rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of its vertices is connected by at least one path in which no two edges are coloured the same. In this note we show that for every bridgeless graph G with radius r, rc(G) <= r(r + 2). We demonstrate that this bound is the best possible for rc(G) as a function of r, not just for bridgeless graphs, but also for graphs of any stronger connectivity. It may be noted that for a general 1-connected graph G, rc(G) can be arbitrarily larger than its radius (Star g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0620","kind":"arxiv","version":2},"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-18T03:45:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QF4kjsv8Dll4lo7Z/DZcwB4nuZNwuMDAIyLclynFtXWSZLgS6bn/ZPEZuof0Yk27NW4LcJ3n0KOWUq+WM1OkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:11:25.556640Z"},"content_sha256":"b12a03da07424af8ad42346b5ee567a9632a35c36abb0875cac8c17064a98b45","schema_version":"1.0","event_id":"sha256:b12a03da07424af8ad42346b5ee567a9632a35c36abb0875cac8c17064a98b45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5CANQY4DDRCBMU4LYXNXAKVUT/bundle.json","state_url":"https://pith.science/pith/J5CANQY4DDRCBMU4LYXNXAKVUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5CANQY4DDRCBMU4LYXNXAKVUT/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-02T14:11:25Z","links":{"resolver":"https://pith.science/pith/J5CANQY4DDRCBMU4LYXNXAKVUT","bundle":"https://pith.science/pith/J5CANQY4DDRCBMU4LYXNXAKVUT/bundle.json","state":"https://pith.science/pith/J5CANQY4DDRCBMU4LYXNXAKVUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5CANQY4DDRCBMU4LYXNXAKVUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:J5CANQY4DDRCBMU4LYXNXAKVUT","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":"bbdd429a3758bae47efcb2d091fe16d6de384eebd05f0ea302dc3df6b67a5f0a","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-02T13:56:26Z","title_canon_sha256":"6964602fa001210b4aeab533da71e115cb03bc5d2086404f3f0c68698eb535cf"},"schema_version":"1.0","source":{"id":"1011.0620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0620","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0620v2","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0620","created_at":"2026-05-18T03:45:53Z"},{"alias_kind":"pith_short_12","alias_value":"J5CANQY4DDRC","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"J5CANQY4DDRCBMU4","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"J5CANQY4","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:b12a03da07424af8ad42346b5ee567a9632a35c36abb0875cac8c17064a98b45","target":"graph","created_at":"2026-05-18T03:45:53Z","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":"The rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of its vertices is connected by at least one path in which no two edges are coloured the same. In this note we show that for every bridgeless graph G with radius r, rc(G) <= r(r + 2). We demonstrate that this bound is the best possible for rc(G) as a function of r, not just for bridgeless graphs, but also for graphs of any stronger connectivity. It may be noted that for a general 1-connected graph G, rc(G) can be arbitrarily larger than its radius (Star g","authors_text":"Arunselvan Ramaswamy, Deepak Rajendraprasad, L. Sunil Chandran, Manu Basavaraju","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-02T13:56:26Z","title":"Rainbow Connection Number and Radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0620","kind":"arxiv","version":2},"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:d4a3db8ef944ef1ada5a532efbf735f54f76d1d1de13b327dd8f1fd93b06ba03","target":"record","created_at":"2026-05-18T03:45:53Z","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":"bbdd429a3758bae47efcb2d091fe16d6de384eebd05f0ea302dc3df6b67a5f0a","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2010-11-02T13:56:26Z","title_canon_sha256":"6964602fa001210b4aeab533da71e115cb03bc5d2086404f3f0c68698eb535cf"},"schema_version":"1.0","source":{"id":"1011.0620","kind":"arxiv","version":2}},"canonical_sha256":"4f4406c31c18e220b29c5e2edb8155a4d3fea860dbd89c584dde4cbf10733f95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f4406c31c18e220b29c5e2edb8155a4d3fea860dbd89c584dde4cbf10733f95","first_computed_at":"2026-05-18T03:45:53.466293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:53.466293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ihVP6mGOKoJBDJM1PUkkjgZsO/LBCsN/EMGJxEI8IhyEjCg1oRvefYPgnYuSI7AoeivqQjBFmu3obR4ZQaNUBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:53.467046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4a3db8ef944ef1ada5a532efbf735f54f76d1d1de13b327dd8f1fd93b06ba03","sha256:b12a03da07424af8ad42346b5ee567a9632a35c36abb0875cac8c17064a98b45"],"state_sha256":"d8f9c56b9b4e9656723609b2a64865403766a47508d204ba8420b2a13efa866a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hi8GG1AJRvrb0PJ+Aq9q40KND6i0i9FShyd1wJK8uKkso12mMlvqqbM5K0z+FIZfq249IQ0N9lL76iDkkp37DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:11:25.558500Z","bundle_sha256":"eafd4eed5f61bf349a4d059da29b06e9416369cb74c5f1d56ee9d669a203e9db"}}