From 6e8ed732de5efd2d9cf96e49011c5b379005c62a Mon Sep 17 00:00:00 2001
From: Jakob <77287533+JakobCode@users.noreply.github.com>
Date: Fri, 17 Oct 2025 16:28:55 +0200
Subject: [PATCH] Update README.md

---
 README.md | 46 ++++++++++++++++++++++++----------------------
 1 file changed, 24 insertions(+), 22 deletions(-)

diff --git a/README.md b/README.md
index 2312fd4..95d8fda 100644
--- a/README.md
+++ b/README.md
@@ -3,28 +3,6 @@
 This repository contains the official python-based implementation accompanying the paper:  
 **“Average Kernel Sizes - Computable Sharp Accuracy Bounds for Inverse Problems”**  ([arXiv:2510.10229](https://arxiv.org/abs/2510.10229))
 
-If you use this software in your work, please cite our [preprint](https://arxiv.org/abs/2510.10229):
-
-```bibtex
-@article{gottschling2025average,
-  title={Average Kernel Sizes--Computable Sharp Accuracy Bounds for Inverse Problems},
-  author={Gottschling, Nina M and Iagaru, David and Gawlikowski, Jakob and Sgouralis, Ioannis},
-  journal={arXiv preprint arXiv:2510.10229},
-  year={2025}
-}
-```
-
-For the definition of the worst-case kernel size, see [preprint](https://arxiv.org/abs/2311.16898):
-
-```bibtex
-@article{gottschling2023existence,
-  title={On the existence of optimal multi-valued decoders and their accuracy bounds for undersampled inverse problems},
-  author={Gottschling, Nina Maria and Campodonico, Paolo and Antun, Vegard and Hansen, Anders C},
-  journal={arXiv preprint arXiv:2311.16898},
-  year={2023}
-}
-```
-
 ## Installation
 
 This project has been tested under **Python 3.7** on a Unix development environment.  
@@ -175,6 +153,30 @@ The following functions can be activated or deactivated :
 
 - metrics_opensrtest checks the consistency of the predictions with the results shown by [opensr-test](https://github.com/ESAOpenSR/opensr-test)
 
+
+
+If you use this software in your work, please cite our [preprint](https://arxiv.org/abs/2510.10229):
+
+```bibtex
+@article{gottschling2025average,
+  title={Average Kernel Sizes--Computable Sharp Accuracy Bounds for Inverse Problems},
+  author={Gottschling, Nina M and Iagaru, David and Gawlikowski, Jakob and Sgouralis, Ioannis},
+  journal={arXiv preprint arXiv:2510.10229},
+  year={2025}
+}
+```
+
+For the definition of the worst-case kernel size, see [preprint](https://arxiv.org/abs/2311.16898):
+
+```bibtex
+@article{gottschling2023existence,
+  title={On the existence of optimal multi-valued decoders and their accuracy bounds for undersampled inverse problems},
+  author={Gottschling, Nina Maria and Campodonico, Paolo and Antun, Vegard and Hansen, Anders C},
+  journal={arXiv preprint arXiv:2311.16898},
+  year={2023}
+}
+```
+
 - compute_LB_dists computes distances for the loss and the kernel size terms and stores them.
 
 - get_LB_loss_points displays the half Kernesize lower bound and the Loss terms.