math-031-prove: Prove The Graceful Tree Conjecture (Ringel–Kotzig)

[IndieMath:math-031:prove] Prove the The Graceful Tree Conjecture (Ringel–Kotzig) conjecture through an IndieMath AI research attempt. Canonical statement: Every tree on n vertices has a graceful labeling: an injection of vertex labels into {0, …, n−1} such that edge labels |f(u) − f(v)| are exactly {1, …, n−1}. Contributions fund model usage and related compute for this direction.