{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4TXRKPSWBVPW63RGNI2OCX3SWG","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":"fd27aec60e754ff77c77a48041228adaa27673315c49a361ba59c864d2595835","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-19T09:42:36Z","title_canon_sha256":"c2f51515b5d2d555c4924372d0fdb6dbf8fd810758dbe1503baffab680224342"},"schema_version":"1.0","source":{"id":"1204.4298","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4298","created_at":"2026-05-18T03:29:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4298v3","created_at":"2026-05-18T03:29:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4298","created_at":"2026-05-18T03:29:13Z"},{"alias_kind":"pith_short_12","alias_value":"4TXRKPSWBVPW","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4TXRKPSWBVPW63RG","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4TXRKPSW","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:5c92cfb290e96abcb0639c1b6ff78d63503db8668bb5f12fb80721791291b38d","target":"graph","created_at":"2026-05-18T03:29:13Z","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 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","authors_text":"Jiuying Dong, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-19T09:42:36Z","title":"Rainbow connection number and independence number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4298","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:bc2575c4ce4d3db008e4f22e3711fbc7fa7991d91ecdfa3537b1026420a3a8f7","target":"record","created_at":"2026-05-18T03:29:13Z","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":"fd27aec60e754ff77c77a48041228adaa27673315c49a361ba59c864d2595835","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-19T09:42:36Z","title_canon_sha256":"c2f51515b5d2d555c4924372d0fdb6dbf8fd810758dbe1503baffab680224342"},"schema_version":"1.0","source":{"id":"1204.4298","kind":"arxiv","version":3}},"canonical_sha256":"e4ef153e560d5f6f6e266a34e15f72b1809040f62870f8bbd092118969cc872a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4ef153e560d5f6f6e266a34e15f72b1809040f62870f8bbd092118969cc872a","first_computed_at":"2026-05-18T03:29:13.886757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:13.886757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R4sM5uGfjz00z5wURjTeaEizx1RHCzCBt2SGoTuzy+pIqaTM8XfpzcvCMnjMlrY0wHqwrR88MfCjM2gmH8YkDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:13.887442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4298","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc2575c4ce4d3db008e4f22e3711fbc7fa7991d91ecdfa3537b1026420a3a8f7","sha256:5c92cfb290e96abcb0639c1b6ff78d63503db8668bb5f12fb80721791291b38d"],"state_sha256":"98cd2ce1e0dc7b21d2271963b6f31ff10daceed0b8dfd74de67fcb3a9bd15111"}