{"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/gcnii","slug":"gcnii","name":"GCNII","full_name":"GCNII","full_name_withheld":false,"description_markdown":"**GCNII** is an extension of a [Graph Convolution Networks](https://www.paperswithcode.com/method/gcn) with two new techniques, initial residual and identify mapping, to tackle the problem of oversmoothing -- where stacking more layers and adding non-linearity tends to degrade performance. At each layer, initial residual constructs a skip connection from the input layer, while identity mapping adds an identity matrix to the weight matrix.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Simple and Deep Graph Convolutional Networks","paper":"/paper/simple-and-deep-graph-convolutional-networks-1","first_author":"Ming Chen","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/simple-and-deep-graph-convolutional-networks-1"},"source":{"url":"https://arxiv.org/abs/2007.02133v1","title":"Simple and Deep 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":7,"archive_num_papers":7,"papers_newest_first":[{"paper":null,"slug":"understanding-and-improving-deep-graph-neural","title":"Understanding and Improving Deep Graph Neural Networks: A Probabilistic Graphical Model Perspective","date":"2023-01-25","arxiv_id":"2301.10536","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-duplicated-characterization-of-graph","title":"Multi-duplicated Characterization of Graph Structures using Information Gain Ratio for Graph Neural Networks","date":"2022-12-24","arxiv_id":"2212.12691","n_code_links":0,"syntology":null},{"paper":null,"slug":"every-node-counts-improving-the-training-of","title":"Every Node Counts: Improving the Training of Graph Neural Networks on Node Classification","date":"2022-11-29","arxiv_id":"2211.16631","n_code_links":0,"syntology":null},{"paper":null,"slug":"wsgat-weighted-and-signed-graph-attention","title":"wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction","date":"2021-09-21","arxiv_id":"2109.11519","n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-and-interpretable-graph-convolution","slug":"adaptive-and-interpretable-graph-convolution","title":"Layer-wise Adaptive Graph Convolution Networks Using Generalized Pagerank","date":"2021-08-24","arxiv_id":"2108.10636","n_code_links":0,"syntology":null},{"paper":"/paper/extract-the-knowledge-of-graph-neural","slug":"extract-the-knowledge-of-graph-neural","title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","date":"2021-03-04","arxiv_id":"2103.02885","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["BUPT-GAMMA/CPF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","n_code_links":4,"syntology":{"ran":5,"of":7,"n_ran_checked":5,"n_instrument":0,"unverified":2,"pointer_only":4,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","official":{"repos":["chennnM/GCNII"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}}],"papers_shown":7,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":7,"with_a_code_link":2,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":7,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/gcnii/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/gcnii/papers/ran/1","json":"/method/gcnii/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/node-classification","name":"Node Classification","papers":5},{"task":"/task/link-prediction","name":"Link Prediction","papers":2},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/generalization-bounds","name":"Generalization Bounds","papers":1},{"task":"/task/graph-attention","name":"Graph Attention","papers":1},{"task":"/task/graph-classification","name":"Graph Classification","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/graph-regression","name":"Graph Regression","papers":1},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":1},{"task":"/task/link-sign-prediction","name":"Link Sign Prediction","papers":1},{"task":"/task/node-classification-on-non-homophilic","name":"Node Classification on Non-Homophilic (Heterophilic) Graphs","papers":1},{"task":"/task/node-property-prediction","name":"Node Property Prediction","papers":1},{"task":"/task/variational-inference","name":"Variational Inference","papers":1}],"tasks_shown":13,"n_tasks":13,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":3},{"year":"2022","papers":2},{"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/gcnii"},"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=GCNII","read_at":"2026-10-05T00:56:41+00:00","query":"GCNII","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":"GCNII","origin_arxiv_id":"2007.02133"},"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":"2007.02133","repositories":{"listed":4,"in_graph":4,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2007.02133","citations":null},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'GCNII'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2007.02133","page":"/paper/simple-and-deep-graph-convolutional-networks-1","syntology_url":"https://syntology.ai/paper/2007.02133","in_graph_layer":true,"samples":7,"ran":5,"n_ran_checked":5,"n_instrument":0,"unverified":2,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 4 listed of 4 in the graph, strongest link: official). This answer is about arXiv:2007.02133, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"5296f34b2fec160643a3363dc4bc22942e3fd2ef557c559374238881a5f3932d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}