{"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/desco-towards-generalizable-and-scalable-deep","title":"DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting","arxiv_id":"2308.08198","date":"2023-08-16","proceeding":null,"authors":["Tianyu Fu","Chiyue Wei","Yu Wang","Rex Ying"],"abstract":"We introduce DeSCo, a scalable neural deep subgraph counting pipeline, designed to accurately predict both the count and occurrence position of queries on target graphs post single training. Firstly, DeSCo uses a novel canonical partition and divides the large target graph into small neighborhood graphs, greatly reducing the count variation while guaranteeing no missing or double-counting. Secondly, neighborhood counting uses an expressive subgraph-based heterogeneous graph neural network to accurately count in each neighborhood. Finally, gossip propagation propagates neighborhood counts with learnable gates to harness the inductive biases of motif counts. DeSCo is evaluated on eight real-world datasets from various domains. It outperforms state-of-the-art neural methods with 137x improvement in the mean squared error of count prediction, while maintaining the polynomial runtime complexity. Our open source project is at https://github.com/fuvty/DeSCo.","url_abs":"https://arxiv.org/abs/2308.08198v2","url_pdf":"https://arxiv.org/pdf/2308.08198v2.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":"desco-towards-generalizable-and-scalable-deep","repo_url":"https://github.com/fuvty/DeSCo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"graph-regression","task_name":"Graph Regression"},{"task_slug":null,"task_name":"Position"},{"task_slug":"subgraph-counting","task_name":"Subgraph Counting"}],"methods":[{"method_slug":"canonical-partition","method_name":"Canonical Partition"},{"method_slug":"graph-neural-network","method_name":"Graph Neural Network"}],"datasets_introduced":[],"methods_introduced":[{"slug":"canonical-partition","name":"Canonical Partition","full_name":"Canonical Partition"}],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2308.08198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08198"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+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/fuvty/DeSCo","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"ran":3},"by_repo_kind":{"official":{"samples":3,"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":"73c1db1a33677855","entry":"extend_dimensions","repo":"fuvty/DeSCo","repo_kind":"official","path":"subgraph_counting/DIAMNet.py","file_url":"https://github.com/fuvty/DeSCo/blob/HEAD/subgraph_counting/DIAMNet.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"73c1db1a33677855"}},{"code_sha256_prefix":"25e48aa6e315ec07","entry":"get_multi_head_attn_vec","repo":"fuvty/DeSCo","repo_kind":"official","path":"subgraph_counting/DIAMNet.py","file_url":"https://github.com/fuvty/DeSCo/blob/HEAD/subgraph_counting/DIAMNet.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"25e48aa6e315ec07"}},{"code_sha256_prefix":"a93f3790c99c69c0","entry":"map_activation_str_to_layer","repo":"fuvty/DeSCo","repo_kind":"official","path":"subgraph_counting/DIAMNet.py","file_url":"https://github.com/fuvty/DeSCo/blob/HEAD/subgraph_counting/DIAMNet.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"a93f3790c99c69c0"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}