{"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/sign-is-not-a-remedy-multiset-to-multiset","title":"Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs","arxiv_id":"2405.20652","date":"2024-05-31","proceeding":null,"authors":["Langzhang Liang","Sunwoo Kim","Kijung Shin","Zenglin Xu","Shirui Pan","Yuan Qi"],"abstract":"Graph Neural Networks (GNNs) have gained significant attention as a powerful modeling and inference method, especially for homophilic graph-structured data. To empower GNNs in heterophilic graphs, where adjacent nodes exhibit dissimilar labels or features, Signed Message Passing (SMP) has been widely adopted. However, there is a lack of theoretical and empirical analysis regarding the limitations of SMP. In this work, we unveil some potential pitfalls of SMP and their remedies. We first identify two limitations of SMP: undesirable representation update for multi-hop neighbors and vulnerability against oversmoothing issues. To overcome these challenges, we propose a novel message passing function called Multiset to Multiset GNN(M2M-GNN). Our theoretical analyses and extensive experiments demonstrate that M2M-GNN effectively alleviates the aforementioned limitations of SMP, yielding superior performance in comparison","url_abs":"https://arxiv.org/abs/2405.20652v1","url_pdf":"https://arxiv.org/pdf/2405.20652v1.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":"sign-is-not-a-remedy-multiset-to-multiset","repo_url":"https://github.com/Jinx-byebye/m2mgnn","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-actor","task":"Node Classification","dataset":"Actor","model":"M2M-GNN","rank_in_archive_order":32,"of":62,"metrics":{"Accuracy":"36.72 ± 1.6"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-chameleon","task":"Node Classification","dataset":"Chameleon","model":"M2M-GNN","rank_in_archive_order":10,"of":61,"metrics":{"Accuracy":"75.20 ± 2.3"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cornell","task":"Node Classification","dataset":"Cornell","model":"M2M-GNN","rank_in_archive_order":11,"of":60,"metrics":{"Accuracy":"86.48 ± 6.1"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-squirrel","task":"Node Classification","dataset":"Squirrel","model":"M2M-GNN","rank_in_archive_order":19,"of":59,"metrics":{"Accuracy":"63.60 ± 1.7"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-texas","task":"Node Classification","dataset":"Texas","model":"M2M-GNN","rank_in_archive_order":6,"of":62,"metrics":{"Accuracy":"89.19 ± 4.5"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-wisconsin","task":"Node Classification","dataset":"Wisconsin","model":"M2M-GNN","rank_in_archive_order":7,"of":63,"metrics":{"Accuracy":"89.01 ± 4.1"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2405.20652","atlas_url":"https://app.syntology.ai/?focus=2405.20652","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2405.20652"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2405.20652\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2405.20652"},"call":"get_concepts_for_paper(arxiv_id=\"2405.20652\")"}],"by_repo":[{"repo":"Jinx-byebye/m2mgnn","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"f00fadc23c46ffb3005c57eb459131f99471dab0b93b05c5161f13434aef50bd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}