Update README.md

README.md

@@ -34,7 +34,7 @@ This repository hosts a single PyTorch Geometric dataset file used for the TAG-D
 - Contains the **first 10,000 proofs** from the ~45,000-theorem Metamath database  
 - Each example is a **directed acyclic graph** (DAG)  
 - **Node features:** 768-dimensional CodeBERT embeddings of Metamath statements  
-- **Labels:** the theorem required to justify each node (axioms and assumptions share a fixed label); there are 3,358 distinct labels after collapsing rare ones (<=5 conclusion node occurrences) into UNK
+- **Labels:** the theorem required to justify each node (axioms and assumptions share a fixed label); there are 3,358 distinct labels after collapsing rare ones (<=5 occurrences in train set) into UNK
 - **Conclusion masking:** the conclusion node’s embedding is zeroed out so the model must predict the final logical step directly from the graph structure and the other nodes  
 - **All theorem statements** (not just proofs) are included in training, since the model must treat theorems themselves as prior knowledge  
 - Under the Metamath proof language, any theorem used to justify a step always has an index <= the theorem being proved. So a later theorem never appears in an earlier proof