Methods › Graphs › Graph Models › GNS

Graph Network-based Simulators

GNS

21 papers tagged archive 2025-07-28

Introduced by Alvaro Sanchez-Gonzalez et al. in Learning to Simulate Complex Physics with Graph Networks

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Graph Network-Based Simulators is a type of graph neural network that represents the state of a physical system with particles, expressed as nodes in a graph, and computes dynamics via learned message-passing.

PaperSource

In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 14 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'Graph Network-based Simulators (GNS)' (resolution: alias); this answer is about that name. This answer is about arXiv:2002.09405, the paper the archive credits with this method.

Origin paper of this answer, arXiv:2002.09405 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 17 ran (of which 5 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 1 violated, 15 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified (of 24 harvested samples) · 13 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 21 · with a code link: 10 · where Syntology ran a sample: 3 (3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (3 of 21 tagged: 3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 21 of 21, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Graph Neural Network6
Benchmarking2
Computational Efficiency2
Deep Reinforcement Learning2
Fairness2
Scheduling2
CPU1
Friction1
GPU1
Image Classification1
Language Modeling1
Language Modelling1
Meta-Learning1
Pose Estimation1
Prediction1
Quantization1
Relational Reasoning1
Sand1
Stochastic Optimization1
image-classification1

Usage over time archive 2025-07-28

Papers per year tagged with GNS: 2020 to 2024, peak 8 8 0 2020: 1 paper 2020 2021: 4 papers 2021 2022: 4 papers 2022 2023: 4 papers 2023 2024: 8 papers 2024
Papers per year the archive tags with this method, by the paper's archive date (21 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections