Methods › Graphs › Graph Embeddings › DAGNN
Directed Acyclic Graph Neural Network
DAGNN
Introduced by Veronika Thost et al. in Directed Acyclic Graph Neural Networks
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
A GNN for dags, which injects their topological order as an inductive bias via asynchronous message passing.
In Syntology repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). This answer is about arXiv:2101.07965, the paper the archive credits with this method.
Origin paper of this answer, arXiv:2101.07965 (its page on this site · its page on Syntology).
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: 6 · with a code link: 3 · where Syntology ran a sample: 1 (1 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 (1 of 6 tagged: 1 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 6 of 6, 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.
-
Beyond Graph Convolutional Network: An Interpretable Regularizer-centered Optimization Framework 11 Jan 2023 · 0 repositories · arXiv:2301.04318
-
A Scalable Deep Reinforcement Learning Model for Online Scheduling Coflows of Multi-Stage Jobs for High Performance Computing 21 Dec 2021 · 0 repositories · arXiv:2112.11055
-
Stabilized Self-training with Negative Sampling on Few-labeled Graph Data 29 Sep 2021 · 0 repositories
-
Directed Acyclic Graph Neural Networks 20 Jan 2021 · 1 repository · arXiv:2101.07965
-
Effective Stabilized Self-Training on Few-Labeled Graph Data 7 Oct 2019 · 1 repository · arXiv:1910.02684Syntology 0 ran · 1 unverified (of 1 harvested sample) · 1 pointer-only (licence)
-
Learning Scheduling Algorithms for Data Processing Clusters 3 Oct 2018 · 2 repositories · arXiv:1810.01963Syntology community repositories only · 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 4 harvested samples)
Tasks archive 2025-07-28
10 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
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
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