{"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/rgcn","slug":"rgcn","name":"RGCN","full_name":"Relational Graph Convolution Network","full_name_withheld":false,"description_markdown":"An **RGCN**, or **Relational Graph Convolution Network**, is a an application of the [GCN framework](https://paperswithcode.com/method/gcn) to modeling relational data, specifically\r\nto link prediction and entity classification tasks.\r\n\r\nSee [here](https://docs.dgl.ai/en/0.4.x/tutorials/models/1_gnn/4_rgcn.html) for an in-depth explanation of RGCNs by DGL.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Modeling Relational Data with Graph Convolutional Networks","paper":"/paper/modeling-relational-data-with-graph","first_author":"Michael Schlichtkrull","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/modeling-relational-data-with-graph"},"source":{"url":"http://arxiv.org/abs/1703.06103v4","title":"Modeling Relational Data with Graph Convolutional 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 Models","url":"/methods/category/graph-models","pwc_aliases":[]}],"n_papers_tagged":22,"archive_num_papers":22,"papers_newest_first":[{"paper":null,"slug":"zero-resource-hallucination-detection-for","title":"Zero-resource Hallucination Detection for Text Generation via Graph-based Contextual Knowledge Triples Modeling","date":"2024-09-17","arxiv_id":"2409.11283","n_code_links":0,"syntology":null},{"paper":null,"slug":"relational-graph-convolutional-networks-for-1","title":"Relational Graph Convolutional Networks for Sentiment Analysis","date":"2024-04-16","arxiv_id":"2404.13079","n_code_links":0,"syntology":null},{"paper":null,"slug":"gradxkg-a-universal-explain-per-use-temporal","title":"GradXKG: A Universal Explain-per-use Temporal Knowledge Graph Explainer","date":"2023-10-07","arxiv_id":"2310.04889","n_code_links":0,"syntology":null},{"paper":null,"slug":"message-intercommunication-for-inductive","title":"Message Intercommunication for Inductive Relation Reasoning","date":"2023-05-23","arxiv_id":"2305.14074","n_code_links":0,"syntology":null},{"paper":"/paper/improving-dis-agreement-detection-with","slug":"improving-dis-agreement-detection-with","title":"Improving (Dis)agreement Detection with Inductive Social Relation Information From Comment-Reply Interactions","date":"2023-02-08","arxiv_id":"2302.03950","n_code_links":1,"syntology":null},{"paper":null,"slug":"pigeon-optimizing-cuda-code-generator-for-end","title":"Hector: An Efficient Programming and Compilation Framework for Implementing Relational Graph Neural Networks in GPU Architectures","date":"2023-01-16","arxiv_id":"2301.06284","n_code_links":0,"syntology":null},{"paper":"/paper/mgtab-a-multi-relational-graph-based-twitter","slug":"mgtab-a-multi-relational-graph-based-twitter","title":"MGTAB: A Multi-Relational Graph-Based Twitter Account Detection Benchmark","date":"2023-01-03","arxiv_id":"2301.01123","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-relation-aware-neighborhood","slug":"efficient-relation-aware-neighborhood","title":"Efficient Relation-aware Neighborhood Aggregation in Graph Neural Networks via Tensor Decomposition","date":"2022-12-11","arxiv_id":"2212.05581","n_code_links":1,"syntology":null},{"paper":null,"slug":"mitigating-relational-bias-on-knowledge","title":"Mitigating Relational Bias on Knowledge Graphs","date":"2022-11-26","arxiv_id":"2211.14489","n_code_links":0,"syntology":null},{"paper":"/paper/sparsetir-composable-abstractions-for-sparse","slug":"sparsetir-composable-abstractions-for-sparse","title":"SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learning","date":"2022-07-11","arxiv_id":"2207.04606","n_code_links":2,"syntology":{"ran":6,"of":6,"n_ran_checked":5,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 2 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["uwsampl/sparsetir","uwsampl/sparsetir-artifact"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/comdense-combined-dense-embedding-of-relation","slug":"comdense-combined-dense-embedding-of-relation","title":"ComDensE : Combined Dense Embedding of Relation-aware and Common Features for Knowledge Graph Completion","date":"2022-06-29","arxiv_id":"2206.14925","n_code_links":1,"syntology":null},{"paper":null,"slug":"ethereum-fraud-detection-with-heterogeneous","title":"Ethereum Fraud Detection with Heterogeneous Graph Neural Networks","date":"2022-03-23","arxiv_id":"2203.12363","n_code_links":0,"syntology":null},{"paper":"/paper/relational-graph-convolutional-networks-a","slug":"relational-graph-convolutional-networks-a","title":"Relational Graph Convolutional Networks: A Closer Look","date":"2021-07-21","arxiv_id":"2107.10015","n_code_links":1,"syntology":null},{"paper":"/paper/relational-graph-convolutional-networks-for","slug":"relational-graph-convolutional-networks-for","title":"Relational graph convolutional networks for predicting blood-brain barrier penetration of drug molecules","date":"2021-07-04","arxiv_id":"2107.06773","n_code_links":1,"syntology":null},{"paper":"/paper/medical-entity-disambiguation-using-graph","slug":"medical-entity-disambiguation-using-graph","title":"Medical Entity Disambiguation Using Graph Neural Networks","date":"2021-04-03","arxiv_id":"2104.01488","n_code_links":0,"syntology":null},{"paper":null,"slug":"detecting-hostile-posts-using-relational","title":"Detecting Hostile Posts using Relational Graph Convolutional Network","date":"2021-01-10","arxiv_id":"2101.03485","n_code_links":0,"syntology":null},{"paper":null,"slug":"modeling-global-semantics-for-question","title":"Modeling Global Semantics for Question Answering over Knowledge Bases","date":"2021-01-05","arxiv_id":"2101.01510","n_code_links":0,"syntology":null},{"paper":"/paper/few-shot-link-prediction-via-graph-neural","slug":"few-shot-link-prediction-via-graph-neural","title":"Few-shot link prediction via graph neural networks for Covid-19 drug-repurposing","date":"2020-07-20","arxiv_id":"2007.10261","n_code_links":1,"syntology":null},{"paper":"/paper/evaluating-logical-generalization-in-graph","slug":"evaluating-logical-generalization-in-graph","title":"Evaluating Logical Generalization in Graph Neural Networks","date":"2020-03-14","arxiv_id":"2003.06560","n_code_links":1,"syntology":null},{"paper":null,"slug":"how-to-make-a-blt-sandwich-learning-to-reason","title":"How to Make a BLT Sandwich? Learning to Reason towards Understanding Web Instructional Videos","date":"2018-12-02","arxiv_id":"1812.00344","n_code_links":0,"syntology":null},{"paper":"/paper/modeling-polypharmacy-side-effects-with-graph","slug":"modeling-polypharmacy-side-effects-with-graph","title":"Modeling polypharmacy side effects with graph convolutional networks","date":"2018-02-02","arxiv_id":"1802.00543","n_code_links":1,"syntology":null},{"paper":"/paper/modeling-relational-data-with-graph","slug":"modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","arxiv_id":"1703.06103","n_code_links":27,"syntology":{"ran":18,"of":32,"n_ran_checked":13,"n_instrument":5,"unverified":14,"pointer_only":15,"phrase":"18 ran (of which 3 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 5 where Syntology's instrument failed) · 14 unverified","official":{"repos":["tkipf/relational-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}}],"papers_shown":22,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":22,"with_a_code_link":11,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":22,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"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":2,"papers_where_code_ran_first_page":"/method/rgcn/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/rgcn/papers/ran/1","json":"/method/rgcn/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":7},{"task":"/task/link-prediction","name":"Link Prediction","papers":5},{"task":null,"name":"Relation","papers":5},{"task":"/task/knowledge-graph-completion","name":"Knowledge Graph Completion","papers":3},{"task":"/task/node-classification","name":"Node Classification","papers":3},{"task":"/task/classification","name":"General Classification","papers":2},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":2},{"task":"/task/knowledge-graph-embedding","name":"Knowledge Graph Embedding","papers":2},{"task":"/task/multi-task-learning","name":"Multi-Task Learning","papers":2},{"task":"/task/question-answering","name":"Question Answering","papers":2},{"task":null,"name":"8k","papers":1},{"task":"/task/c-code","name":"C++ code","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/continual-learning","name":"Continual Learning","papers":1},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":1},{"task":"/task/decision-making","name":"Decision Making","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/deep-learning","name":"Deep Learning","papers":1},{"task":"/task/diversity","name":"Diversity","papers":1},{"task":"/task/drug-discovery","name":"Drug Discovery","papers":1}],"tasks_shown":20,"n_tasks":54,"usage_by_year":[{"year":"2017","papers":1},{"year":"2018","papers":2},{"year":"2020","papers":2},{"year":"2021","papers":5},{"year":"2022","papers":5},{"year":"2023","papers":5},{"year":"2024","papers":2}],"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/rgcn"},"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=RGCN","read_at":"2026-10-05T01:01:17+00:00","query":"RGCN","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":"1703.06103","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 'RGCN' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Gated-RGCN"],"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":"bb5051fd4809691912c06df8e667ff6c9785b545124eb69c734d8cc718131662","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}