Methods › Graphs › Graph Data Augmentation › Canonical Partition

Canonical Partition

1 paper tagged archive 2025-07-28

Introduced by Tianyu Fu et al. in DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Canonical partition 𝒫 crops the index-restricted d-hop neighborhood around the center node from the target graph. 𝒟(Gₜ,vᵢ,v_c) means the shortest distance between vᵢ and v_c on Gₜ. 𝒫(Gₜ, v_c, d) = G_c, s.t. G_c ⊆Gₜ, V_c = { vᵢ ∈Vₜ|𝒟(Gₜ,vᵢ,v_c) ≤d , vᵢ ≤v_c}

The graph G_c obtained by canonical partition is called the 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 𝒫, given any d greater than the diameter of the query. 𝒞(G_q,Gₜ) = ∑_(v_c ∈Vₜ) 𝒞_c(G_q, 𝒫(Gₜ, v_c, d),v_c), d ≥max_(vᵢ, vⱼ ∈V_q) 𝒟(G_q, vᵢ, vⱼ)

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: Partition Tree; Canonical locks; Partition Forest; Partition and Code; Canonical Capsules; Canonical Diffusion; partition mechanism; Partition-and-Debias.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 1 · with a code link: 1 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 1 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: paper 1 of 1, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

4 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Graph Neural Network1
Graph Regression1
Position1
Subgraph Counting1

Usage over time archive 2025-07-28

Papers per year tagged with Canonical Partition: 2023 to 2023, peak 1 1 0 2023: 1 paper 2023
Papers per year the archive tags with this method, by the paper's archive date (1 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Data Augmentation

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections