The External Path Length and Terminal Wiener Index in Random Trees
Mathematics · arXiv:2611.16674
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded
Holds up. Solid paper: fills a natural gap with rigorous analytic combinatorics. The differences between leaf-averaged and vertex-averaged distances are shown to be bounded (BGW) or constant (LPAT), enabling transfer of limit laws. No surprises, but clean and useful.
4 major objections, the first at Section 2, Lemma 2.1 and Theorem 2.1 · 10 minor