SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2304.00338 · ICLR · 2023

Workshop on Physics for Machine Learning SCIENTIFIC COMPUTING ALGORITHMS TO LEARN EN-HANCED SCALABLE SURROGATES FOR MESH PHYSICS

Yeping Hu, Brian Bartoldson, Amar Saini, Jose Cadena, Yucheng Fu, Jie Bao, Zhijie Xu, Brenda Ng, Phan Nguyen

arXiv · PDF · Open in the Atlas

Code that ran

2 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 1 failure of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2304.00338.json · badge: /api/ran/2304.00338.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
CCSI-Toolset/MGN community
Papers with Code archive
2 ran · 1 no recorded run
FunctionStatusWhere it lives
GridPartitioner Ran
ran on a synthesized input · constructed an object; no result was computed
CCSI-Toolset/MGN/GNN/partitioning/grid_partitioner.py
pointer only (licence: NOASSERTION) · get_code("ee4f1fbd06a1de4c")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, CCSI-Toolset/MGN (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

k_hop_subgraph Ran
ran; our contract draft was wrong, not the code
CCSI-Toolset/MGN/GNN/partitioning/grid_partitioner.py
pointer only (licence: NOASSERTION) · get_code("451a93dd4896dee6")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, CCSI-Toolset/MGN (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Partitioner Not yet run
unverified (harvested, no recorded run)
CCSI-Toolset/MGN/GNN/partitioning/grid_partitioner.py
pointer only (licence: NOASSERTION) · get_code("73919784087f3d0a")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, CCSI-Toolset/MGN (NOASSERTION). The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Data-driven modeling approaches can produce fast surrogates to study large-scale physics problems. Among them, graph neural networks (GNNs) that operate on mesh-based data are desirable because they possess inductive biases that promote physical faithfulness, but hardware limitations have precluded their application to large computational domains. We show that it is possible to train a class of GNN surrogates on 3D meshes. We scale MeshGraphNets (MGN), a subclass of GNNs for mesh-based physics modeling, via our domain decomposition approach to facilitate training that is mathematically equivalent to training on the whole domain under certain conditions. With this, we were able to train MGN on meshes with millions of nodes to generate computational fluid dynamics (CFD) simulations. Furthermore, we show how to enhance MGN via higher-order numerical integration, which can reduce MGN's error and training time. We validated our methods on an accompanying dataset of 3D CO 2 -capture CFD simulations on a 3.1M-node mesh. This work presents a practical path to scaling MGN for real-world applications.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2304.00338")
get_code_for_paper("2304.00338")
have("2304.00338")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2304.00338.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2304.00338.svg)](https://syntology.ai/paper/2304.00338)

Connect an agent — have() is free.