documentclass[letterpaper]{article}
usepackage{aaai18}
usepackage[utf8]{inputenc}
usepackage[numbers]{natbib}
usepackage{lipsum}
usepackage{amsmath}
usepackage{amsthm}

title{
My Good Title}
author{John Doe\
Technologies Institute \
Some University \
Springfield, PA 12345\
}


begin{document}
maketitle
begin{abstract}
    lipsum[1]
end{abstract}
section{introduction}
lipsum[2]
section{Methods}
lipsum[3]
%bibliographystyle{aaai.bst}
%bibliography{hrg}

include{supplement}

end{document}

setcounter{equation}{0}
setcounter{figure}{0}
setcounter{table}{0}
setcounter{page}{1}
% makeatletter
renewcommand{theequation}{Sarabic{equation}}
renewcommand{thefigure}{Sarabic{figure}}
renewcommand{bibnumfmt}[1]{[S#1]}
renewcommand{citenumfont}[1]{S#1}
renewcommand{citenumfont}[1]{textit{#1}}
%%%%%%%%%% Prefix a "S" to all equations, figures, tables and reset the counter

begin{center}
textbf{large Supplemental Materials: A far more interesting title like\
Latent-Variable Probabilistic Widgets}
end{center}

section{Tree Explosions, it's real}
More formally, given a graph $H = (V,E)$, a emph{tree decomposition} is a tree whose nodes, called emph{bags}, are labeled with subsets of $V$, in such a way that the following properties are satisfied:
begin{itemize}
item For each node $v in V$, there is a bag $eta$ that contains $v$.
item For each edge $(u,v) in E$, there is a bag $eta$ that contains $u$ and $v$.
item If bags $eta$ and $eta^prime$ contain $v$, then all the bags on the path from $eta$ to $eta^prime$ also contain $v$.
end{itemize}