updated papers

index.html

@@ -139,11 +139,14 @@ <h1 id="curr-work">How does Bayan compare with other community detection methods
 		<h1 id="curr-work">Interested to learn more? Check out our two manuscripts below.</h1>
 		<div id="curr-work-div">
 			<ul>
+				<li>
+					Samin Aref and Mahdi Mostajabdaveh. "Analyzing modularity maximization in approximation, heuristic, and graph neural network algorithms for community detection." ArXiv, 2023 <a href="https://arxiv.org/pdf/2310.10898">Preprint</a>
+				</li>
 				<li>
 					Samin Aref, Mahdi Mostajabdaveh, and Hriday Chheda. "Heuristic modularity maximization algorithms for community detection rarely return an optimal partition or anything similar." in Computational Science - ICCS 2023, LNCS 10476, Springer, 2023 <a href="https://doi.org/10.1007/978-3-031-36027-5_48">doi.org/10.1007/978-3-031-36027-5_48</a> <a href="https://arxiv.org/pdf/2302.14698">Preprint</a>
 				</li>
 				<li>
-					Samin Aref, Hriday Chheda, and Mahdi Mostajabdaveh. "The Bayan algorithm: detecting communities in networks through exact and approximate optimization of modularity." <a href="https://arxiv.org/pdf/2209.04562">ArXiv preprint 2209.04562</a>
+					Samin Aref, Hriday Chheda, and Mahdi Mostajabdaveh. "The Bayan algorithm: detecting communities in networks through exact and approximate optimization of modularity." ArXiv, 2022 <a href="https://arxiv.org/pdf/2209.04562">Preprint</a>
 				</li>
 			</section>
 			<section id = "current-work">