**Abstract**

This file demonstrates an example of some of the functionalities of paperify.py. It allows you to generate nice looking PDFs and webpages directly from markdown. Clearly a work in progress.

__Theorem__: (Example)

Here's an example of a theorem: $a^2 + b^2 = c^2$
And a more complicated formula, but wrong:
$$ \int_a^b \sum_x^{\infty} \frac{\phi(x)}{1 + \lim_{x \rightarrow \infty} x^2} \equiv 2 $$
\qed

__Definition__:

A nice definition. But embedding a latex list
\begin{itemize}
\item item 1
\item item 2
\item item 3
\item item 4
\end{itemize}

__Corollary__:

A sweet corollary.

__Lemma__: (Example)

... and a lemma, of course.

__Note__:

A simple remark.

__Tip__:

Look at this tip !

A fully-fledged section.

Can have a bunch of these ones.

You get the idea.

Here is a footnote reference,^{1} and another.^{2}

Here's a citation [Arnold 2016a], and the same but twice [Arnold 2016a ; Arnold 2016b]. Note that all references will be appended automatically at then very end of your document body. Meaning you want to end with a section `# References`

. Finally, all references *need* to be in a `biblio.bib`

file at the same level of your main markdown file, and the ACM format will be used.

Here's an image of Albert, in Figure .

And here's a plot

And here's a graph

And here's a plot that's interactive in the browser, and high-quality on paper:

First | Last |
---|---|

Joe | Adams |

Adams | Joe |

Right | Left | Center | Default |
---|---|---|---|

12 | 12 | 12 | 12 |

123 | 123 | 123 | 123 |

1 | 1 | 1 | 1 |

Paperify.py will save your life. - Seb

```
\begin{algorithm}
\caption{Euclid’s algorithm}
\begin{algorithmic}
\Procedure{Euclid}{$a,b$} \Comment{The g.c.d. of a and b}
\State $r\gets a \text{mod} b$
\While{$r\neq0$} \Comment{We have the answer if r is 0}
\State $a \gets b$
\State $b \gets r$
\State $r \gets a \text{mod} b$
\EndWhile
\State \textbf{return} $b$\Comment{The gcd is b}
\EndProcedure
\end{algorithmic}
\end{algorithm}
```

Python:

```
from autograd import numpy as np
i = 23
class MPI(object):
def __init__(self, a):
self.a = a
f = lambda x: x**2
if __name__ == '__main__':
# Salut comment
a = chal(23)
assert(a is not None)
print('a is not None %d', i)
```

C:

```
#ifdef MACRO
const void *a = 0;
#endif MACRO
if (a && b) {
printf("Great !");
}
return 0;
```

JavaScript:

```
var j = function (a, b) {
return a + b;
};
```

S. Arnold. 2016a. A Greedy Algorithm to Cluster Specialists. *ArXiv e-prints* (September 2016).

S. Arnold. 2016b. A Greedy Algorithm to Cluster Specialists. *ArXiv e-prints* (September 2016).