Update README.md

README.md

@@ -36,7 +36,6 @@ This repository hosts a single PyTorch Geometric dataset file used for the TAG-D
 - **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
 - **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  
-- **Rare labels** (<=5 occurrences) are collapsed into a single UNK class  
 - **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