{"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/are-we-really-making-much-progress-revisiting","title":"Are we really making much progress? Revisiting, benchmarking, and refining heterogeneous graph neural networks","arxiv_id":"2112.14936","date":"2021-12-30","proceeding":null,"authors":["Qingsong Lv","Ming Ding","Qiang Liu","Yuxiang Chen","Wenzheng Feng","Siming He","Chang Zhou","Jianguo Jiang","Yuxiao Dong","Jie Tang"],"abstract":"Heterogeneous graph neural networks (HGNNs) have been blossoming in recent years, but the unique data processing and evaluation setups used by each work obstruct a full understanding of their advancements. In this work, we present a systematical reproduction of 12 recent HGNNs by using their official codes, datasets, settings, and hyperparameters, revealing surprising findings about the progress of HGNNs. We find that the simple homogeneous GNNs, e.g., GCN and GAT, are largely underestimated due to improper settings. GAT with proper inputs can generally match or outperform all existing HGNNs across various scenarios. To facilitate robust and reproducible HGNN research, we construct the Heterogeneous Graph Benchmark (HGB), consisting of 11 diverse datasets with three tasks. HGB standardizes the process of heterogeneous graph data splits, feature processing, and performance evaluation. Finally, we introduce a simple but very strong baseline Simple-HGN--which significantly outperforms all previous models on HGB--to accelerate the advancement of HGNNs in the future.","url_abs":"https://arxiv.org/abs/2112.14936v1","url_pdf":"https://arxiv.org/pdf/2112.14936v1.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":"are-we-really-making-much-progress-revisiting","repo_url":"https://github.com/thudm/hgb","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"are-we-really-making-much-progress-revisiting","repo_url":"https://github.com/calderkatyal/CPSC483FinalProject","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"benchmarking","task_name":"Benchmarking"},{"task_slug":"heterogeneous-node-classification","task_name":"Heterogeneous Node Classification"}],"methods":[{"method_slug":"gat","method_name":"GAT"},{"method_slug":"gcn","method_name":"GCN"}],"datasets_introduced":[{"slug":"acm-heterogeneous-node-classification","name":"ACM (Heterogeneous Node Classification)","full_name":""},{"slug":"dblp-heterogeneous-node-classification","name":"DBLP (Heterogeneous Node Classification)","full_name":""},{"slug":"freebase-heterogeneous-node-classification","name":"Freebase (Heterogeneous Node Classification)","full_name":""},{"slug":"imdb-heterogeneous-node-classification","name":"IMDB (Heterogeneous Node Classification)","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/heterogeneous-node-classification-on-acm","task":"Heterogeneous Node Classification","dataset":"ACM (Heterogeneous Node Classification)","model":"Simple-HGN","rank_in_archive_order":3,"of":11,"metrics":{" Macro-F1":"93.42","Micro-F1":"93.35"},"uses_additional_data":false},{"leaderboard":"/sota/heterogeneous-node-classification-on-dblp-2","task":"Heterogeneous Node Classification","dataset":"DBLP (Heterogeneous Node Classification)","model":"Simple-HGN","rank_in_archive_order":4,"of":11,"metrics":{" Macro-F1":"94.01","Micro-F1":"94.46"},"uses_additional_data":false},{"leaderboard":"/sota/heterogeneous-node-classification-on-freebase","task":"Heterogeneous Node Classification","dataset":"Freebase (Heterogeneous Node Classification)","model":"Simple-HGN","rank_in_archive_order":4,"of":9,"metrics":{" Macro-F1":"47.72","Micro-F1":"66.29"},"uses_additional_data":false},{"leaderboard":"/sota/heterogeneous-node-classification-on-imdb","task":"Heterogeneous Node Classification","dataset":"IMDB (Heterogeneous Node Classification)","model":"Simple-HGN","rank_in_archive_order":3,"of":11,"metrics":{" Macro-F1":"63.53","Micro-F1":"67.36"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2112.14936","atlas_url":"https://app.syntology.ai/?focus=2112.14936","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":"2112.14936"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2112.14936\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2112.14936"},"call":"get_concepts_for_paper(arxiv_id=\"2112.14936\")"}],"by_repo":[{"repo":"thudm/hgb","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"calderkatyal/CPSC483FinalProject","kind":"listed","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":"4555f89352dc4c90931e59eb004ec8cfbccdb4edd7de4a93f11ab7a8f5c22475","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}