docs(citation): add Erdős problem 477 — greedy tiling criterion as prior art for Sidon set construction

Bloom (2026): 13th powers have a tiling complement. The greedy algorithm
is the same as SilverSight's crt_sidon_set; the density bound |Sc(T)|=O(T^{5/6})
corresponds to our Sidon sum collision bound.

CITATION.cff

@@ -379,6 +379,25 @@ references:
       formal/CoreFormalism/CRTSidon.lean,
       docs/research/sidon_preservation_creation.md.
 
+  - type: online
+    title: "Erdős Problem #477: Tiling complements for value sets of polynomials"
+    authors:
+      - family-names: "Bloom"
+        given-names: "Thomas F."
+    date-published: "2026-06"
+    url: "https://www.erdosproblems.com/477"
+    notes: >
+      References: Bloom (2026) via Brownawell–Masser S-unit estimate +
+      Heath-Brown determinant method. Proves that the set of 13th powers
+      has a tiling complement in ℤ. The greedy tiling criterion
+      (Lemma 1.7) is the same algorithm as SilverSight's `crt_sidon_set`:
+      enumerate candidates, reject those that create collisions, accept
+      when bad shifts are o(T). The analytic density bound |Sc(T)|=O(T^{5/6})
+      corresponds to our Sidon sum collision bound (wrapping criterion +
+      M-difference condition). Binds to: scripts/crt_capacity_envelope.py,
+      formal/CoreFormalism/CRTSidon.lean.
+    version: "accessed 27 June 2026"
+
   - type: online
     title: "Toroidal and Poloidal Coordinates"
     authors: