{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4TXRKPSWBVPW63RGNI2OCX3SWG","short_pith_number":"pith:4TXRKPSW","schema_version":"1.0","canonical_sha256":"e4ef153e560d5f6f6e266a34e15f72b1809040f62870f8bbd092118969cc872a","source":{"kind":"arxiv","id":"1204.4298","version":3},"attestation_state":"computed","paper":{"title":"Rainbow connection number and independence number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiuying Dong, Xueliang Li","submitted_at":"2012-04-19T09:42:36Z","abstract_excerpt":"Let $G$ be an edge-colored connected graph. A path of $G$ is called rainbow if its every edge is colored by a distinct color. $G$ is called rainbow connected if there exists a rainbow path between every two vertices of $G$. The minimum number of colors that are needed to make $G$ rainbow connected is called the rainbow connection number of $G$, denoted by $rc(G)$. In this paper, we investigate the relation between the rainbow connection number and the independence number of a graph. We show that if $G$ is a connected graph, then $rc(G)\\leq 2\\alpha(G)-1$. Two examples $G$ are given to show that"},"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":"1204.4298","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-19T09:42:36Z","cross_cats_sorted":[],"title_canon_sha256":"c2f51515b5d2d555c4924372d0fdb6dbf8fd810758dbe1503baffab680224342","abstract_canon_sha256":"fd27aec60e754ff77c77a48041228adaa27673315c49a361ba59c864d2595835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:13.887442Z","signature_b64":"R4sM5uGfjz00z5wURjTeaEizx1RHCzCBt2SGoTuzy+pIqaTM8XfpzcvCMnjMlrY0wHqwrR88MfCjM2gmH8YkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ef153e560d5f6f6e266a34e15f72b1809040f62870f8bbd092118969cc872a","last_reissued_at":"2026-05-18T03:29:13.886757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:13.886757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow connection number and independence number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiuying Dong, Xueliang Li","submitted_at":"2012-04-19T09:42:36Z","abstract_excerpt":"Let $G$ be an edge-colored connected graph. A path of $G$ is called rainbow if its every edge is colored by a distinct color. $G$ is called rainbow connected if there exists a rainbow path between every two vertices of $G$. The minimum number of colors that are needed to make $G$ rainbow connected is called the rainbow connection number of $G$, denoted by $rc(G)$. In this paper, we investigate the relation between the rainbow connection number and the independence number of a graph. We show that if $G$ is a connected graph, then $rc(G)\\leq 2\\alpha(G)-1$. Two examples $G$ are given to show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4298","kind":"arxiv","version":3},"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":"1204.4298","created_at":"2026-05-18T03:29:13.886865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4298v3","created_at":"2026-05-18T03:29:13.886865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4298","created_at":"2026-05-18T03:29:13.886865+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TXRKPSWBVPW","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TXRKPSWBVPW63RG","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TXRKPSW","created_at":"2026-05-18T12:26:53.410803+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/4TXRKPSWBVPW63RGNI2OCX3SWG","json":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG.json","graph_json":"https://pith.science/api/pith-number/4TXRKPSWBVPW63RGNI2OCX3SWG/graph.json","events_json":"https://pith.science/api/pith-number/4TXRKPSWBVPW63RGNI2OCX3SWG/events.json","paper":"https://pith.science/paper/4TXRKPSW"},"agent_actions":{"view_html":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG","download_json":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG.json","view_paper":"https://pith.science/paper/4TXRKPSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4298&json=true","fetch_graph":"https://pith.science/api/pith-number/4TXRKPSWBVPW63RGNI2OCX3SWG/graph.json","fetch_events":"https://pith.science/api/pith-number/4TXRKPSWBVPW63RGNI2OCX3SWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/action/storage_attestation","attest_author":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/action/author_attestation","sign_citation":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/action/citation_signature","submit_replication":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/action/replication_record"}},"created_at":"2026-05-18T03:29:13.886865+00:00","updated_at":"2026-05-18T03:29:13.886865+00:00"}