{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5KC5VKE56GZ5RXF4YML4B26O2U","short_pith_number":"pith:5KC5VKE5","schema_version":"1.0","canonical_sha256":"ea85daa89df1b3d8dcbcc317c0ebced53fbfcb112db7beabcdf17ed5374e8125","source":{"kind":"arxiv","id":"1105.4210","version":2},"attestation_state":"computed","paper":{"title":"Sharp upper bound for the rainbow connection numbers of 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sujuan Liu, Xueliang Li","submitted_at":"2011-05-21T03:20:39Z","abstract_excerpt":"An edge-colored graph $G$, where adjacent edges may be colored the same, is rainbow connected if any two vertices of $G$ are connected by a path whose edges have distinct colors. The rainbow connection number $rc(G)$ of a connected graph $G$ is the smallest number of colors that are needed in order to make $G$ rainbow connected. In this paper, we give a sharp upper bound that $rc(G)\\leq\\lceil\\frac{n}{2}\\rceil$ for any 2-connected graph $G$ of order $n$, which improves the results of Caro et al. to best possible."},"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":"1105.4210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-21T03:20:39Z","cross_cats_sorted":[],"title_canon_sha256":"ea281c49cfd7e7858a3184c723ba49fd0a921b6f2f9fe693c3570fe97ae279ed","abstract_canon_sha256":"33183dbd318190e772538f3dd6c8f380e784beffcaf5e2c6068adaec860c3e6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:13.211463Z","signature_b64":"w8GArMcfQUxMhd1WQF7nE5lpigXYbiefYA4FY/nxyBeGeoLeMeBv79sGhPNi5PdBzHxRWwQTTMRTETkDfrgyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea85daa89df1b3d8dcbcc317c0ebced53fbfcb112db7beabcdf17ed5374e8125","last_reissued_at":"2026-05-18T04:21:13.210857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:13.210857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp upper bound for the rainbow connection numbers of 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sujuan Liu, Xueliang Li","submitted_at":"2011-05-21T03:20:39Z","abstract_excerpt":"An edge-colored graph $G$, where adjacent edges may be colored the same, is rainbow connected if any two vertices of $G$ are connected by a path whose edges have distinct colors. The rainbow connection number $rc(G)$ of a connected graph $G$ is the smallest number of colors that are needed in order to make $G$ rainbow connected. In this paper, we give a sharp upper bound that $rc(G)\\leq\\lceil\\frac{n}{2}\\rceil$ for any 2-connected graph $G$ of order $n$, which improves the results of Caro et al. to best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4210","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.4210","created_at":"2026-05-18T04:21:13.210953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4210v2","created_at":"2026-05-18T04:21:13.210953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4210","created_at":"2026-05-18T04:21:13.210953+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KC5VKE56GZ5","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KC5VKE56GZ5RXF4","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KC5VKE5","created_at":"2026-05-18T12:26:20.644004+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/5KC5VKE56GZ5RXF4YML4B26O2U","json":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U.json","graph_json":"https://pith.science/api/pith-number/5KC5VKE56GZ5RXF4YML4B26O2U/graph.json","events_json":"https://pith.science/api/pith-number/5KC5VKE56GZ5RXF4YML4B26O2U/events.json","paper":"https://pith.science/paper/5KC5VKE5"},"agent_actions":{"view_html":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U","download_json":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U.json","view_paper":"https://pith.science/paper/5KC5VKE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4210&json=true","fetch_graph":"https://pith.science/api/pith-number/5KC5VKE56GZ5RXF4YML4B26O2U/graph.json","fetch_events":"https://pith.science/api/pith-number/5KC5VKE56GZ5RXF4YML4B26O2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U/action/storage_attestation","attest_author":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U/action/author_attestation","sign_citation":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U/action/citation_signature","submit_replication":"https://pith.science/pith/5KC5VKE56GZ5RXF4YML4B26O2U/action/replication_record"}},"created_at":"2026-05-18T04:21:13.210953+00:00","updated_at":"2026-05-18T04:21:13.210953+00:00"}