From 8b49006810a93f77d8e2e56088190a2dc26a246b Mon Sep 17 00:00:00 2001
From: allaun <allaun@researchstack.info>
Date: Sat, 4 Jul 2026 10:11:00 -0500
Subject: [PATCH] =?UTF-8?q?docs(citation):=20add=20Erd=C5=91s=20problem=20?=
 =?UTF-8?q?477=20=E2=80=94=20greedy=20tiling=20criterion=20as=20prior=20ar?=
 =?UTF-8?q?t=20for=20Sidon=20set=20construction?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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 | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)

diff --git a/CITATION.cff b/CITATION.cff
index 51f8cf3b..469574a6 100644
--- a/CITATION.cff
+++ b/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: