{"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/typed-graph-networks","title":"Typed Graph Networks","arxiv_id":"1901.07984","date":"2019-01-23","proceeding":null,"authors":["Marcelo O. R. Prates","Pedro H. C. Avelar","Henrique Lemos","Marco Gori","Luis Lamb"],"abstract":"Recently, the deep learning community has given growing attention to neural\narchitectures engineered to learn problems in relational domains. Convolutional\nNeural Networks employ parameter sharing over the image domain, tying the\nweights of neural connections on a grid topology and thus enforcing the\nlearning of a number of convolutional kernels. By instantiating trainable\nneural modules and assembling them in varied configurations (apart from grids),\none can enforce parameter sharing over graphs, yielding models which can\neffectively be fed with relational data. In this context, vertices in a graph\ncan be projected into a hyperdimensional real space and iteratively refined\nover many message-passing iterations in an end-to-end differentiable\narchitecture. Architectures of this family have been referred to with several\ndefinitions in the literature, such as Graph Neural Networks, Message-passing\nNeural Networks, Relational Networks and Graph Networks. In this paper, we\nrevisit the original Graph Neural Network model and show that it generalises\nmany of the recent models, which in turn benefit from the insight of thinking\nabout vertex \\textbf{types}. To illustrate the generality of the original\nmodel, we present a Graph Neural Network formalisation, which partitions the\nvertices of a graph into a number of types. Each type represents an entity in\nthe ontology of the problem one wants to learn. This allows - for instance -\none to assign embeddings to edges, hyperedges, and any number of global\nattributes of the graph. As a companion to this paper we provide a\nPython/Tensorflow library to facilitate the development of such architectures,\nwith which we instantiate the formalisation to reproduce a number of models\nproposed in the current literature.","url_abs":"http://arxiv.org/abs/1901.07984v3","url_pdf":"http://arxiv.org/pdf/1901.07984v3.pdf","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":"typed-graph-networks","repo_url":"https://github.com/machine-reasoning-ufrgs/typed-graph-network","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"typed-graph-networks","repo_url":"https://github.com/machine-reasoning-ufrgs/graph-neural-networks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"}],"methods":[{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"machine-reasoning-ufrgs/typed-graph-network","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"machine-reasoning-ufrgs/graph-neural-networks","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1806.01261"],"harvested_for_calls":[{"arxiv_id":"1806.01261","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01261"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01261\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"c765cbf76dde57a5bf99f3f0a13f0d0e64dddadf6847c22357c5615d58ddae26","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}