Document improved asymptotic binary and spherical code bounds

[Devansh-ops]

Modified Codes

Binary code:

• Document the August 2026 two-point LP converse bound that strictly improves the optimized MRRW bound for every fixed (0<\delta<1/2).
• Cite Chapter 2, Theorem 1.1 of Ten Advances in Mathematics and Theoretical Computer Science.
• Clarify that the result does not provide code constructions, encoders, or decoders.

Spherical code:

• Replace stale “best known” wording for the Kabatiansky–Levenshtein bound.
• Document the hierarchy that strictly improves the optimized KL exponent, including spherical-cap optimization, for every fixed (0<s<1).
• Cite Chapter 2, Theorem 1.2 and Corollary 1.3.
• Clarify that the result is a converse rather than a construction or coding algorithm.

Checklist

• Included primary-source citations.
• No new cross-links to other Zoo codes are required.
• Added both entry changelogs and the contributor record.

Validation

• YAML parsing and contributor/changelog linkage
• Citation, first-paragraph, block-scalar, and spelling linters
• All repository relation checks across 1,116 entries
• Official schema, object, reference, and FLM compilation for the full corpus

The optional local full-site path was limited by pinned sharp@0.30.7 under Node 24; upstream's Node 22 draft-preview workflow remains the authoritative site-build check.