arXiv (All)
open access
Reachability-Based Formal Verification of Graph Neural Networks with Node and Edge Features
Graph neural networks (GNNs) have become a prominent approach for developing fast, topology-aware surrogates in electric power systems, supporting tasks such as power flow (PF) analysis, optimal power flow (OPF) estimation, and cascading failure analysis (CFA). Despite this growing use, formally ver
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Unified Heterogeneous Graph Neural Network solver for Power Flow, Optimal Power Flow and State Estimation#1122745
- When Does Advection-Aware Graph Nowcasting Help? A Controlled Study of Distributed Solar Ramp Forecasting with a Self-Supervised Cloud-Motion Estimator#1104485
- An optimized graph neural network approach for robust and explainable IoT intrusion detection against adversarial attacks.#360935
- Scalable Heterogeneous Graph Foundation Models for Data-Driven Optimal Power Flow in Smart Grids#1130561
- Model-to-Data Distillation for Graph Neural Networks#1144793
Record · ID 1078150
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive