I’ve posted an AI-assisted preprint proposing an almost-all-primes lower bound of c(log p)^3 / log log p for strictly or…

I’ve posted an AI-assisted preprint proposing an almost-all-primes lower bound of c(log p)^3 / log log p for strictly ordered Type-II Erdős–Straus solution counts. A restricted prime-side proof is checked in Lean; independent human review and originality checks remain outstanding. Does anyone know prior work already implying this bound? References welcome. https:// zenodo.org/records/22556477 # Nu…