Search NASA⌕ Search

SEARCH · Search NASA

Results for “graph”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Citation network datasets for benchmarking spiking graph neural networks on experimental neuromorphic hardware

Spiking neural networks (SNNs) running on neuromorphic computers offer an energy-efficient alternative for AI tasks. Recently, spiking graph neural networks (S-GNNs) have been shown to produce encouraging results on benchmark citation network datasets such as Cora, CiteSeer, and PubMed for node classification tasks. These S-GNNs were run on SNN simulators only because they contain up to tens of thousands of neurons and up to millions of synapses, translating poorly to neuromorphic hardware. Therefore, in this paper, we create a suite of benchmark datasets from the CiteSeer dataset that can be accommodated on current neuromorphic hardware platforms. Our contribution consists of a collection of three datasets. First, we have an induced subgraph of CiteSeer, which we call MiniSeer, containing 2110 papers, 3604 binary features, and 6 topics. Second, MicroSeer is a very small dataset consisting of 84 papers, 1227 features, and 6 topics. Lastly, BiteSeer is a collection of 15 binary classification datasets. We present creation of these datasets along with accuracies, running times, and spike counts when simulated. We believe that our results in this paper will be used by the neuromorphic community to benchmark, test, and develop neuromorphic hardware and simulators.

Zhu, Kevin [George Mason University, Virginia]↗
DOE OSTI2024

Uncertainty quantification for molecular property predictions with graph neural architecture search

Graph Neural Networks (GNNs) have emerged as a prominent class of data-driven methods for molecular property prediction. However, a key limitation of typical GNN models is their inability to quantify uncertainties in the predictions. This capability is crucial for ensuring the trustworthy use and deployment of models in downstream tasks. To that end, we introduce AutoGNNUQ, an automated uncertainty quantification (UQ) approach for molecular property prediction. AutoGNNUQ leverages architecture search to generate an ensemble of high-performing GNNs, enabling the estimation of predictive uncertainties. Our approach employs variance decomposition to separate data (aleatoric) and model (epistemic) uncertainties, providing valuable insights for reducing them. In our computational experiments, we demonstrate that AutoGNNUQ outperforms existing UQ methods in terms of both prediction accuracy and UQ performance on multiple benchmark datasets, and generalizes well to out-of-distribution datasets. Additionally, we utilize t-SNE visualization to explore correlations between molecular features and uncertainty, offering insight for dataset improvement. AutoGNNUQ has broad applicability in domains such as drug discovery and materials science, where accurate uncertainty quantification is crucial for decision-making.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Expediting field-effect transistor chemical sensor design with neuromorphic spiking graph neural networks

Improving the sensitive and selective detection of analytes in a variety of applications requires accelerating the rational design of field-effect transistor (FET) chemical sensors. Achieving high-performance detection relies on identifying optimal probe materials that can effectively interact with target analytes, a process traditionally driven by chemical intuition and time-consuming trial-and-error methods. To address the difficulties in probe screening for FET sensor development, this work presents a methodology that combines neuromorphic machine learning (ML) architectures, specifically a hybrid spiking graph neural network (SGNN), with an enriched dataset of physicochemical properties through semi-automated data extraction using large language models. Achieving a classification accuracy of 0.89 in predicting sensor sensitivity categories, the SGNN model outperformed traditional ML techniques by leveraging its ability to capture both global physicochemical properties and sparse topological features through a hybrid modeling framework. Next-generation sensor design was informed by the actionable insights into the connections between material properties and sensing performance offered by the SGNN framework. Through virtual screening for the detection of per- and polyfluoroalkyl substances (PFAS) as a use case, the effectiveness of the SGNN model was further validated. Density functional theory simulations confirmed graphene as a promising active material for PFAS detection as suggested by the SGNN framework. By bridging gaps in predictive modeling and data availability, this integrated approach provides a strong foundation for accelerating advancements in FET sensor design and innovation.

Ferreira, Rodrigo Pires [Univ. of Chicago, IL (Uni↗
DOE OSTI2025

Spin-informed universal graph neural networks for simulating magnetic ordering

The screening and discovery of magnetic materials are hindered by the computational cost of first-principles density-functional theory (DFT) calculations required to find the ground state magnetic ordering. Although universal machine-learning interatomic potentials (uMLIPs), also known as atomistic foundation models, offer high-fidelity models of many atomistic systems with significant speedup, they currently lack the inputs required for predicting magnetic ordering. In this work, we present a data-efficient, spin-informed graph neural network framework that incorporates spin degrees of freedom as inputs and preserves physical symmetries, extending the functionality of uMLIPs to simulate magnetic orderings. This framework speeds up DFT calculations through better initial guesses for magnetic moments, determines the ground-state ordering of bulk materials and even generalizes to magnetic ordering in surfaces. Furthermore, we implement a closed-loop anomaly detection approach that effectively addresses the classic "chicken-and-egg" problem of creating a high-quality dataset while developing a uMLIP, unearthing anomalies in large benchmark datasets and boosting model accuracy.

Xu, Wenbin↗
DOE OSTI2024

Using graph neural networks to reconstruct charged pion showers in the CMS High Granularity Calorimeter

A novel method to reconstruct the energy of hadronic showersin the CMS High Granularity Calorimeter (HGCAL) is presented. TheHGCAL is a sampling calorimeter with very fine transverse andlongitudinal granularity. The active media are silicon sensors andscintillator tiles readout by SiPMs and the absorbers are acombination of lead and Cu/CuW in the electromagnetic section, andsteel in the hadronic section. The shower reconstruction method isbased on graph neural networks and it makes use of a dynamicreduction network architecture. It is shown that the algorithm isable to capture and mitigate the main effects that normally hinderthe reconstruction of hadronic showers using classicalreconstruction methods, by compensating for fluctuations in themultiplicity, energy, and spatial distributions of the shower'sconstituents. The performance of the algorithm is evaluated usingtest beam data collected in 2018 prototype of the CMS HGCALaccompanied by a section of the CALICE AHCAL prototype. Thecapability of the method to mitigate the impact of energy leakagefrom the calorimeter is also demonstrated.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

GRAPH — an readout ASIC for large MCP based detectors

We present a programmable 16 channel, mixed signal, low power readout ASIC, having the project historically named Gigasample Recorder of Analog waveforms from a PHotodetector (GRAPH). It is designed to read large aperture single photon imaging detectors using micro channel plates for charge multiplication, and measuring the detector's response on crossed strips anodes to extrapolate the incoming photon position. Each channel consists of a fast, low power and low noise charge sensitive amplifier, which provides a myriad of coarse and fine programmable options for gain and shaping settings. Further, the amplified signal is recorded using, to our knowledge novel, the Hybrid Universal sampLing Architecture (HULA) ADC. A kind of mixed signal double buffer memory, that enables concurrent waveform recording, and selected event digitized data extraction. The sampling frequency is freely adjustable between few kHz up to 125 MHz, while the chip's internal digital memory holds a history 2048 samples for each channel, with a digital headroom of 12 bits. An optimized region of interest sample-read algorithm allows to extract the information just around the event pulse peak, while selecting the next event, thus substantially reducing the operational dead time. The chip is designed in 130 nm TSMC CMOS technology, and its power consumption is around 47 mW per channel.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Low-Density Parity-Check Stabilizer Codes as Gapped Quantum Phases: Stability under Graph-Local Perturbations

We generalize the proof of stability of topological order, due to Bravyi, Hastings, and Michalakis, to stabilizer Hamiltonians corresponding to low-density parity-check (LDPC) codes without the restriction of geometric locality in Euclidean space. We consider Hamiltonians 𝐻 0 defined by ⟦𝑁,𝐾,𝑑⟧ LDPC codes, which obey certain topological quantum order conditions: (i) code distance 𝑑 ≥ 𝑐⁢log (𝑁), implying local indistinguishability of ground states, and (ii) a mild condition on local and global compatibility of ground states—these include good quantum LDPC codes and the toric code on a hyperbolic lattice, among others. We consider stability under weak perturbations that are quasilocal on the interaction graph defined by 𝐻 0 and that can be represented as sums of bounded-norm terms. As long as the local perturbation strength is smaller than a finite constant, we show that the perturbed Hamiltonian has well-defined spectral bands originating from the 𝑂⁡(1) smallest eigenvalues of 𝐻 0 . The band originating from the smallest eigenvalue has 2 𝐾 states, is separated from the rest of the spectrum by a finite energy gap, and has exponentially narrow bandwidth 𝛿 =𝐶⁢𝑁⁢𝑒 −Θ⁡(𝑑) , which is tighter than the best-known bounds even in the Euclidean case. We also obtain that the new ground-state subspace is related to the initial-code subspace by a quasilocal unitary, allowing one to relate their physical properties. Our proof uses an iterative procedure that performs successive rotations to eliminate non-frustration-free terms in the Hamiltonian. Our results extend to quantum Hamiltonians built from classical LDPC codes, which give rise to stable symmetry-breaking phases. These results show that LDPC codes very generally define stable gapped quantum phases, even in the non-Euclidean setting, initiating a systematic study of such phases of matter.

mathematical physics↗
DOE OSTI2025

Thermodynamic Modeling of Complex Solid Solutions in the Lu-H-N System via Graph Neural Network Accelerated Monte Carlo Simulations

Metal hydrides are important across diverse applications, such as hydrogen storage, batteries, gas sensors, nuclear reactions, and high-temperature superconductivity. Previous computational studies of metal hydrides under extreme pressures, e.g., 𝑂⁡(10 2 ) ⁢GPa, usually treat them as stoichiometric compounds without considering interstitial lattice disorder. As pressures become more moderate in the 𝑂⁡(10 0 ) ⁢GPa and below range, hydrogen disorder at interstitial lattice sites becomes prominent, e.g., in the N-doped Lu hydride that was recently claimed superconducting near 1 GPa. Further adding compositional complexity from alloying and/or multielement interstitial occupation makes elucidating pressure- and temperature-dependent observables intractable by first-principles calculations alone. We therefore propose a lattice graph neural-network surrogate modeling approach to predict configuration- and pressure-dependent equation-of-state properties. Their efficiency permits Monte Carlo simulations to calculate Gibbs energies and pressure-dependent phase diagrams, thereby revealing insights into the synthesis conditions required for achieving desired phase equilibria. We demonstrate this concept for the compositionally complex cubic Lu(H,N,Va) 3 system where three constituents (hydrogen, nitrogen and vacancy) have disordered multielement interstitial occupancies and insights into pressure-dependent phase equilibria are critically needed, e.g., N-doping levels can significantly lower dehydrogenation temperatures and provide a new strategy to optimize hydrogen-storage alloys. This work can improve the thermodynamic understanding of the Lu-H-N system and help rational synthesis of N-doped Lu hydrides, but more generally demonstrates an efficient approach to model pressure-dependent thermodynamics of multicomponent solid solutions.

Monte Carlo methods↗
DOE OSTI2026

Seamlessly joining length scales: From atomistic thermal graphs to anisotropic continuum conductivity

Thermal transport in complex solids is governed by local structure, defects, and anisotropy, yet most continuum models still rely on oversimplified and homogenized conductivities. Here, we bridge atomistic and continuum descriptions by building finite element (FE) models directly from the site-projected thermal conductivity (SPTC), an atomic-level decomposition of the Green–Kubo thermal conductivity. We introduce a toolkit, the “Simulator Collection for Atomic-to-Continuum Scales (SCACS)”, which uses a graph neural network to predict SPTC on large atomic structures, coarse-grains these fields into anisotropic conductivity tensors, and embeds them into the heat-flow FE equation with a customized, anisotropy-aware adaptive mesh refinement scheme. Applied to silicon nanostructures, the resulting FE models act as representative volume elements, reproduce bulk conductivities, and capture interfacial and defect-driven anisotropy while maintaining thermodynamic consistency. Additionally, SCACS predicts experimental conductance trends and fields. This work demonstrates a general route for transferring atomistic transport information into device-scale thermal simulations with physics-based approximations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

New graph-neural-network flavor tagger for Belle II and measurement of sin 2⁢𝜙 1 in 𝐵 0 → 𝐽/𝜓⁢𝐾$^0_ S$ decays

We present GFlaT, a new algorithm that uses a graph-neural-network to determine the flavor of neutral 𝐵 mesons produced in ϒ⁡(4⁢𝑆) decays. It improves previous algorithms by using the information from all charged final-state particles and the relations between them. We evaluate its performance using 𝐵 decays to flavor-specific hadronic final states reconstructed in a 362 fb −1 sample of electron-positron collisions collected at the ϒ⁡(4⁢𝑆) resonance with the Belle II detector at the SuperKEKB collider. We achieve an effective tagging efficiency of (37.40 ± 0.43 ± 0.36%), where the first uncertainty is statistical and the second systematic, which is 18% better than the previous Belle II algorithm. Demonstrating the algorithm, we use 𝐵 0 →𝐽/𝜓⁢𝐾$^0_ S$ decays to measure the mixing-induced and direct 𝐶⁢𝑃 violation parameters, 𝑆 = (0.724 ± 0.035 ± 0.009) and 𝐶 = (−0.035 ± 0.026 ± 0.029).

CP violation↗
DOE OSTI2025

Antipodal self-duality of square fishnet graphs

In strongly deformed planar 𝒩 = 4 super-Yang-Mills theory, or fishnet theory, a point-split single-trace correlation function of four dimension-𝑚 scalar operators is given by a single Feynman integral, which involves integrating over locations of a 𝑚 × 𝑚 grid of points. We show that for any integer 𝑚 this square fishnet graph is invariant under the combined action of a kinematic map and the antipode map of the Hopf algebra on multiple polylogarithms; i.e. it possesses an antipodal self-duality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs

We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is the Hamiltonian. By working out expressions for the partition function and transition amplitudes of discretized versions of continuous-variable quantum systems, and then taking the continuum limit, we explicitly recover Feynman's continuous-variable path integrals. We also discuss the implications of our result.

Feynman diagrams↗
DOE OSTI2024

GraphAide: Advanced Graph-Assisted Query and Reasoning System

Curating knowledge from multiple siloed sources that contain both structured and unstructured data is a major challenge in many real-world applications. Pattern matching and querying represent fundamental tasks in modern data analytics that leverage this curated knowledge. The development of such applications necessitates overcoming several research challenges, including data extraction, named entity recognition, data modeling, and designing query interfaces. Moreover, the explainability of these functionalities is critical for their broader adoption. The emergence of Large Language Models (LLMs) has accelerated the development lifecycle of new capabilities. Nonetheless, there is an ongoing need for domain-specific tools tailored to user activities. The creation of digital assistants has gained considerable traction in recent years, with LLMs offering a promising avenue to develop such assistants utilizing domain-specific knowledge and assumptions. In this context, we introduce an advanced query and reasoning system, GraphAide, which constructs a knowledge graph (KG) from diverse sources and allows to query and reason over the resulting KG. GraphAide harnesses both the KG and LLMs to rapidly develop domain-specific digital assistants. It integrates design patterns from retrieval augmented generation (RAG) and the semantic web to create an agentic LLM application. GraphAide underscores the potential for streamlined and efficient development of specialized digital assistants, thereby enhancing their applicability across various domains.

Purohit, Sumit [BATTELLE (PACIFIC NW LAB)] (ORCID:↗
DOE OSTI2025

Scaling Laws of Graph Neural Networks for Atomistic Materials Modeling

Atomistic materials modeling is a critical task with wide-ranging applications, from drug discovery to materials science, where accurate predictions of the target material property can lead to significant advancements in scientific discovery. Graph Neural Networks (GNNs) represent the state-of-the-art approach for modeling atomistic material data thanks to their capacity to capture complex relational structures. While machine learning performance has historically improved with larger models and datasets, GNNs for atomistic materials modeling remain relatively small compared to large language models (LLMs), which leverage billions of parameters and terabyte-scale datasets to achieve remarkable performance in their respective domains. To address this gap, we explore the scaling limits of GNNs for atomistic materials modeling by developing a foundational model with billions of parameters, trained on extensive datasets in terabytescale. Our approach incorporates techniques from LLM libraries to efficiently manage large-scale data and models, enabling both effective training and deployment of these large-scale GNN models. This work addresses three fundamental questions in scaling GNNs: the potential for scaling GNN model architectures, the effect of dataset size on model accuracy, and the applicability of LLM-inspired techniques to GNN architectures. Specifically, the outcomes of this study include (1) insights into the scaling laws for GNNs, highlighting the relationship between model size, dataset volume, and accuracy, (2) a foundational GNN model optimized for atomistic materials modeling, and (3) a GNN codebase enhanced with advanced LLM-based training techniques. Our findings lay the groundwork for large-scale GNNs with billions of parameters and terabyte-scale datasets, establishing a scalable pathway for future advancements in atomistic materials modeling.

Li, Chaojian [ORNL] (ORCID:0000000340309777)↗
DOE OSTI2025

A Graph-Net with Node Embeddings to Detect False Data Injection Attacks in Photovoltaic Systems

Distributed energy resources (DER) contribute to the operational stability of the larger power grid both at utility-scale as well as commercial and residential scales in aggregated forms. These DER in-turn are susceptible to increasing cyber threats. An adversary can plug into the same local network that a field photovoltaic (PV) system uses to interconnect its data loggers and inverters and manipulate certain measurements collected from the network or trick existing irradiance and inverter readings through false data injection attacks (FDIA). Control routines that rely on these measurements can propagate the false data, impacting critical decisions that result in a suboptimal operation or even cause intentional harm leading to inverter-tripping or unscheduled loads that need to be shed. To detect FDIA in PV systems, the paper introduces an attention-based graph neural network with node embeddings and applied it to a simple prototypical DC-coupled microgrid with PV, energy storage, and load. The algorithm shows a detection accuracy of up to 98.95%. The proposed FDIA detection technique will provide micro-grid operators with an effective method to safeguard their systems, guaranteeing the secure and reliable operation.

Parvez, Imtiaz [Utah Valley University]↗
DOE OSTI2024

Enhancing Power Distribution System Resilience with Fusion-GNN: A Dynamic Graph Representation Learning Approach

This paper explores the applications of Fusion Graph Neural Network (FuGNN) on power distribution systems. FuGNN effectively models dynamic networks with evolving topology and features. Applied to power system network reconfiguration, FuGNN demonstrates its feasibility in optimizing switch configurations to minimize unserved loads and operational costs during extreme events. Additionally, FuGNN supports various downstream tasks, such as node feature prediction, further enhancing its versatility and applicability in power system resilience.

Liu, Boming↗