Problem detail · source-aware
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Every tree metric with $t$ leaves embeds isometrically into $\ell_\infty^{t-1}$, and the least dimension needed is at least $\lceil \log_2 t \rceil$. Fitzpatrick and Nowakowski asked in 2000 whether the logarithmic bound is always attained, and Brigham, Chartrand, Dutton and Zhang conjectured in 2005 that every tree with $t$ leaves embeds isometrically into $\ell_\infty^{\lceil \log_2 t \rceil}$, verifying it through $t = 21$. Aksoy, Kilic and Kocak posed a sharp leaf-threshold version for weighted metric trees in 2020.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
The paper's disclosure: "OpenAI's GPT-5.6 Sol assisted in implementing the computational search strategy and with drafting this manuscript. The author takes full responsibility for the content of the article." The search that found the tree and the proof that no five-orientation cover exists are the author's; the model wrote code and prose. That is the assisted tier on this site.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
Unreviewed. arXiv 2608.16288 (17 August 2026, six pages) read in full here; the abstract's claims match the theorems. The counterexample is an exact finite argument with the covering masks printed in the paper and ancillary verification code deposited on Zenodo, which this site has not run. No peer review, no independent expert statement.
Correctness: unknown · statement fidelity: unaudited · peer review: none
Disproved. An explicit 32-leaf tree has least isometric $\ell_\infty$-dimension six, not the conjectured five, and keeps dimension six under every assignment of positive edge lengths, so the weighted sharp-threshold conjecture falls too. Every tree with at most 31 leaves does attain $\lceil \log_2 t \rceil$, so 32 is the first failure; Brigham et al. had checked through 21. The proof is finite and exact: six explicit orientation masks cover all leaf pairs, and a recurrence on rooted branches rules out any five-orientation cover.
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.