Update README.md

Disclaimer:

This is submitted as part of my research for Modular Arithmetic Challenge, this is not an official submission as this is a solved circuit.
There is no training set, no optimizer, and no fitted parameter.

README.md

@@ -1,3 +1,7 @@
+---
+tags:
+- ClaudeCode
+---
 # rob-constructed-v1: constructed ReLU circuit for exact (a·b) mod p
 
 A fixed-weight linear + ReLU network that computes `(a * b) mod p` exactly at
@@ -9,10 +13,8 @@ provenance plainly. The weights are set by construction (two numeric constants,
 `1` and `2^16`, plus the structural wiring in `circuit.py`). There is no
 training set, no optimizer, and no fitted parameter.
 
-It is submitted as the "interesting information to acquire" the launch comment
-invited: a hand-encoded algorithm that meets the time and space budget and is
-exact on every scored tier. How to treat it is the organizers' call; the
-manifest discloses the tension with the trained-parameters rule openly.
+It is submitted as part research, a hand-encoded algorithm that meets the time and space budget and is
+exact on every scored tier. 
 
 ## What it computes
 
@@ -53,4 +55,4 @@ Inputs whose prime exceeds the 2048-bit tier ceiling return `[0]`.
 
 No weight files: the circuit needs none. That is part of the honest picture.
 A submission with no trained parameters is, by the rules' own wording, a circuit
-rather than a model.
+rather than a model.