A Tight Meta-theorem for LOCAL Certification of MSO$_2$ Properties within Bounded Treewidth Graphs

Distributed networks are prone to errors so verifying their output is critical. Hence, we develop LOCAL certification protocols for graph properties in which nodes are given certificates that allow them to check whether their network as a whole satisfies some fixed property while only communicating with their local network. Most known LOCAL certification protocols are specifically tailored to the problem they work on and cannot be translated more generally. Thus we target general protocols that can certify any property expressible within a certain logical framework. We consider Monadic Second Order Logic (MSO$_2$), a powerful framework that can express properties such as non-$k$-colorability, Hamiltonicity, and $H$-minor-freeness. Unfortunately, in general, there are MSO$_2$-expressible properties that cannot be certified without huge certificates. For instance, non-3-colorability requires certificates of size $Ω(n^2/\log n)$ on general $n$-vertex graphs (Göös, Suomela 2016). Hence, we impose additional structural restrictions on the graph. We provide a LOCAL certification protocol for certifying any MSO$_2$-expressible property on graphs of bounded treewidth and, consequently, a LOCAL certification protocol for certifying bounded treewidth. That is for each integer $k$ and each MSO$_2$-expressible property $Π$ we give a LOCAL Certification protocol to certify that a graph satisfies $Π$ and has treewidth at most $k$ using certificates of size $\mathcal{O}(\log n)$ (which is asymptotically optimal). Our LOCAL certification protocol requires only one round of distributed communication, hence it is also proof-labeling scheme. Our result improves upon work by Fraigniaud, Montealegre, Rapaport, and Todinca (Algorithmica 2024), Bousquet, Feuilloley, Pierron (PODC 2022), and the very recent work of Baterisna and Chang.

💡 Research Summary

The paper addresses the problem of locally certifying global graph properties in the distributed LOCAL model, focusing on properties expressible in Monadic Second‑Order Logic with edge quantification (MSO₂). In the LOCAL model, each node can only exchange information with its immediate neighbors, and the verification must complete in a constant number of synchronous rounds. A certification scheme consists of a prover that assigns a label (certificate) to each node and a verifier that, based on the node’s identifier, its own label, and the labels of its neighbors, decides whether to accept (output “Yes”) or reject (output “No”). The size of the certificates is the primary measure of efficiency; O(log n) bits per node is considered optimal because identifiers themselves already require Θ(log n) bits.

The authors observe that many MSO₂‑definable properties (e.g., non‑3‑colorability, Hamiltonicity, existence of a fixed minor) require super‑linear certificates on unrestricted graphs, as shown by Göös and Suomela (Ω(n²/ log n)). To overcome this barrier, they restrict attention to graphs of bounded treewidth, a well‑studied structural parameter that measures how close a graph is to a tree. Bounded‑treewidth graphs admit tree decompositions of width k, and Courcelle’s theorem guarantees that any MSO₂ property can be decided in linear time on such graphs via dynamic programming over the decomposition.

The main technical contribution is a proof‑labeling scheme (PLS) that works for any integer k and any MSO₂ sentence ψ. The scheme has the following properties:

1. One‑round verification: Nodes exchange certificates only with their immediate neighbors, i.e., the verifier runs in a single LOCAL round, making the scheme a proof‑labeling scheme.
2. Optimal certificate size: Each node’s certificate is O(log n) bits, matching the lower bound imposed by node identifiers. This improves upon prior work that required O(log² n) bits for similar tasks.
3. Generality: The scheme simultaneously certifies that the graph’s treewidth does not exceed k and that it satisfies ψ. As a corollary, there is an O(log n) PLS for the property “treewidth ≤ k” alone.

The construction proceeds in several steps:

• Sanitized tree decomposition: Starting from any tree decomposition of width ≤ k, the authors transform it into a “sane” decomposition that satisfies three extra conditions: each bag has a non‑empty margin, every vertex in a bag’s adhesion has a neighbor inside the bag’s component, and the subgraph induced by a bag’s component is connected. Lemma 2.1 guarantees that such a sane decomposition exists without increasing the width.
• Dynamic programming encoding: For the given MSO₂ formula ψ, a standard Courcelle‑style DP is performed on the sane tree decomposition. The DP computes, for each bag, a Boolean value indicating whether the partial subgraph rooted at that bag can be extended to a global model of ψ. Because the DP state space depends only on k and ψ (both constants), the result per bag is a constant‑size bit.
• Certificate composition: Each node v receives a certificate that encodes (i) its unique identifier, (ii) the identifier of the bag it belongs to, (iii) its position inside the bag (e.g., whether it lies in the margin, adhesion, or component), and (iv) the DP bit for that bag. All these fields together require O(log n) bits.
• Verification procedure: Upon receiving the certificates of its neighbors, a node checks three consistency conditions: (a) the adhesion sets of adjacent bags match, (b) the margin‑to‑component adjacency required by the sane decomposition holds, and (c) the DP bits are compatible across parent‑child bag relationships. If any check fails, the node outputs “No”; otherwise it outputs “Yes”. Because the DP bits are globally consistent only when ψ holds on the whole graph, the verifier’s soundness and completeness follow directly.

The authors prove two corollaries that highlight the broader impact of their meta‑theorem:

• Corollary 1.2: There exists an O(log n) PLS for the property “treewidth ≤ k”. This matches the known Ω(log n) lower bound for certifying acyclicity (treewidth = 1), showing optimality.
• Corollary 1.4 and 1.5: By leveraging the Robertson‑Seymour Graph Minor Theorem, the authors show that any minor‑closed family that does not contain all planar graphs admits an O(log n) certification scheme. In particular, for any fixed planar graph H, the property “H‑minor‑free” can be certified with O(log n) bits. This resolves, for a large class of minor‑closed properties, the open question posed by Fraigniaud et al. regarding compact certifications.

The paper situates its contributions relative to prior work. Fraigniaud, Montealegre, Rapaport, and Todinca (Algorithmica 2024) achieved O(log² n) certificates for the combined problem of bounded treewidth plus MSO₂ certification. Bousquet, Feuilloley, and Pierron (PODC 2022) handled bounded treedepth, which is a stricter parameter than treewidth, also with O(log n) certificates. Baterisna and Chang (2024) extended the approach to bounded pathwidth. The present work strictly subsumes all these results because treewidth upper‑bounds both treedepth and pathwidth, and the certificate size matches the optimal O(log n) bound.

Finally, the authors discuss potential extensions. One direction is to handle graphs whose treewidth grows slowly (e.g., O(log n)) while preserving polylogarithmic certificate size. Another is to design dynamic update mechanisms for the certificates when nodes join or leave the network, which is crucial for real‑world distributed systems. The paper also suggests exploring whether similar meta‑theorems can be obtained for other logical frameworks (e.g., first‑order logic with counting) or for other structural graph parameters such as clique‑width.

In summary, the paper delivers a tight, optimal‑size, one‑round proof‑labeling scheme that universally certifies any MSO₂‑definable property on bounded‑treewidth graphs, thereby advancing the theory of distributed verification and opening pathways toward compact certifications for broad families of graph properties, especially those arising from graph minor theory.