From 3d818b2861faf0ccdbcb2eeb6ac90a07f4e4374a Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Mon, 18 May 2015 16:15:36 +0200
Subject: Pass on results section

---
 paper/sections/intro.tex | 1 -
 1 file changed, 1 deletion(-)

(limited to 'paper/sections/intro.tex')

diff --git a/paper/sections/intro.tex b/paper/sections/intro.tex
index 4c18faf..c89c641 100644
--- a/paper/sections/intro.tex
+++ b/paper/sections/intro.tex
@@ -72,7 +72,6 @@ be sufficient to recover the graph~\cite{donoho2006compressed, candes2006near}.
 However, the best known upper bound to this day is $\O(s^2\log
 m)$~\cite{Netrapalli:2012, Daneshmand:2014}
 
-
 The contributions of this paper are the following:
 \begin{itemize}
     \item we formulate the Graph Inference problem in the context of
-- 
cgit v1.2.3-70-g09d2

