{"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/dagnn","slug":"dagnn","name":"DAGNN","full_name":"Directed Acyclic Graph Neural Network","full_name_withheld":false,"description_markdown":"A GNN for dags, which injects their topological order as an inductive bias via asynchronous message passing.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Directed Acyclic Graph Neural Networks","paper":"/paper/directed-acyclic-graph-neural-networks-1","first_author":"Veronika Thost","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/directed-acyclic-graph-neural-networks-1"},"source":{"url":"https://arxiv.org/abs/2101.07965v3","title":"Directed Acyclic Graph Neural Networks","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 Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":6,"archive_num_papers":6,"papers_newest_first":[{"paper":null,"slug":"beyond-graph-convolutional-network-an","title":"Beyond Graph Convolutional Network: An Interpretable Regularizer-centered Optimization Framework","date":"2023-01-11","arxiv_id":"2301.04318","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-scalable-deep-reinforcement-learning-model","title":"A Scalable Deep Reinforcement Learning Model for Online Scheduling Coflows of Multi-Stage Jobs for High Performance Computing","date":"2021-12-21","arxiv_id":"2112.11055","n_code_links":0,"syntology":null},{"paper":null,"slug":"stabilized-self-training-with-negative","title":"Stabilized Self-training with Negative Sampling on Few-labeled Graph Data","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/directed-acyclic-graph-neural-networks-1","slug":"directed-acyclic-graph-neural-networks-1","title":"Directed Acyclic Graph Neural Networks","date":"2021-01-20","arxiv_id":"2101.07965","n_code_links":1,"syntology":null},{"paper":"/paper/dynamic-self-training-framework-for-graph","slug":"dynamic-self-training-framework-for-graph","title":"Effective Stabilized Self-Training on Few-Labeled Graph Data","date":"2019-10-07","arxiv_id":"1910.02684","n_code_links":1,"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/learning-scheduling-algorithms-for-data","slug":"learning-scheduling-algorithms-for-data","title":"Learning Scheduling Algorithms for Data Processing Clusters","date":"2018-10-03","arxiv_id":"1810.01963","n_code_links":2,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"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","official":{"repos":["hongzimao/decima-sim"],"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":6,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":6,"with_a_code_link":3,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":6,"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/dagnn/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/dagnn/papers/ran/1","json":"/method/dagnn/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/benchmarking","name":"Benchmarking","papers":2},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":2},{"task":"/task/node-classification","name":"Node Classification","papers":2},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":2},{"task":"/task/scheduling","name":"Scheduling","papers":2},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":1},{"task":"/task/graph-property-prediction","name":"Graph Property Prediction","papers":1},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":1},{"task":"/task/model-selection","name":"Model Selection","papers":1},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":1}],"tasks_shown":10,"n_tasks":10,"usage_by_year":[{"year":"2018","papers":1},{"year":"2019","papers":1},{"year":"2021","papers":3},{"year":"2023","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/dagnn"},"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=DAGNN","read_at":"2026-10-05T00:54:26+00:00","query":"DAGNN","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"DAGNN","origin_arxiv_id":"2101.07965"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2101.07965","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":2,"served":{"arxiv_id":"2101.07965","citations":143},"leading_other_bearer":{"arxiv_id":"2105.14428","title":"DAGNN: Demand-aware Graph Neural Networks for Session-based Recommendation","citations":11,"named_by":["title_prefix"],"bearer_name":"DAGNN: Demand-aware Graph Neural Networks for Session-based Recommendation","ask_with":"have('2105.14428')"},"n_other_bearers_listed":1,"note":"1 other thing(s) here are also called 'DAGNN', and none of them is cited more than the paper this answer is about. They are listed in `also_named` -- check `served.arxiv_id` is the paper you meant."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2101.07965","page":"/paper/directed-acyclic-graph-neural-networks-1","syntology_url":"https://syntology.ai/paper/2101.07965","in_graph_layer":false,"samples":0},"line":"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.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"e7745bd215ae6df2b8e52f105f6f719b31d9f35b13f22d5f6fd99104646e40f2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}