| $c_0^2 \approx 5.33386$ | [DP2026] | Solves the one-dimensional problem exactly. [DP2026-thm1-sharp] [DP2026-rem2-num] |exact pinned row| $c_0^2 \approx 5.33386$ | <a href="#DP2026">[DP2026]</a> | Solves the one-dimensional problem exactly. <a href="#DP2026-thm1-sharp">[DP2026-thm1-sharp]</a> <a href="#DP2026-rem2-num">[DP2026-rem2-num]</a> |tracked since 2026-07-24 — no movement seen yet
Lower bound, last-listed row
| $c_0^2 \approx 5.33386$ | [DP2026] | The sharpness part of Theorem 1 shows that no smaller constant works. [DP2026-thm1-sharp] [DP2026-rem2-num] |exact pinned row| $c_0^2 \approx 5.33386$ | <a href="#DP2026">[DP2026]</a> | The sharpness part of Theorem 1 shows that no smaller constant works. <a href="#DP2026-thm1-sharp">[DP2026-thm1-sharp]</a> <a href="#DP2026-rem2-num">[DP2026-rem2-num]</a> |tracked since 2026-07-24 — no movement seen yet
Cite this rowBounds Ledger — One-dimensional convex sub-Gaussian comparison constant (48a)
upper bound: $c_0^2 \approx 5.33386$ (tracked since 2026-07-24 — no movement seen yet)
lower bound: $c_0^2 \approx 5.33386$ (tracked since 2026-07-24 — no movement seen yet)
Mirrored from teorth/optimizationproblems@2c1968c. These are the last-listed rows of that constant's bounds table — a listing position, not a statement that this bound is the strongest or most recent. A snapshot at that sha, not a live read.
https://u00dxk2.github.io/bounds-ledger/c/48a.html