{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4TXRKPSWBVPW63RGNI2OCX3SWG","short_pith_number":"pith:4TXRKPSW","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"},"canonical_sha256":"e4ef153e560d5f6f6e266a34e15f72b1809040f62870f8bbd092118969cc872a","source":{"kind":"arxiv","id":"1204.4298","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4TXRKPSWBVPW63RGNI2OCX3SWG","target":"record","payload":{"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"},"canonical_sha256":"e4ef153e560d5f6f6e266a34e15f72b1809040f62870f8bbd092118969cc872a","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"},"source_kind":"arxiv","source_id":"1204.4298","source_version":3,"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:29:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGYCbVF7xBIQv6CsnMsyQNk0qoImUhSuwU1DUOKLTnIeFrH0o0fE+5b1ok4lZj2NeBWcEK5O1c1LOVJ+51EcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:42.075871Z"},"content_sha256":"bc2575c4ce4d3db008e4f22e3711fbc7fa7991d91ecdfa3537b1026420a3a8f7","schema_version":"1.0","event_id":"sha256:bc2575c4ce4d3db008e4f22e3711fbc7fa7991d91ecdfa3537b1026420a3a8f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4TXRKPSWBVPW63RGNI2OCX3SWG","target":"graph","payload":{"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"},"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:29:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJhyMePfgmEQngFLdfXRmUQij3RJAZy56o6DuBud68c7iGyTt/OiFM56YRqPPcEXncsL1q6jJXoJAPKWJTkOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:42.076203Z"},"content_sha256":"5c92cfb290e96abcb0639c1b6ff78d63503db8668bb5f12fb80721791291b38d","schema_version":"1.0","event_id":"sha256:5c92cfb290e96abcb0639c1b6ff78d63503db8668bb5f12fb80721791291b38d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/bundle.json","state_url":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/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-01T15:55:42Z","links":{"resolver":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG","bundle":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/bundle.json","state":"https://pith.science/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TXRKPSWBVPW63RGNI2OCX3SWG/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKP7oDZWUyIhXCjSDTkhX8SGvY6f2ZOEkrdoocteyF/M60ChVAsKX29QON3iFPIP9digAT1NOpY3HjSSvzaZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:55:42.077977Z","bundle_sha256":"c356238725ef67520d320e23f3d6594c44adc241112d8a62ae2088b18b2d84ea"}}