docs: revert note removal

Signed-off-by: Athan <[email protected]>

Author: kgryte

lib/node_modules/@stdlib/stats/base/smeanpw/README.md

@@ -132,6 +132,7 @@ var v = smeanpw.ndarray( 4, x, 2, 1 );
 ## Notes
 
 -   If `N <= 0`, both functions return `NaN`.
+-   In general, pairwise summation is more numerically stable than ordinary recursive summation (i.e., "simple" summation), with slightly worse performance. While not the most numerically stable summation technique (e.g., compensated summation techniques such as the Kahan–Babuška-Neumaier algorithm are generally more numerically stable), pairwise summation strikes a reasonable balance between numerical stability and performance. If either numerical stability or performance is more desirable for your use case, consider alternative summation techniques.
 
 </section>