The conjecture on exactly six exceptional autonomous components

Let a Goldbach factorization graph be a graph associated with an even integer and let an exceptional autonomous component (EAC) denote the special source strongly connected component studied in the paper. The conjecture on exactly six exceptional autonomous components. There exist exactly six exceptional autonomous components of Goldbach factorization graphs. The paper reports six EACs in the checked range $n\leq 10^8$, but explicitly leaves the finiteness of the full set undetermined; the asserted global count is therefore open.