Table 2.

Summary of which new results in this paper generalize the prior results from Meshkat and Sullivant (2014) and Meshkat et al. (2015)

Prior result	New result	Explanation
Theorem 1.2 of Meshkat and Sullivant (2014)	Theorem 3.13	Generalizes conditions for identifiable cycle model to identifiable path/cycle model
Theorem 5 from Meshkat et al. (2015)	Theorem 3.19	Generalizes removing leaks to obtain identifiability
Theorem 5.13 from Meshkat and Sullivant (2014)	Theorem 3.22	Generalizes inductively strongly connected to almost inductively strongly connected
Proposition 5.4 from Meshkat and Sullivant (2014)	Proposition 3.29	Generalizes identifiable cycle to identifiable path
Proposition 5.5 from Meshkat and Sullivant (2014)	Proposition 3.30	Generalizes adding a new vertex
Proposition 5.3 from Meshkat and Sullivant (2014)	Theorems 6.3 and 6.4	Generalizes necessary condition of having an exchange to having a path