{"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/cn-motifs-perceptive-graph-neural-networks","title":"CN-Motifs Perceptive Graph Neural Networks","arxiv_id":null,"date":"2021-11-15","proceeding":"IEEE Access 2021 11","authors":["Fan Zhang","Tian-Ming Bu"],"abstract":"Graph neural networks (GNNs) have been the dominant approaches for graph representation learning. However, most GNNs are applied to homophily graphs and perform poorly on heterophily graphs. Meanwhile, these GNNs fail to directly capture long-range dependencies and complex interactions between 1-hop neighbors when generating node representations by iteratively aggregating directly connected neighbors. In addition, structural patterns, such as motifs which have been established as building blocks for graph structure, contain rich topological and semantical information and are worth studying further. In this paper, we introduce the common-neighbors based motifs, which we called CN-motifs, to generalize and enrich the definition of structural patterns. We group the 1-hop neighbors and construct a high-order graph according to CN-motifs, and propose CN-motifs Perceptive Graph Neural Networks (CNMPGNN), a novel framework which can effectively resolve problems mentioned above. Notably, by making full use of structural patterns, our model achieves the state-of-the-art results on several homophily and heterophily datasets.","url_abs":"https://ieeexplore.ieee.org/document/9606682","url_pdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=9606682","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":[],"tasks":[{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-actor","task":"Node Classification","dataset":"Actor","model":"CNMPGNN","rank_in_archive_order":37,"of":62,"metrics":{"Accuracy":"36.25 ± 0.98"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-chameleon","task":"Node Classification","dataset":"Chameleon","model":"CNMPGNN","rank_in_archive_order":20,"of":61,"metrics":{"Accuracy":"73.29±1.29"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer","task":"Node Classification","dataset":"Citeseer","model":"CNMPGNN","rank_in_archive_order":10,"of":71,"metrics":{"Accuracy":"76.81±1.40"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset":"Cora","model":"CNMPGNN","rank_in_archive_order":11,"of":73,"metrics":{"Accuracy":"88.20±1.22%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cornell","task":"Node Classification","dataset":"Cornell","model":"CNMPGNN","rank_in_archive_order":37,"of":60,"metrics":{"Accuracy":"82.38 ± 6.13"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed","task":"Node Classification","dataset":"Pubmed","model":"CNMPGNN","rank_in_archive_order":8,"of":70,"metrics":{"Accuracy":"90.07± 0.43"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-squirrel","task":"Node Classification","dataset":"Squirrel","model":"CNMPGNN","rank_in_archive_order":18,"of":59,"metrics":{"Accuracy":"63.60±1.96"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-texas","task":"Node Classification","dataset":"Texas","model":"CNMPGNN","rank_in_archive_order":27,"of":62,"metrics":{"Accuracy":"85.68±5.28"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-wisconsin","task":"Node Classification","dataset":"Wisconsin","model":"CNMPGNN","rank_in_archive_order":36,"of":63,"metrics":{"Accuracy":"86.63 ± 3.57"},"uses_additional_data":false}],"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4be56a1daffcb9eff980a448b3d7c4e7deea9ca29bac2c1f1b377ac168149239","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}