DiTEC-WDN: A Large-Scale Dataset of Hydraulic Scenarios across Multiple Water Distribution Networks
Not on the map. Why?
Abstract (arXiv)
Privacy restrictions hinder the sharing of real-world Water Distribution Network (WDN) models, limiting the application of emerging data-driven machine learning, which typically requires extensive observations. To address this challenge, we propose the dataset DiTEC-WDN that comprises 36,000 unique scenarios simulated over either short-term (24 hours) or long-term (1 year) periods. We constructed this dataset using an automated pipeline that optimizes crucial parameters (e.g., pressure, flow rate, and demand patterns), facilitates large-scale simulations, and records discrete, synthetic but hydraulically realistic states under standard conditions via rule validation and post-hoc analysis. With a total of 228 million generated graph-based states, DiTEC-WDN can support a variety of machine-learning tasks, including graph-level, node-level, and link-level regression, as well as time-series forecasting. This contribution, released under a public license, encourages open scientific research in the critical water sector, eliminates the risk of exposing sensitive data, and fulfills the need for a large-scale water distribution network benchmark for study comparisons and scenario analysis.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 5 of its 54 references that are in the map. First posted on arXiv 21 Mar 2025.
Builds on
5 of 54 references.
References · 5
- 2018Model Cards for Model Reportingcited by 1,068
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 379
- 2024Physics-Informed Graph Neural Networks for Water Distribution Systemscited by 9
- 2023Graph Neural Networks for Pressure Estimation in Water Distribution Systemscited by 8
- 2024Large-Scale Multipurpose Benchmark Datasets For Assessing Data-Driven Deep Learning Approaches For Water Distribution Networkscited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.