{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5BPQHXZNIO4HTEV3WRHXC4FE7J","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":"112ea4225261c9594aa30e34adbd95d10e701aa6d94fec41837ecd082234b755","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-07T05:06:47Z","title_canon_sha256":"5f5dc4006701268549ef54ccc45e2fd7c850080bd50a5e67dd9f2c9257f728ef"},"schema_version":"1.0","source":{"id":"1106.1258","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1258","created_at":"2026-05-18T04:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1258v3","created_at":"2026-05-18T04:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1258","created_at":"2026-05-18T04:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"5BPQHXZNIO4H","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5BPQHXZNIO4HTEV3","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5BPQHXZN","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:9af9ea976bbe075f841fd9193f378f03df35c332fa0d6ce13f95fe1ced51852f","target":"graph","created_at":"2026-05-18T04:12:32Z","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 \\emph{rainbow connection number $rc(G)$} of a graph $G$ was recently introduced by Chartrand et al. Li et al. proved that for every bridgeless graph $G$ with diameter 2, $rc(G)\\leq 5$. They gave examples for which $rc(G)\\leq 4$. However, they could not show that the upper bound 5 is sharp. It is known that for a graph $G$ with diameter 2, to determine $rc(G)$ is NP-hard. So, it is interesting to know the best upper bound of $rc(G)$ for such a graph $G$. In this paper, we use different way to obtain the same upper bound, and moreover, examples are given to show","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-06-07T05:06:47Z","title":"Sharp upper bound for the rainbow connection number of a graph with diameter 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1258","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:5f8c7230a62fc1d8591776a9889175fab60261fc15afc4a44e6d6bdab1ee8c4c","target":"record","created_at":"2026-05-18T04:12:32Z","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":"112ea4225261c9594aa30e34adbd95d10e701aa6d94fec41837ecd082234b755","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-07T05:06:47Z","title_canon_sha256":"5f5dc4006701268549ef54ccc45e2fd7c850080bd50a5e67dd9f2c9257f728ef"},"schema_version":"1.0","source":{"id":"1106.1258","kind":"arxiv","version":3}},"canonical_sha256":"e85f03df2d43b87992bbb44f7170a4fa77f8f1ae0a20995dd663fb4ccf38ffff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e85f03df2d43b87992bbb44f7170a4fa77f8f1ae0a20995dd663fb4ccf38ffff","first_computed_at":"2026-05-18T04:12:32.120868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:32.120868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Ret8h+xppfs8lU2dI7In8PHXeo3Vn8qavn7GYIO/NMg9/DOJzMFkqCfXJDWMZB6OW+grNkBceobEnNs4cnUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:32.121434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1258","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f8c7230a62fc1d8591776a9889175fab60261fc15afc4a44e6d6bdab1ee8c4c","sha256:9af9ea976bbe075f841fd9193f378f03df35c332fa0d6ce13f95fe1ced51852f"],"state_sha256":"c7812c05f24088748f0720e1c8060f235a4d442f4d97769f35132db85a09e014"}