fixed some refs

joss/paper.bib

@@ -45,7 +45,7 @@ @article{kaye22_libdlr
 }
 
 @article{kaye23_eqdyson,
-author = {Kaye, Jason and U. R. Strand, Hugo},
+author = {Kaye, Jason and Strand, Hugo U. R.},
 title = {A Fast Time Domain Solver for the Equilibrium Dyson Equation},
 year = {2023},
 _issue_date = {Aug 2023},
@@ -65,7 +65,7 @@ @article{kaye23_eqdyson
 
 @misc{kaye23_diagrams,
       title={Decomposing imaginary time Feynman diagrams using separable basis functions: Anderson impurity model strong coupling expansion}, 
-      author={Jason Kaye and Hugo U. R. Strand and Denis Golež},
+      author={Jason Kaye and Hugo U. R. Strand and Denis Gole{\v z}},
       year={2023},
       eprint={2307.08566},
       archivePrefix={arXiv},
@@ -252,20 +252,23 @@ @misc{pydlr
 
 @misc{libdlr,
 	author = {Kaye, Jason and Strand, Hugo U. R.},
-    journal = {GitHub repository},
+  journal = {GitHub repository},
 	url = {https://github.com/jasonkaye/libdlr},
 	title = {libdr: Imaginary time calculations using the Discrete Lehmann
 	Representation (DLR)},
-  	publisher = {GitHub},
-	year = {2021}}
+  publisher = {GitHub},
+	year = {2021}
+  }
 
 @misc{Lehmann.jl,
-    journal = {GitHub repository},
-  	publisher = {GitHub},
+  author = {Chen, Kun},
+  journal = {GitHub repository},
+  publisher = {GitHub},
 	title = {Lehmann.jl},
 	url = {https://github.com/numericaleft/Lehmann.jl},
 	title = {Julia implementation of the discrete Lehmann representation (DLR)},
-	year = {2021}}
+	year = {2021}
+  }
 
 @misc{cppdlr_git,
 	author = {Kaye, Jason and Wentzell, Nils and Strand, Hugo U. R.},
@@ -283,8 +286,8 @@ @misc{cppdlr_doc
 	year = {2023}}
 
 @misc{nda,
-    journal = {GitHub repository},
-  	publisher = {GitHub},
+  journal = {GitHub repository},
+  ublisher = {GitHub},
 	url = {https://github.com/TRIQS/nda},
 	title = {nda: C++ library for multi-dimensional arrays}}
 

joss/paper.md

@@ -56,7 +56,7 @@ intermediate representation (IR) was introduced first, and used the singular val
 decomposition to obtain an orthogonal but non-explicit basis of imaginary time
 Green's functions [@shinaoka17; @chikano18]. The recently-introduced discrete Lehmann representation (DLR) uses the
 interpolative decomposition to obtain a non-orthogonal basis consisting of known
-exponential functions [@kaye22_dlr]. The number of basis functions required in both representations is similar, and typically significantly less than the previous state-of-the art methods based on orthogonal polynomials [@bohenke11; @gull18; @dong20].
+exponential functions [@kaye22_dlr]. The number of basis functions required in both representations is similar, and typically significantly less than the previous state-of-the art methods based on orthogonal polynomials [@boehnke11; @gull18; @dong20].
 
 The DLR's use of an explicit basis of simple functions makes many common operations,
 including interpolation, integration, Fourier transform, and convolution, simple and