{"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":"/method/canonical-partition","slug":"canonical-partition","name":"Canonical Partition","full_name":"Canonical Partition","full_name_withheld":false,"description_markdown":"\\emph{Canonical partition} $\\mathcal{P}$ crops the index-restricted d-hop neighborhood around the center node from the target graph. $\\mathcal{D}(G_t,v_i,v_c)$ means the shortest distance between $v_i$ and $v_c$ on $G_t$.\r\n \\begin{equation}\r\n        \\mathcal{P}(G_t, v_c, d) = G_c, \\operatorname{ s.t. } G_c \\subseteq G_t, V_c = \\{ v_i \\in V_t|\\mathcal{D}(G_t,v_i,v_c) \\leq d , v_i \\leq v_c\\}\r\n\\end{equation}\r\n\r\nThe graph $G_c$ obtained by canonical partition is called the \\emph{canonical neighborhood}. Canonical neighborhoods can correctly substitute the target graph in canonical count. The subgraph count of query in target equals the summation of the canonical count of query in canonical neighborhoods for all target nodes. Canonical neighborhoods are acquired with canonical partition $\\mathcal{P}$, given any $d$ greater than the diameter of the query.\r\n\\begin{equation}\r\n\t\\mathcal{C}(G_q,G_t) = \\sum_{v_c \\in V_t} \\mathcal{C}_c(G_q, \\mathcal{P}(G_t, v_c, d),v_c), \r\n\td \\geq \\max_{v_i, v_j \\in V_q} \\mathcal{D}(G_q, v_i, v_j)\r\n\\end{equation}","description_state":"present","introduced_year":null,"introduced_by":{"title":"DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting","paper":"/paper/desco-towards-generalizable-and-scalable-deep","first_author":"Tianyu Fu","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/desco-towards-generalizable-and-scalable-deep"},"source":{"url":"https://arxiv.org/abs/2308.08198v2","title":"DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Data Augmentation","url":"/methods/category/graph-data-augmentation","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/desco-towards-generalizable-and-scalable-deep","slug":"desco-towards-generalizable-and-scalable-deep","title":"DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting","date":"2023-08-16","arxiv_id":"2308.08198","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["fuvty/DeSCo"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}}],"papers_shown":1,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":1,"with_a_code_link":1,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":1,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/canonical-partition/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/canonical-partition/papers/ran/1","json":"/method/canonical-partition/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/graph-regression","name":"Graph Regression","papers":1},{"task":null,"name":"Position","papers":1},{"task":"/task/subgraph-counting","name":"Subgraph Counting","papers":1}],"tasks_shown":4,"n_tasks":4,"usage_by_year":[{"year":"2023","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/canonical-partition"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Canonical%20Partition","read_at":"2026-10-05T00:53:22+00:00","query":"Canonical Partition","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2308.08198","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Canonical Partition' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Partition Tree","Canonical locks","Partition Forest","Partition and Code","Canonical Capsules","Canonical Diffusion","partition mechanism","Partition-and-Debias"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"37946ceef234bfa977407d554b307d896eade81032b8519130f3947ad3e2edb3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}