A Meta-Theorem for Distributed Certification

12/06/2021
by   Pierre Fraigniaud, et al.
0

Distributed certification, whether it be proof-labeling schemes, locally checkable proofs, etc., deals with the issue of certifying the legality of a distributed system with respect to a given boolean predicate. A certificate is assigned to each process in the system by a non-trustable oracle, and the processes are in charge of verifying these certificates, so that two properties are satisfied: completeness, i.e., for every legal instance, there is a certificate assignment leading all processes to accept, and soundness, i.e., for every illegal instance, and for every certificate assignment, at least one process rejects. The verification of the certificates must be fast, and the certificates themselves must be small. A large quantity of results have been produced in this framework, each aiming at designing a distributed certification mechanism for specific boolean predicates. This paper presents a "meta-theorem", applying to many boolean predicates at once. Specifically, we prove that, for every boolean predicate on graphs definable in the monadic second-order (MSO) logic of graphs, there exists a distributed certification mechanism using certificates on O(log^2n) bits in n-node graphs of bounded treewidth, with a verification protocol involving a single round of communication between neighbors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2023

Distributed Certification for Classes of Dense Graphs

A proof-labeling scheme (PLS) for a boolean predicate Π on labeled graph...
research
05/12/2020

Compact Distributed Certification of Planar Graphs

Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the exist...
research
07/16/2020

Local Certification of Graphs with Bounded Genus

Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for aut...
research
12/06/2020

Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs

We present compact distributed interactive proofs for the recognition of...
research
02/09/2023

Hardness of monadic second-order formulae over succinct graphs

Our main result is a succinct counterpoint to Courcelle's meta-theorem a...
research
08/23/2023

Cliquewidth and dimension

We prove that every poset with bounded cliquewidth and with sufficiently...
research
02/24/2020

Distributed Quantum Proofs for Replicated Data

The paper tackles the issue of checking that all copies of a large data ...

Please sign up or login with your details

Forgot password? Click here to reset