{"component":{"type":17,"accent_color":14263361,"components":[{"type":10,"content":"-# WikiRNG · Roll of 11/16/2026 · by [void](https://wikirng.com/u/void)"},{"type":10,"content":"## [E-graph](https://wikirng.com/roll/TBWNW9)\n*Graph data structure*"},{"type":10,"content":">>> In computer science, an e-graph is a data structure that stores an equivalence relation over terms of some language."},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟧 Fabled · 281,799 SP\n-# Top 4.1%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 🧪 **Preprint** · Obscure · +93,222 SP\n-# Cites a preprint.\n🟦 ∑ **Problem Set** · Obscure · +49,587 SP\n-# Has 20+ math formulas.\n🟦 🎤 **Cites a Conference** · Obscure · +35,917 SP\n-# Cites a conference paper.\n🟦 🧰 **Uses** · Obscure · +25,622 SP\n-# Has a Uses or Applications section.\n🟦 🧪 **arXiv** · Obscure · +18,689 SP\n-# Links to arXiv.\n🟦 🧮 **Equation** · Obscure · +17,537 SP\n-# Has a math formula.\n-# +20 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/TBWNW9"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/E-graph"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}