{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/meshgraphnet","slug":"meshgraphnet","name":"MeshGraphNet","full_name":"MeshGraphNet","full_name_withheld":false,"description_markdown":"**MeshGraphNet** is a framework for learning mesh-based simulations using [graph neural networks](https://paperswithcode.com/methods/category/graph-models). The model can be trained to pass messages on a mesh graph and to adapt the mesh discretization during forward simulation. The model uses an Encode-Process-Decode architecture trained with one-step supervision, and can be applied iteratively to generate long trajectories at inference time. The encoder transforms the input mesh $M^{t}$ into a graph, adding extra world-space edges. The processor performs several rounds of message passing along mesh edges and world edges, updating all node and edge embeddings. The decoder extracts the acceleration for each node, which is used to update the mesh to produce $M^{t+1}$.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Learning Mesh-Based Simulation with Graph Networks","paper":"/paper/learning-mesh-based-simulation-with-graph-1","first_author":"Tobias Pfaff","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/learning-mesh-based-simulation-with-graph-1"},"source":{"url":"https://arxiv.org/abs/2010.03409v4","title":"Learning Mesh-Based Simulation with Graph Networks","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Mesh-Based Simulation Models","url":"/methods/category/mesh-based-simulation-models","pwc_aliases":[]},{"area":"Graphs","area_id":"graphs","collection":"Graph Models","url":"/methods/category/graph-models","pwc_aliases":[]}],"n_papers_tagged":5,"archive_num_papers":5,"papers_newest_first":[{"paper":null,"slug":"fusion-deeponet-a-data-efficient-neural","title":"Fusion-DeepONet: A Data-Efficient Neural Operator for Geometry-Dependent Hypersonic and Supersonic Flows","date":"2025-01-03","arxiv_id":"2501.01934","n_code_links":0,"syntology":null},{"paper":"/paper/x-meshgraphnet-scalable-multi-scale-graph","slug":"x-meshgraphnet-scalable-multi-scale-graph","title":"X-MeshGraphNet: Scalable Multi-Scale Graph Neural Networks for Physics Simulation","date":"2024-11-26","arxiv_id":"2411.17164","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-pore-scale-multi-phase-flow-from","title":"Learning Pore-scale Multi-phase Flow from Experimental Data with Graph Neural Network","date":"2024-11-21","arxiv_id":"2411.14192","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-co-2-plume-migration-in-faulted","title":"Learning CO$_2$ plume migration in faulted reservoirs with Graph Neural Networks","date":"2023-06-16","arxiv_id":"2306.09648","n_code_links":0,"syntology":null},{"paper":"/paper/learning-mesh-based-simulation-with-graph-1","slug":"learning-mesh-based-simulation-with-graph-1","title":"Learning Mesh-Based Simulation with Graph Networks","date":"2020-10-07","arxiv_id":"2010.03409","n_code_links":11,"syntology":{"ran":4,"of":4,"n_ran_checked":2,"n_instrument":2,"unverified":0,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["deepmind/deepmind-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":5,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":5,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":5,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/meshgraphnet/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/meshgraphnet/papers/ran/1","json":"/method/meshgraphnet/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/numerical-integration","name":"Numerical Integration","papers":1}],"tasks_shown":3,"n_tasks":3,"usage_by_year":[{"year":"2020","papers":1},{"year":"2023","papers":1},{"year":"2024","papers":2},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/meshgraphnet"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=MeshGraphNet","read_at":"2026-10-05T00:59:04+00:00","query":"MeshGraphNet","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2010.03409","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'MeshGraphNet' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["MeshGraphNet-Transformer (MGN-T)","Long-Short-Edge MeshGraphNet (LSE-MGN)"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"7524ee4b2de330bc147e536e5f0dd52cfd29bfbce581ab3ec342fc156d54d0d9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}