diff --git a/docs/src/05-blog/997-graphframes-011-release.md b/docs/src/05-blog/997-graphframes-011-release.md
index 06a265719..4a0c60cd4 100644
--- a/docs/src/05-blog/997-graphframes-011-release.md
+++ b/docs/src/05-blog/997-graphframes-011-release.md
@@ -4,6 +4,8 @@
 - **Title:** GraphFrames 0.11.0 release
 - **Summary:** This release brings a new Connected Components algorithm based on Randomized Contraction, automatic Pregel optimization that skips unnecessary joins, graph embeddings via random walks with Word2Vec and Hash2Vec, a PySpark Property Graph API, approximate triangle counting with DataSketches, and various improvements.
 
+Want to try these features now? [Wherobots](https://www.wherobots.com/) is the only cloud platform shipping a modern version of GraphFrames. Sign up and start running graph algorithms right away — no setup required.
+
 ## Connected Components: new algorithm
 
 The Connected Components API now offers three algorithm choices: