diff --git a/maxcut/README.MD b/maxcut/README.MD
index bd353c2..05ce94e 100644
--- a/maxcut/README.MD
+++ b/maxcut/README.MD
@@ -2,7 +2,7 @@
 
 The cut size [9,553](https://github.com/dynexcoin/DynexSDK/blob/main/maxcut/maxcut_best_9553.pkl) for [G70](https://web.stanford.edu/~yyye/yyye/Gset/) found by Dynex is the best-known MaxCut than previous reported results on June 8th 2024. The previous record of 9,541 was found using a special purpose algorithm designed for MaxCut ([Breakout Local Search for the Max-Cut problem](https://www.researchgate.net/publication/257392755_Breakout_Local_Search_for_the_Max-Cutproblem)) in 2013. It is worth noting that an increase of one better cut involves an exponentially increasing complexity. 
 
-## Validating the solution
+## Validating the MaxCut solution of 9,553
 
 The solutions in this repository can be easily validated with the provided [Jupyter Notebook](https://github.com/dynexcoin/DynexSDK/blob/main/maxcut/g70solutionvalidator.ipynb) or by using the following lines of code: