Evidence map›Paper›PMID 42573031›Full record

ArticleThe Journal of chemical physics2026

Hierarchical geometric deep learning enables scalable analysis of molecular dynamics.

Zihan Pengmei, Spencer C Guo, Chatipat Lorpaiboon, Aaron R Dinner

Abstract read
In one paragraph

Article in The Journal of chemical physics, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Zihan PengmeiDepartment of Chemistry and James Franck Institute, University of Chicago, Chicago, Illinois 60637, USA.
Spencer C GuoDepartment of Chemistry and James Franck Institute, University of Chicago, Chicago, Illinois 60637, USA.ORCID 0000-0001-7899-8382
Chatipat LorpaiboonDepartment of Chemistry and James Franck Institute, University of Chicago, Chicago, Illinois 60637, USA.ORCID 0000-0001-6518-0338
Aaron R DinnerDepartment of Chemistry and James Franck Institute, University of Chicago, Chicago, Illinois 60637, USA.ORCID 0000-0001-8328-6427

Funding

Rare-event simulation and analysis for elucidating mechanisms of development and diseaseR35GM136381 · NIGMS · UNIVERSITY OF CHICAGO · PI Aaron Dinner · 2020 to 2026
$2.2M
Beagle-3: A Shared GPU Cluster for Biomolecular SciencesS10OD028655 · OD · UNIVERSITY OF CHICAGO · PI ROUX, BENOIT · 2020 to 2020
$2.0M
NIGMS NIH HHS R35 GM136381NIH HHS S10 OD028655
6 · The paper itself

Abstract

Molecular dynamics simulations can generate atomically detailed trajectories of complex systems, but analyzing these dynamics can be challenging when systems lack well-established quantitative descriptors (features). Learning features directly from simulation data would obviate manual feature engineering, and graph neural networks are promising architectures for this task. However, the dominant GNN paradigm, message passing, in which information is transferred only between nodes that represent spatially nearby atoms, struggles to capture long-range interactions. Mechanisms that instead allow every node to communicate with every other node, such as attention in transformer architectures, capture long-range interactions but have memory and runtime requirements that scale quadratically with the number of nodes (atoms). Together, these issues limit the use of GNNs for analyzing dynamics of many atoms. Here, we show how a hierarchical scheme can be used to aggregate local information to reduce memory and runtime requirements without sacrificing atomic detail. We demonstrate that this approach opens the door to analyzing simulations of protein-nucleic acid complexes with thousands of residues at full atomic resolution on single GPUs within minutes. For systems with hundreds of residues, for which there are sufficient data to make quantitative comparisons, we show that the approach reduces computational cost while maintaining, and in some cases improving, performance and interpretability.

Identifiers

PMID42573031
PMCPMC13503011

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.