Decreasing verification radius in local certification
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F25%3A00384787" target="_blank" >RIV/68407700:21240/25:00384787 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.tcs.2025.115520" target="_blank" >https://doi.org/10.1016/j.tcs.2025.115520</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2025.115520" target="_blank" >10.1016/j.tcs.2025.115520</a>
Alternative languages
Result language
angličtina
Original language name
Decreasing verification radius in local certification
Original language description
This paper deals with local certification, specifically locally checkable proofs: given a graph property, the task is to certify whether a graph satisfies the property. The verification of this certification needs to be done locally without the knowledge of the whole graph. More precisely, a distributed algorithm, called a verifier, is executed on each vertex. The verifier observes the local neighborhood up to a constant distance and either accepts or rejects. We examine the trade-off between the visibility radius and the size of certificates. We describe a procedure that decreases the radius by encoding the neighborhood of each vertex into its certificate. We also provide a corresponding lower bound on the required certificate size increase, showing that such an approach is close to optimal.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
1879-2294
Volume of the periodical
1056
Issue of the periodical within the volume
November
Country of publishing house
GB - UNITED KINGDOM
Number of pages
12
Pages from-to
—
UT code for WoS article
001562218400002
EID of the result in the Scopus database
2-s2.0-105014540765