\begin{thebibliography}{99}

\bibitem{BKK} J. Bayless, P. Kinlaw and D. Klyve, \emph{Sums over primitive sets with a fixed number of prime factors}, Math. Comp. \textbf{88}
 (2019), 3063--3077.

\bibitem{BMOR18} M. A. Bennett, G. Martin, K. O'Bryant and A. Rechnitzer, \emph{Explicit bounds for primes in arithmetic progressions},
 Illinois J. Math. \textbf{62} (2018), 427--532; arXiv:1802.00085.

\bibitem{BMOR21} M. A. Bennett, G. Martin, K. O'Bryant and A. Rechnitzer, \emph{Counting zeros of Dirichlet $L$-functions}, Math. Comp.
 \textbf{90} (2021), 1455--1482.

\bibitem{BJS} M. Bordignon, D. R. Johnston and V. Starichkova, \emph{An explicit version of Chen's theorem and the linear sieve}, Int. J. Number
 Theory \textbf{21} (2025), no.~10, 2497--2572; arXiv:2207.09452. Theorem, lemma, corollary, table and equation numbers here are those of
 arXiv v6.

\bibitem{BSGRH} M. Bordignon and V. Starichkova, \emph{An explicit version of Chen's theorem assuming the Generalized Riemann Hypothesis},
 Ramanujan J. \textbf{64} (2024), no.~4, 1213--1242; arXiv:2211.08844v1 (2022). Lemma, theorem and corollary numbers here are those of
 arXiv v1: we cite Lemma~3 and Corollary~1, which follows from Theorem~3. The published version keeps Theorem~3 and Corollary~1 and states
 them for $N > \exp(\exp(14))$; the threshold $\exp(\exp(15.85))$ of arXiv v1 suffices here.

\bibitem{Campbell} P. J. Campbell, \emph{A sharper explicit result for the sum of two almost primes}, arXiv:2608.09488v1 (2026).

\bibitem{Chen} J.-R. Chen, \emph{On the representation of a larger even integer as the sum of a prime and the product of at most two primes},
 Sci. Sinica \textbf{16} (1973), 157--176.

\bibitem{Davenport} H. Davenport, \emph{Multiplicative Number Theory}, 3rd ed., Springer, 2000.

\bibitem{deMorais} G. de Morais, \emph{Goldbach-type sums $a + b = N$ with $\Omega(ab) \le 32$}, Zenodo deposit, doi:10.5281/zenodo.23456153 (2026); submitted, not peer reviewed.

\bibitem{Dusart} P. Dusart, \emph{Estimates of some functions over primes without R.H.}, arXiv:1002.0442 (2010); published as \emph{Explicit
 estimates of some functions over primes}, Ramanujan J. \textbf{45} (2018), 227--251. We cite the numbering of the arXiv version.

\bibitem{Erdos35} P. Erd\H{o}s, \emph{On the normal number of prime factors of $p - 1$ and some related problems concerning Euler's
 $\varphi$-function}, Quart. J. Math. \textbf{6} (1935), 205--213.

\bibitem{EHP} A.-M. Ernvall-Hyt\"onen and N. Paloj\"arvi, \emph{Explicit bound for the number of primes in arithmetic progressions assuming the
 generalized Riemann hypothesis}, Math. Comp. \textbf{91} (2022), no.~335, 1317--1365.

\bibitem{Fan} K. (S.) Fan, \emph{The Hardy--Ramanujan inequality for sifted sets and its applications}, arXiv:2508.06005v3 (2025).

\bibitem{FanRough} K. (S.) Fan, \emph{Numerically explicit estimates for the distribution of rough numbers}, J. Number Theory \textbf{260}
 (2024), 120--150.

\bibitem{FordHR} K. Ford, \emph{A Hardy--Ramanujan type inequality for shifted primes and sifted sets}, Lithuanian
 Math. J. \textbf{61} (2021), no.~3, 323--329; arXiv:2101.03440.

\bibitem{Greaves} G. Greaves, \emph{Sieves in Number Theory}, Springer-Verlag, Berlin, 2001.

\bibitem{HR} G. H. Hardy and S. Ramanujan, \emph{The normal number of prime factors of a number $n$}, Quart. J. Math. \textbf{48} (1917),
 76--92.

\bibitem{HW} G. H. Hardy and E. M. Wright, \emph{An Introduction to the Theory of Numbers}, 4th ed., Clarendon Press, Oxford, 1960.

\bibitem{HJ} S. Hathi and D. R. Johnston, \emph{On the sum of a prime and a square-free number with divisibility conditions}, J. Number Theory
 \textbf{256} (2024), 354--372.

\bibitem{c249} C. Huang (maintainer), \emph{Explicit Chen bounds: current research drafts} (GPT-generated drafts), GitHub repository
 \texttt{woznickiainslie141-dot/explicit-chen-c249}, commit 15368990 (7 October 2026), files \texttt{qrh/qrh\_chen\_51046.tex} and
 \texttt{grh/conditional\_chen\_grh\_bridge.tex}; \url{https://github.com/woznickiainslie141-dot/explicit-chen-c249/tree/15368990}.

\bibitem{Hubbard} S. Hubbard, \emph{A lower explicit threshold for Chen's theorem under GRH}, Hexagon preprint hexagon:2610.00560v4
 (2026); \url{https://hexagonmath.org/2610.00560v4}.

\bibitem{Johnston} D. R. Johnston, \emph{New explicit and asymptotic results in sieve theory}, PhD thesis, UNSW Canberra (UNSW Sydney),
 November 2025, doi:10.26190/unsworks/31766; abstract in Bull. Aust. Math. Soc. \textbf{113} (2026), no.~2, 372--374.

\bibitem{JS} D. R. Johnston and V. V. Starichkova, \emph{Some explicit results on the sum of a prime and an almost prime}, Acta Math. Hungar.
 \textbf{177} (2025), no.~1, 163--192; arXiv:2208.01229v3. Theorem, lemma, equation and page references here use arXiv v3.

\bibitem{Landau} E. Landau, \emph{Handbuch der Lehre von der Verteilung der Primzahlen}, 2 vols., Teubner, Leipzig, 1909.

\bibitem{Lichtman} J. D. Lichtman, \emph{Almost primes and the Banks--Martin conjecture}, J. Number Theory \textbf{211} (2020), 513--529;
 arXiv:1909.00804 (numbering of arXiv v2).

\bibitem{LN} D. Loebenberger and M. N\"usken, \emph{Coarse-grained integers -- smooth? rough? both!}, arXiv:1003.2165
 (2010, revised 2012).

\bibitem{Mathar} R. J. Mathar, \emph{Series of reciprocal powers of $k$-almost primes}, arXiv:0803.0900 (2008).

\bibitem{MV} H. L. Montgomery and R. C. Vaughan, \emph{The large sieve}, Mathematika \textbf{20} (1973), 119--134.

\bibitem{Nathanson} M. B. Nathanson, \emph{Additive Number Theory: The Classical Bases}, Springer, 1996.

\bibitem{OSHP} T. Oliveira e Silva, S. Herzog and S. Pardi, \emph{Empirical verification of the even Goldbach conjecture and computation of
 prime gaps up to $4 \cdot 10^{18}$}, Math. Comp. \textbf{83} (2014), 2033--2060.

\bibitem{QRH} OpenAI, \emph{The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane $\operatorname{Re} s > 7/8$}, preprint (30 September 2026; fixed revision adc7f124 of the repository
 \texttt{openai/math} on GitHub).

\bibitem{PT} D. Platt and T. Trudgian, \emph{Zeros of quadratic Dirichlet $L$-functions}, arXiv:2610.29018 (2026).

\bibitem{Pollack} P. Pollack, \emph{A generalization of the Hardy--Ramanujan inequality and applications}, J. Number Theory \textbf{210}
 (2020), 171--182.

\bibitem{Rankin} R. A. Rankin, \emph{The difference between consecutive prime numbers}, J. London Math. Soc. \textbf{13} (1938), 242--247.

\bibitem{Renyi} A. R\'enyi, \emph{On the representation of an even number as the sum of a single prime and single almost-prime number},
 Izv. Akad. Nauk SSSR Ser. Mat. \textbf{12} (1948), no.~1, 57--78 (in Russian).

\bibitem{Yamada} T. Yamada, \emph{Explicit improvements of the Brun--Titchmarsh theorem for arbitrary intervals}, arXiv:2312.16090 (2023).

\end{thebibliography}