diff --git a/README.md b/README.md
index f9fbdf7..c76bb5a 100644
--- a/README.md
+++ b/README.md
@@ -53,9 +53,6 @@ y_hat = predict(result.model, X)
 
 You can choose between three algorithms to solve the problem: `Opt`, `Alt`, and `BnB`. The `Opt` algorithm is the optimal one, but it is exponential in the number of partitions. The `Alt` algorithm is an iterative one, based on the Alternating Least Squares approach. The `BnB` algorithm is a variant of the `Opt` algorithm that is often faster in practice and still guarantees the optimal solution.
 
-
-# Additional Resources
-
 # Additional Resources
 
 For theoretical insights into PartitionedLS, please refer to [this paper](https://arxiv.org/abs/2006.16202).