Today’s social networks continuously generate massive streams of data, which provide a valuable starting point for the detection rumours as soon they start to propagate. However, rumour faces tight latency bounds, cannot be met by contemporary algorithms, given sheer volume high-velocity streaming data emitted networks. Hence, in this paper, we argue best-effort that detects most quickly rather...