Datasets:
Update README.md
Browse files
README.md
CHANGED
|
@@ -20,7 +20,7 @@ dataset_summary: >
|
|
| 20 |
# Metamath Proof Graphs (10k)
|
| 21 |
|
| 22 |
This repository provides a PyTorch Geometric dataset designed for the TAG-DS TopoBench challenge.
|
| 23 |
-
It contains **20,000 graphs total:** 10,000 theorem-only DAGs and 10,000 full proof DAGs drawn from the first 10k theorems in the Metamath database.
|
| 24 |
|
| 25 |
## Contents
|
| 26 |
|
|
@@ -66,7 +66,7 @@ This pairing enables:
|
|
| 66 |
- Graph type: **directed acyclic graphs (DAGs)**
|
| 67 |
- Label space: **3,557 justification labels**, where all labels with <5 training occurrences are collapsed into `UNK`
|
| 68 |
- **Conclusion masking:** the conclusion node’s embedding is zeroed out; the model must infer its label from the structure and other nodes
|
| 69 |
-
- **Monotonicity constraint:** in Metamath, proofs only use theorems with index
|
| 70 |
- Theorem-only graphs are included in training as prior knowledge for downstream proof prediction.
|
| 71 |
|
| 72 |
---
|
|
@@ -83,3 +83,17 @@ slices = obj["slices"]
|
|
| 83 |
train_idx = obj["train_idx"]
|
| 84 |
val_idx = obj["val_idx"]
|
| 85 |
test_idx = obj["test_idx"]
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 20 |
# Metamath Proof Graphs (10k)
|
| 21 |
|
| 22 |
This repository provides a PyTorch Geometric dataset designed for the TAG-DS TopoBench challenge.
|
| 23 |
+
It contains **20,000 graphs total:** 10,000 theorem-only DAGs and 10,000 full proof DAGs drawn from the first 10k theorems in the Metamath [1] database.
|
| 24 |
|
| 25 |
## Contents
|
| 26 |
|
|
|
|
| 66 |
- Graph type: **directed acyclic graphs (DAGs)**
|
| 67 |
- Label space: **3,557 justification labels**, where all labels with <5 training occurrences are collapsed into `UNK`
|
| 68 |
- **Conclusion masking:** the conclusion node’s embedding is zeroed out; the model must infer its label from the structure and other nodes
|
| 69 |
+
- **Monotonicity constraint:** in Metamath, proofs only use theorems with index <= the current theorem, so later theorems never appear in earlier graphs
|
| 70 |
- Theorem-only graphs are included in training as prior knowledge for downstream proof prediction.
|
| 71 |
|
| 72 |
---
|
|
|
|
| 83 |
train_idx = obj["train_idx"]
|
| 84 |
val_idx = obj["val_idx"]
|
| 85 |
test_idx = obj["test_idx"]
|
| 86 |
+
```
|
| 87 |
+
|
| 88 |
+
---
|
| 89 |
+
|
| 90 |
+
## Acknowledgements
|
| 91 |
+
|
| 92 |
+
Thanks to the Erdős Institute for providing the project-based, collaborative
|
| 93 |
+
environment where key components of the preprocessing pipeline were first
|
| 94 |
+
developed.
|
| 95 |
+
|
| 96 |
+
---
|
| 97 |
+
|
| 98 |
+
## References
|
| 99 |
+
[1] Metamath Official Site — <https://us.metamath.org/index.html>
|