GIN [1]} with edge weights is applied as an encoder for the graph classification task. It can be formally denoted as,
\(\mathbf {h}_{v}^{(k)}=\textit {MLP}_{\Theta }\left((1+\epsilon ) \cdot \mathbf {h}_{v}^{(k-1)} + \sum _{u \in \mathcal {N}_v} e_{u, v} \cdot \mathbf {h}_{u}^{(k-1)}\right)\) 
