{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/a-simple-yet-effective-method-for-graph","title":"A Simple yet Effective Method for Graph Classification","arxiv_id":"2206.02404","date":"2022-06-06","proceeding":null,"authors":["Junran Wu","Shangzhe Li","Jianhao Li","YiCheng Pan","Ke Xu"],"abstract":"In deep neural networks, better results can often be obtained by increasing the complexity of previously developed basic models. However, it is unclear whether there is a way to boost performance by decreasing the complexity of such models. Intuitively, given a problem, a simpler data structure comes with a simpler algorithm. Here, we investigate the feasibility of improving graph classification performance while simplifying the learning process. Inspired by structural entropy on graphs, we transform the data sample from graphs to coding trees, which is a simpler but essential structure for graph data. Furthermore, we propose a novel message passing scheme, termed hierarchical reporting, in which features are transferred from leaf nodes to root nodes by following the hierarchical structure of coding trees. We then present a tree kernel and a convolutional network to implement our scheme for graph classification. With the designed message passing scheme, the tree kernel and convolutional network have a lower runtime complexity of $O(n)$ than Weisfeiler-Lehman subtree kernel and other graph neural networks of at least $O(hm)$. We empirically validate our methods with several graph classification benchmarks and demonstrate that they achieve better performance and lower computational consumption than competing approaches.","url_abs":"https://arxiv.org/abs/2206.02404v1","url_pdf":"https://arxiv.org/pdf/2206.02404v1.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":"a-simple-yet-effective-method-for-graph","repo_url":"https://github.com/wu-junran/hierarchicalreporting","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"graph-classification","task_name":"Graph Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2206.02404","atlas_url":"https://app.syntology.ai/?focus=2206.02404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02404"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/wu-junran/hierarchicalreporting","reach":null}],"summary":{"ran":2,"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"official":{"samples":4,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"3ae8a5fe1798511d","entry":"PartitionTree","repo":"wu-junran/hierarchicalreporting","repo_kind":"official","path":"lib/coding_tree.py","file_url":"https://github.com/wu-junran/hierarchicalreporting/blob/HEAD/lib/coding_tree.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3ae8a5fe1798511d"}},{"code_sha256_prefix":"fde92ce7415b6f1c","entry":"PartitionTreeNode","repo":"wu-junran/hierarchicalreporting","repo_kind":"official","path":"lib/coding_tree.py","file_url":"https://github.com/wu-junran/hierarchicalreporting/blob/HEAD/lib/coding_tree.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"fde92ce7415b6f1c"}},{"code_sha256_prefix":"21dda7ecf92b5b2c","entry":"graph_parse","repo":"wu-junran/hierarchicalreporting","repo_kind":"official","path":"lib/coding_tree.py","file_url":"https://github.com/wu-junran/hierarchicalreporting/blob/HEAD/lib/coding_tree.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"21dda7ecf92b5b2c"}},{"code_sha256_prefix":"d5cbf6bb01288b04","entry":"merge","repo":"wu-junran/hierarchicalreporting","repo_kind":"official","path":"lib/coding_tree.py","file_url":"https://github.com/wu-junran/hierarchicalreporting/blob/HEAD/lib/coding_tree.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d5cbf6bb01288b04"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}