{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/rgcn","entry":"RGCN","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2311.01196","paper":"/paper/combating-bilateral-edge-noise-for-robust-1","title":"Combating Bilateral Edge Noise for Robust Link Prediction","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DSE-MSU/DeepRobust","path":"deeprobust/graph/defense/r_gcn.py","file_url":"https://github.com/DSE-MSU/DeepRobust/blob/HEAD/deeprobust/graph/defense/r_gcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"113eaa2f60b75746","mcp_get_code":{"code_sha256":"113eaa2f60b75746"}},{"arxiv_id":"2305.08457","paper":"/paper/molhf-a-hierarchical-normalizing-flow-for","title":"MolHF: A Hierarchical Normalizing Flow for Molecular Graph Generation","date":"2023-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"violet-sto/molhf","path":"models/MolHF.py","file_url":"https://github.com/violet-sto/molhf/blob/HEAD/models/MolHF.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"255d29628ddbc5c1","mcp_get_code":{"code_sha256":"255d29628ddbc5c1"}},{"arxiv_id":"2208.00850","paper":"/paper/subgraph-neighboring-relations-infomax-for","title":"Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs","date":"2022-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tebmer/SNRI","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"73029d39434303a6","mcp_get_code":{"code_sha256":"73029d39434303a6"}},{"arxiv_id":"2103.03642","paper":"/paper/topology-aware-correlations-between-relations","title":"Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs","date":"2021-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MIRALab-USTC/KG-TACT","path":"code/Ranking/model/dgl/rgcn_model.py","file_url":"https://github.com/MIRALab-USTC/KG-TACT/blob/HEAD/code/Ranking/model/dgl/rgcn_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"501363f5d25987be","mcp_get_code":{"code_sha256":"501363f5d25987be"}},{"arxiv_id":"2005.00791","paper":"/paper/kingdom-knowledge-guided-domain-adaptation","title":"KinGDOM: Knowledge-Guided DOMain adaptation for sentiment analysis","date":"2020-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declare-lab/kingdom","path":"rgcn.py","file_url":"https://github.com/declare-lab/kingdom/blob/HEAD/rgcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"97d877c70aa35734","mcp_get_code":{"code_sha256":"97d877c70aa35734"}}]}