{"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/refining-latent-homophilic-structures-over","title":"Refining Latent Homophilic Structures over Heterophilic Graphs for Robust Graph Convolution Networks","arxiv_id":"2312.16418","date":"2023-12-27","proceeding":null,"authors":["Chenyang Qiu","Guoshun Nan","Tianyu Xiong","Wendi Deng","Di Wang","Zhiyang Teng","Lijuan Sun","Qimei Cui","Xiaofeng Tao"],"abstract":"Graph convolution networks (GCNs) are extensively utilized in various graph tasks to mine knowledge from spatial data. Our study marks the pioneering attempt to quantitatively investigate the GCN robustness over omnipresent heterophilic graphs for node classification. We uncover that the predominant vulnerability is caused by the structural out-of-distribution (OOD) issue. This finding motivates us to present a novel method that aims to harden GCNs by automatically learning Latent Homophilic Structures over heterophilic graphs. We term such a methodology as LHS. To elaborate, our initial step involves learning a latent structure by employing a novel self-expressive technique based on multi-node interactions. Subsequently, the structure is refined using a pairwisely constrained dual-view contrastive learning approach. We iteratively perform the above procedure, enabling a GCN model to aggregate information in a homophilic way on heterophilic graphs. Armed with such an adaptable structure, we can properly mitigate the structural OOD threats over heterophilic graphs. Experiments on various benchmarks show the effectiveness of the proposed LHS approach for robust GCNs.","url_abs":"https://arxiv.org/abs/2312.16418v1","url_pdf":"https://arxiv.org/pdf/2312.16418v1.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":[],"tasks":[{"task_slug":"contrastive-learning","task_name":"Contrastive Learning"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[{"method_slug":"contrastive-learning","method_name":"Contrastive Learning"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"gcn","method_name":"GCN"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-actor","task":"Node Classification","dataset":"Actor","model":"LHS","rank_in_archive_order":5,"of":62,"metrics":{"Accuracy":"38.87±1.0"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-chameleon","task":"Node Classification","dataset":"Chameleon","model":"LHS","rank_in_archive_order":21,"of":61,"metrics":{"Accuracy":"72.31±1.6"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cornell","task":"Node Classification","dataset":"Cornell","model":"LHS","rank_in_archive_order":13,"of":60,"metrics":{"Accuracy":"85.96±5.1"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-squirrel","task":"Node Classification","dataset":"Squirrel","model":"LHS","rank_in_archive_order":25,"of":59,"metrics":{"Accuracy":"60.27±1.2"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-texas","task":"Node Classification","dataset":"Texas","model":"LHS","rank_in_archive_order":21,"of":62,"metrics":{"Accuracy":"86.32±4.5"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-wisconsin","task":"Node Classification","dataset":"Wisconsin","model":"LHS","rank_in_archive_order":17,"of":63,"metrics":{"Accuracy":"88.32±2.3"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2312.16418","atlas_url":"https://app.syntology.ai/?focus=2312.16418","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":"2312.16418"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2312.16418\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2312.16418"},"call":"get_concepts_for_paper(arxiv_id=\"2312.16418\")"}],"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":"6f5fa7f7e4ff8a540bac48cda3b6ce2ae246faec9699f3b6412eca6cb22c14d2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}