{"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":"/paper/graph-edit-networks","title":"Graph Edit Networks","arxiv_id":null,"date":"2021-01-01","proceeding":"ICLR 2021 1","authors":["Benjamin Paassen","Daniele Grattarola","Daniele Zambon","Cesare Alippi","Barbara Eva Hammer"],"abstract":"Recent research on graph neural networks has made significant advances in learning representations for classification and regression on graphs.  However, time series prediction on graphs is still limited to attribute changes, link prediction, or graph generation. In this paper, we connect graph neural networks to the long-standing research tradition of graph edits. Graph edits are expressive enough to model any graph change and are typically highly sparse, facilitating interpretation  and reducing the time complexity from quadratic to linear. We propose to augment graph neural nets with a simple linear output layer - which we call the graph edit network - to predict graph edits. Our key contribution is a proof that graph edit networks are expressive enough to edit any graph into any other using almost as few edits as possible, i.e. we prove that graph edit networks can approximate the NP-hard graph edit distance. With this result, we hope to provide a firm theoretical basis for a next generation of time series prediction models. We further provide an experimental proof-of-concept by verifying that graph neural nets with our output layer can learn a variety of graph dynamical systems, which are difficult to learn for baselines in the literature.","url_abs":"https://openreview.net/forum?id=dlEJsyHGeaL","url_pdf":"https://openreview.net/pdf?id=dlEJsyHGeaL","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"graph-edit-networks","repo_url":"https://gitlab.com/bpaassen/graph-edit-networks","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"graph-generation","task_name":"Graph Generation"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":"time-series-prediction","task_name":"Time Series Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"gitlab.com/bpaassen/graph-edit-networks","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"62e48acd48eb106f02711fb460ed97508269eea610e7d45284ef4a96bf392122","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}