\begingroup\small \begin{thebibliography}{9} \bibitem{AM} J. Abbott, N. Mexis, \emph{Cyclotomic Factors and LRS-Degeneracy}, \href{https://arxiv.org/abs/2403.08751v5}{arXiv:2403.08751v5} (19 June 2026). Specific reference: \S4.1.2--4.1.3 and Algorithm 3. \bibitem{BGW} T. Bogart, J. Goodrick, K. Woods, \emph{Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior}, Discrete Analysis 2017:4. \href{https://doi.org/10.19086/da.1254}{doi:10.19086/da.1254}. Version consulted: \href{https://arxiv.org/abs/1608.08520v2}{arXiv:1608.08520v2}, Theorem 1.15 and Corollary 1.16. \bibitem{BH} M. Beck, S. Ho\c sten, \emph{Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices}, Mathematical Research Letters 13 (2006), 607--622. Version consulted: \href{https://arxiv.org/abs/math/0508136v4}{arXiv:math/0508136v4}, Propositions 4--6 and Theorems 7, 13. \bibitem{MR} J. L. Martin, V. Reiner, \emph{Cyclotomic and simplicial matroids}, Israel Journal of Mathematics 150 (2005), 229--240. Version consulted: \href{https://arxiv.org/abs/math/0402206v1}{arXiv:math/0402206v1}, Theorem 1, Corollary 2, Remark 6, and \S2--3. \bibitem{DCL} L. De Carli, M. Laporta, \emph{Divisibility criteria and coefficient formulas for cyclotomic polynomials}, The Ramanujan Journal 70, article 44 (2026). \href{https://doi.org/10.1007/s11139-026-01421-6}{doi:10.1007/s11139-026-01421-6}. Comparison based on: \href{https://arxiv.org/abs/2508.02722v1}{arXiv:2508.02722v1}, Theorem 1.1. \bibitem{Steinberger} J. P. Steinberger, \emph{The lowest-degree polynomial with nonnegative coefficients divisible by the $n$-th cyclotomic polynomial}, The Electronic Journal of Combinatorics 19(4), P1 (2012). \href{https://doi.org/10.37236/2755}{doi:10.37236/2755}. The 18-page journal-distributed text, Theorem 1 and \S2 (Lemma 1 and Proposition 1). The PDF retains provisional headers; bibliographic data follow the journal record. \bibitem{Reddy} A. Satyanarayana Reddy, \emph{The lowest degree $0,1$-polynomial divisible by cyclotomic polynomial}, \href{https://arxiv.org/abs/1106.1271v2}{arXiv:1106.1271v2} (2011). \S1--2: $0,1$ multiples with at least three terms and minimal vanishing sums. \bibitem{MOS} M. J. Mossinghoff, \emph{Polynomials with Restricted Coefficients and Prescribed Noncyclotomic Factors}, LMS Journal of Computation and Mathematics 6 (2003), 314--325. \href{https://doi.org/10.1112/S1461157000000474}{doi:10.1112/S1461157000000474}. \S2.1--2.2, Algorithms 1--2. \bibitem{CH} D. Chistikov, C. Haase, \emph{The Taming of the Semi-Linear Set}, ICALP 2016, LIPIcs 55, article 128. \href{https://doi.org/10.4230/LIPIcs.ICALP.2016.128}{doi:10.4230/LIPIcs.ICALP.2016.128}. Publisher version corrected on 26 October 2016, pp.~128:1--128:14, Proposition 5, pp.~128:5--128:6. \end{thebibliography} \endgroup