{"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/mpnn","slug":"mpnn","name":"MPNN","full_name":"Message Passing Neural Network","full_name_withheld":false,"description_markdown":"There are at least eight notable examples of models from the literature that can be described using the **Message Passing Neural Networks** (**MPNN**) framework. For simplicity we describe MPNNs which operate on undirected graphs $G$ with node features $x_{v}$ and edge features $e_{vw}$. It is trivial to extend the formalism to directed multigraphs. The forward pass has two phases, a message passing phase and a readout phase. The message passing phase runs for $T$ time steps and is defined in terms of message functions $M_{t}$ and vertex update functions $U_{t}$. During the message passing phase, hidden states $h_{v}^{t}$ at each node in the graph are updated based on messages $m_{v}^{t+1}$ according to\r\n$$\r\nm_{v}^{t+1} = \\sum_{w \\in N(v)} M_{t}(h_{v}^{t}, h_{w}^{t}, e_{vw})\r\n$$\r\n$$\r\nh_{v}^{t+1} = U_{t}(h_{v}^{t}, m_{v}^{t+1})\r\n$$\r\nwhere in the sum, $N(v)$ denotes the neighbors of $v$ in graph $G$. The readout phase computes a feature vector for the whole graph using some readout function $R$ according to\r\n$$\r\n\\hat{y} = R(\\\\{ h_{v}^{T} | v \\in G \\\\})\r\n$$\r\nThe message functions $M_{t}$, vertex update functions $U_{t}$, and readout function $R$ are all learned differentiable functions. $R$ operates on the set of node states and must be invariant to permutations of the node states in order for the MPNN to be invariant to graph isomorphism.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Neural Message Passing for Quantum Chemistry","paper":"/paper/neural-message-passing-for-quantum-chemistry","first_author":"Justin Gilmer","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/neural-message-passing-for-quantum-chemistry"},"source":{"url":"http://arxiv.org/abs/1704.01212v2","title":"Neural Message Passing for Quantum Chemistry","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Models","url":"/methods/category/graph-models","pwc_aliases":[]}],"n_papers_tagged":74,"archive_num_papers":74,"papers_newest_first":[{"paper":null,"slug":"understanding-generalization-in-node-and-link","title":"Understanding Generalization in Node and Link Prediction","date":"2025-07-01","arxiv_id":"2507.00927","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-graph-transformer-out-of","title":"Exploring Graph-Transformer Out-of-Distribution Generalization Abilities","date":"2025-06-25","arxiv_id":"2506.20575","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluating-loss-functions-for-graph-neural","title":"Evaluating Loss Functions for Graph Neural Networks: Towards Pretraining and Generalization","date":"2025-06-17","arxiv_id":"2506.14114","n_code_links":0,"syntology":null},{"paper":"/paper/wilting-trees-interpreting-the-distance","slug":"wilting-trees-interpreting-the-distance","title":"WILTing Trees: Interpreting the Distance Between MPNN Embeddings","date":"2025-05-30","arxiv_id":"2505.24642","n_code_links":0,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":null}},{"paper":"/paper/improving-the-effective-receptive-field-of","slug":"improving-the-effective-receptive-field-of","title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","date":"2025-05-29","arxiv_id":"2505.23185","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["bgu-cs-vil/im-mpnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"uncertainty-estimation-for-heterophilic","title":"Uncertainty Estimation for Heterophilic Graphs Through the Lens of Information Theory","date":"2025-05-28","arxiv_id":"2505.22152","n_code_links":0,"syntology":null},{"paper":"/paper/open-the-eyes-of-mpnn-vision-enhances-mpnn-in","slug":"open-the-eyes-of-mpnn-vision-enhances-mpnn-in","title":"Open the Eyes of MPNN: Vision Enhances MPNN in Link Prediction","date":"2025-05-13","arxiv_id":"2505.08266","n_code_links":0,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"efficient-parallelization-of-message-passing","title":"Efficient Parallelization of Message Passing Neural Network Potentials for Large-scale Molecular Dynamics","date":"2025-05-10","arxiv_id":"2505.06711","n_code_links":0,"syntology":null},{"paper":null,"slug":"materials-map-integrating-experimental-and","title":"A Materials Map Integrating Experimental and Computational Data via Graph-Based Machine Learning for Enhanced Materials Discovery","date":"2025-03-10","arxiv_id":"2503.07378","n_code_links":0,"syntology":null},{"paper":"/paper/towards-graph-neural-networks-for-provably","slug":"towards-graph-neural-networks-for-provably","title":"Towards graph neural networks for provably solving convex optimization problems","date":"2025-02-04","arxiv_id":"2502.02446","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-message-passing-neural-network-surrogate","title":"A Message Passing Neural Network Surrogate Model for Bond-Associated Peridynamic Material Correspondence Formulation","date":"2024-10-29","arxiv_id":"2411.08911","n_code_links":0,"syntology":null},{"paper":null,"slug":"causal-gnns-a-gnn-driven-instrumental","title":"Causal GNNs: A GNN-Driven Instrumental Variable Approach for Causal Inference in Networks","date":"2024-09-13","arxiv_id":"2409.08544","n_code_links":0,"syntology":null},{"paper":null,"slug":"mcu-mixq-a-hw-sw-co-optimized-mixed-precision","title":"MCU-MixQ: A HW/SW Co-optimized Mixed-precision Neural Network Design Framework for MCUs","date":"2024-07-17","arxiv_id":"2407.18267","n_code_links":0,"syntology":null},{"paper":null,"slug":"commute-graph-neural-networks","title":"Commute Graph Neural Networks","date":"2024-06-30","arxiv_id":"2407.01635","n_code_links":0,"syntology":null},{"paper":"/paper/next-level-message-passing-with-hierarchical","slug":"next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","arxiv_id":"2406.15852","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":5,"n_instrument":2,"unverified":3,"pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 4 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["carlosinator/support-graphs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"beyond-5g-network-failure-classification-for","title":"Beyond 5G Network Failure Classification for Network Digital Twin Using Graph Neural Network","date":"2024-06-06","arxiv_id":"2406.06595","n_code_links":0,"syntology":null},{"paper":"/paper/graph-neural-networks-approach-for-joint","slug":"graph-neural-networks-approach-for-joint","title":"Graph Neural Networks Approach for Joint Wireless Power Control and Spectrum Allocation","date":"2024-06-03","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"bundle-neural-networks-for-message-diffusion","title":"Bundle Neural Networks for message diffusion on graphs","date":"2024-05-24","arxiv_id":"2405.15540","n_code_links":0,"syntology":null},{"paper":null,"slug":"scene-graph-generation-strategy-with-co","title":"Scene Graph Generation Strategy with Co-occurrence Knowledge and Learnable Term Frequency","date":"2024-05-21","arxiv_id":"2405.12648","n_code_links":0,"syntology":null},{"paper":null,"slug":"could-chemical-llms-benefit-from-message","title":"Could Chemical LLMs benefit from Message Passing","date":"2024-05-14","arxiv_id":"2405.08334","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalization-bounds-for-message-passing","title":"Generalization Bounds for Message Passing Networks on Mixture of Graphons","date":"2024-04-04","arxiv_id":"2404.03473","n_code_links":0,"syntology":null},{"paper":null,"slug":"weisfeiler-leman-at-the-margin-when-more","title":"Weisfeiler-Leman at the margin: When more expressivity matters","date":"2024-02-12","arxiv_id":"2402.07568","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-dimensionality-of-feature-vectors-in-mpnns","title":"On dimensionality of feature vectors in MPNNs","date":"2024-02-06","arxiv_id":"2402.03966","n_code_links":0,"syntology":null},{"paper":"/paper/accurate-segmentation-of-optic-disc-and-cup","slug":"accurate-segmentation-of-optic-disc-and-cup","title":"Accurate Segmentation of Optic Disc And Cup from Multiple Pseudo-labels by Noise-aware Learning","date":"2023-11-30","arxiv_id":"2311.18496","n_code_links":1,"syntology":null},{"paper":"/paper/adaptive-pairwise-encodings-for-link","slug":"adaptive-pairwise-encodings-for-link","title":"LPFormer: An Adaptive Graph Transformer for Link Prediction","date":"2023-10-17","arxiv_id":"2310.11009","n_code_links":1,"syntology":null},{"paper":null,"slug":"faithful-knowledge-graph-explanations-for","title":"Towards Faithful Knowledge Graph Explanation Through Deep Alignment in Commonsense Question Answering","date":"2023-10-07","arxiv_id":"2310.04910","n_code_links":0,"syntology":null},{"paper":"/paper/probabilistically-rewired-message-passing","slug":"probabilistically-rewired-message-passing","title":"Probabilistically Rewired Message-Passing Neural Networks","date":"2023-10-03","arxiv_id":"2310.02156","n_code_links":1,"syntology":{"ran":6,"of":8,"n_ran_checked":6,"n_instrument":0,"unverified":2,"pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["chendiqian/PR-MPNN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/band-gap-regression-with-architecture","slug":"band-gap-regression-with-architecture","title":"Band-gap regression with architecture-optimized message-passing neural networks","date":"2023-09-12","arxiv_id":"2309.06348","n_code_links":1,"syntology":null},{"paper":"/paper/a-principal-odor-map-unifies-diverse-tasks-in","slug":"a-principal-odor-map-unifies-diverse-tasks-in","title":"A principal odor map unifies diverse tasks in olfactory perception","date":"2023-09-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"a-graph-neural-network-approach-for-temporal","title":"A Graph Neural Network Approach for Temporal Mesh Blending and Correspondence","date":"2023-06-23","arxiv_id":"2306.13452","n_code_links":0,"syntology":null},{"paper":"/paper/substitutional-alloying-using-crystal-graph","slug":"substitutional-alloying-using-crystal-graph","title":"Substitutional Alloying Using Crystal Graph Neural Networks","date":"2023-06-19","arxiv_id":"2306.10766","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-on-graphs-under-label-noise","title":"Learning on Graphs under Label Noise","date":"2023-06-14","arxiv_id":"2306.08194","n_code_links":0,"syntology":null},{"paper":"/paper/local-to-global-perspectives-on-graph-neural","slug":"local-to-global-perspectives-on-graph-neural","title":"Local-to-global Perspectives on Graph Neural Networks","date":"2023-06-11","arxiv_id":"2306.06547","n_code_links":1,"syntology":null},{"paper":null,"slug":"simplicial-message-passing-for-chemical","title":"Simplicial Message Passing for Chemical Property Prediction","date":"2023-06-09","arxiv_id":"2307.05392","n_code_links":0,"syntology":null},{"paper":"/paper/fine-grained-expressivity-of-graph-neural","slug":"fine-grained-expressivity-of-graph-neural","title":"Fine-grained Expressivity of Graph Neural Networks","date":"2023-06-06","arxiv_id":"2306.03698","n_code_links":1,"syntology":null},{"paper":null,"slug":"how-does-over-squashing-affect-the-power-of","title":"How does over-squashing affect the power of GNNs?","date":"2023-06-06","arxiv_id":"2306.03589","n_code_links":0,"syntology":null},{"paper":"/paper/a-graphon-signal-analysis-of-graph-neural","slug":"a-graphon-signal-analysis-of-graph-neural","title":"A graphon-signal analysis of graph neural networks","date":"2023-05-25","arxiv_id":"2305.15987","n_code_links":1,"syntology":null},{"paper":"/paper/drew-dynamically-rewired-message-passing-with","slug":"drew-dynamically-rewired-message-passing-with","title":"DRew: Dynamically Rewired Message Passing with Delay","date":"2023-05-13","arxiv_id":"2305.08018","n_code_links":1,"syntology":{"ran":6,"of":9,"n_ran_checked":5,"n_instrument":1,"unverified":3,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["bengutteridge/drew"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/ewald-based-long-range-message-passing-for","slug":"ewald-based-long-range-message-passing-for","title":"Ewald-based Long-Range Message Passing for Molecular Graphs","date":"2023-03-08","arxiv_id":"2303.04791","n_code_links":1,"syntology":{"ran":8,"of":10,"n_ran_checked":8,"n_instrument":0,"unverified":2,"pointer_only":10,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["arthurkosmala/EwaldMP"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":2,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/neural-common-neighbor-with-completion-for","slug":"neural-common-neighbor-with-completion-for","title":"Neural Common Neighbor with Completion for Link Prediction","date":"2023-02-02","arxiv_id":"2302.00890","n_code_links":1,"syntology":null},{"paper":"/paper/on-the-connection-between-mpnn-and-graph","slug":"on-the-connection-between-mpnn-and-graph","title":"On the Connection Between MPNN and Graph Transformer","date":"2023-01-27","arxiv_id":"2301.11956","n_code_links":1,"syntology":null},{"paper":"/paper/end-to-end-ai-framework-for-hyperparameter","slug":"end-to-end-ai-framework-for-hyperparameter","title":"End-to-end AI framework for interpretable prediction of molecular and crystal properties","date":"2022-12-21","arxiv_id":"2212.11317","n_code_links":1,"syntology":null},{"paper":"/paper/multi-mask-aggregators-for-graph-neural","slug":"multi-mask-aggregators-for-graph-neural","title":"Multi-Mask Aggregators for Graph Neural Networks","date":"2022-11-24","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"predicting-the-clinical-citation-count-of","title":"Predicting the clinical citation count of biomedical papers using multilayer perceptron neural network","date":"2022-09-07","arxiv_id":"2210.06346","n_code_links":0,"syntology":null},{"paper":"/paper/spatio-temporal-wind-speed-forecasting-using","slug":"spatio-temporal-wind-speed-forecasting-using","title":"Spatio-Temporal Wind Speed Forecasting using Graph Networks and Novel Transformer Architectures","date":"2022-08-29","arxiv_id":"2208.13585","n_code_links":1,"syntology":null},{"paper":"/paper/mace-higher-order-equivariant-message-passing","slug":"mace-higher-order-equivariant-message-passing","title":"MACE: Higher Order Equivariant Message Passing Neural Networks for Fast and Accurate Force Fields","date":"2022-06-15","arxiv_id":"2206.07697","n_code_links":4,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ACEsuit/mace"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"we-cannot-guarantee-safety-the-undecidability","title":"Fundamental Limits in Formal Verification of Message-Passing Neural Networks","date":"2022-06-10","arxiv_id":"2206.05070","n_code_links":0,"syntology":null},{"paper":"/paper/continuous-generative-neural-networks","slug":"continuous-generative-neural-networks","title":"Continuous Generative Neural Networks: A Wavelet-Based Architecture in Function Spaces","date":"2022-05-29","arxiv_id":"2205.14627","n_code_links":1,"syntology":null},{"paper":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","n_code_links":4,"syntology":{"ran":3,"of":21,"n_ran_checked":1,"n_instrument":2,"unverified":18,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified","official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"automatic-identification-of-chemical-moieties","title":"Automatic Identification of Chemical Moieties","date":"2022-03-30","arxiv_id":"2203.16205","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-expressive-power-of-message-passing","title":"On the expressive power of message-passing neural networks as global feature map transformers","date":"2022-03-17","arxiv_id":"2203.09555","n_code_links":0,"syntology":null},{"paper":null,"slug":"stability-and-generalization-capabilities-of","title":"Generalization Analysis of Message Passing Neural Networks on Large Random Graphs","date":"2022-02-01","arxiv_id":"2202.00645","n_code_links":0,"syntology":null},{"paper":null,"slug":"edge-based-tensor-prediction-via-graph-neural","title":"Edge-based Tensor prediction via graph neural networks","date":"2022-01-15","arxiv_id":"2201.05770","n_code_links":0,"syntology":null},{"paper":"/paper/multiwave-covid-19-prediction-via-social","slug":"multiwave-covid-19-prediction-via-social","title":"Multiwave COVID-19 Prediction from Social Awareness using Web Search and Mobility Data","date":"2021-10-22","arxiv_id":"2110.11584","n_code_links":1,"syntology":null},{"paper":null,"slug":"cgnn-traffic-classification-with-graph-neural","title":"CGNN: Traffic Classification with Graph Neural Network","date":"2021-10-19","arxiv_id":"2110.09726","n_code_links":0,"syntology":null},{"paper":"/paper/from-stars-to-subgraphs-uplifting-any-gnn","slug":"from-stars-to-subgraphs-uplifting-any-gnn","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","date":"2021-10-07","arxiv_id":"2110.03753","n_code_links":2,"syntology":{"ran":15,"of":18,"n_ran_checked":14,"n_instrument":1,"unverified":3,"pointer_only":2,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 3 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["gnnaskernel/gnnaskernel"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/equivariant-subgraph-aggregation-networks","slug":"equivariant-subgraph-aggregation-networks","title":"Equivariant Subgraph Aggregation Networks","date":"2021-10-06","arxiv_id":"2110.02910","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["beabevi/esan"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"gir-framework-learning-graph-positional","title":"GIR Framework: Learning Graph Positional Embeddings with Anchor Indication and Path Encoding","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"time-based-dynamic-controllability-of","title":"Time-based Dynamic Controllability of Disjunctive Temporal Networks with Uncertainty: A Tree Search Approach with Graph Neural Network Guidance","date":"2021-08-02","arxiv_id":"2108.01068","n_code_links":0,"syntology":null},{"paper":null,"slug":"curvature-graph-neural-network","title":"Curvature Graph Neural Network","date":"2021-06-30","arxiv_id":"2106.15762","n_code_links":0,"syntology":null},{"paper":"/paper/breaking-the-limits-of-message-passing-graph","slug":"breaking-the-limits-of-message-passing-graph","title":"Breaking the Limits of Message Passing Graph Neural Networks","date":"2021-06-08","arxiv_id":"2106.04319","n_code_links":2,"syntology":null},{"paper":null,"slug":"predicting-quantum-potentials-by-deep-neural","title":"Predicting Quantum Potentials by Deep Neural Network and Metropolis Sampling","date":"2021-06-06","arxiv_id":"2106.03126","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-message-passing-for-multi-relational","title":"Neural Message Passing for Multi-Relational Ordered and Recursive Hypergraphs","date":"2020-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/bayesian-graph-neural-networks-for-molecular","slug":"bayesian-graph-neural-networks-for-molecular","title":"Bayesian Graph Neural Networks for Molecular Property Prediction","date":"2020-11-25","arxiv_id":"2012.02089","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-data-flow-analysis-1","title":"Deep Data Flow Analysis","date":"2020-11-21","arxiv_id":"2012.01470","n_code_links":0,"syntology":null},{"paper":"/paper/molecular-mechanics-driven-graph-neural","slug":"molecular-mechanics-driven-graph-neural","title":"Molecular Mechanics-Driven Graph Neural Network with Multiplex Graph for Molecular Structures","date":"2020-11-15","arxiv_id":"2011.07457","n_code_links":3,"syntology":null},{"paper":"/paper/a-step-towards-neural-genome-assembly","slug":"a-step-towards-neural-genome-assembly","title":"A step towards neural genome assembly","date":"2020-11-10","arxiv_id":"2011.05013","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["lvrcek/NeuralLayout"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"graph-neural-network-architecture-search-for","title":"Graph Neural Network Architecture Search for Molecular Property Prediction","date":"2020-08-27","arxiv_id":"2008.12187","n_code_links":0,"syntology":null},{"paper":"/paper/deep-learning-for-abstract-argumentation","slug":"deep-learning-for-abstract-argumentation","title":"Deep Learning for Abstract Argumentation Semantics","date":"2020-07-15","arxiv_id":"2007.07629","n_code_links":1,"syntology":null},{"paper":null,"slug":"how-hard-is-graph-isomorphism-for-graph","title":"How hard is to distinguish graphs with graph neural networks?","date":"2020-05-13","arxiv_id":"2005.06649","n_code_links":0,"syntology":null},{"paper":"/paper/directional-message-passing-for-molecular-1","slug":"directional-message-passing-for-molecular-1","title":"Directional Message Passing for Molecular Graphs","date":"2020-03-06","arxiv_id":"2003.03123","n_code_links":4,"syntology":{"ran":8,"of":10,"n_ran_checked":8,"n_instrument":0,"unverified":2,"pointer_only":3,"phrase":"8 ran (of which 1 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["klicperajo/dimenet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"assessing-graph-based-deep-learning-models","title":"Assessing Graph-based Deep Learning Models for Predicting Flash Point","date":"2020-02-26","arxiv_id":"2002.11315","n_code_links":0,"syntology":null},{"paper":"/paper/crystal-graph-neural-networks-for-data-mining","slug":"crystal-graph-neural-networks-for-data-mining","title":"Crystal Graph Neural Networks for Data Mining in Materials Science","date":"2019-05-27","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/neural-message-passing-for-quantum-chemistry","slug":"neural-message-passing-for-quantum-chemistry","title":"Neural Message Passing for Quantum Chemistry","date":"2017-04-04","arxiv_id":"1704.01212","n_code_links":20,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["brain-research/mpnn"],"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":74,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":74,"with_a_code_link":34,"where_syntology_ran_a_sample":13,"not_listed_spam_title":0,"listed":74,"listed_where_code_ran":13,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":12,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":12,"listed_every_run_a_failure_of_syntologys_instrument":1,"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":13,"papers_where_code_ran_first_page":"/method/mpnn/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/mpnn/papers/ran/1","json":"/method/mpnn/papers/ran/1.json","rows":13}],"tasks":[{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":16},{"task":"/task/node-classification","name":"Node Classification","papers":11},{"task":"/task/graph-classification","name":"Graph Classification","papers":8},{"task":"/task/prediction","name":"Prediction","papers":8},{"task":"/task/graph-regression","name":"Graph Regression","papers":7},{"task":"/task/link-prediction","name":"Link Prediction","papers":6},{"task":"/task/property-prediction","name":"Property Prediction","papers":6},{"task":"/task/formation-energy","name":"Formation Energy","papers":5},{"task":"/task/graph-learning","name":"Graph Learning","papers":4},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":4},{"task":"/task/molecular-property-prediction","name":"Molecular Property Prediction","papers":4},{"task":"/task/band-gap","name":"Band Gap","papers":3},{"task":"/task/benchmarking","name":"Benchmarking","papers":3},{"task":"/task/drug-discovery","name":"Drug Discovery","papers":3},{"task":"/task/architecture-search","name":"Neural Architecture Search","papers":3},{"task":"/task/classification-1","name":"Classification","papers":2},{"task":"/task/deep-learning","name":"Deep Learning","papers":2},{"task":"/task/graph-property-prediction","name":"Graph Property Prediction","papers":2},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":2},{"task":"/task/management","name":"Management","papers":2}],"tasks_shown":20,"n_tasks":63,"usage_by_year":[{"year":"2017","papers":1},{"year":"2019","papers":1},{"year":"2020","papers":10},{"year":"2021","papers":9},{"year":"2022","papers":12},{"year":"2023","papers":18},{"year":"2024","papers":13},{"year":"2025","papers":10}],"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/mpnn"},"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=MPNN","read_at":"2026-10-05T00:59:20+00:00","query":"MPNN","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":"1704.01212","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 'MPNN' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["fully differentiable MPNN","fully differentiable MPNN","Interleaved Multiscale Message-Passing Neural Networks (IM-MPNN)"],"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":"6bacab8da1451da46b3e6b22bbe7c72f9a569f76c0c2adff4bec3c59eb784116","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}