A proof-labeling scheme (PLS) for a boolean predicate $\Pi $ on labeled graphs is a
mechanism used for certifying the legality with respect to $\Pi $ of global network states in a …

Interactive proof systems enable a verifier with limited resources to decide an intractable
language (or compute a hard function) by communicating with a powerful but untrusted …

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 …

In the context of distributed certification, the recognition of graph classes has started to be
intensively studied. For instance, different results related to the recognition of planar …

Local certification is a distributed mechanism enabling the nodes of a network to check the
correctness of the current configuration, thanks to small pieces of information called …

In majority voting dynamics, a group of n agents in a social network are asked for their
preferred candidate in a future election between two possible choices. At each time step, a …

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 …

The rapid development of Industrial IoT (IIoT) opens up promising possibilities for data
analysis and machine learning in IIoT networks. As a distributed paradigm, federated …

The field of distributed certification is concerned with certifying properties of distributed
networks, where the communication topology of the network is represented as an arbitrary …

We show that for every first-order logic (FO) formula $\varphi $, and every graph class
$\mathcal {G} $ of bounded expansion, there exists a distributed (deterministic) algorithm …