arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.08718cs.DCcs.DS
收藏

局部限制证明标记方案(完整版)

Locally Restricted Proof Labeling Schemes (Full Version)

Yuval Emek, Yuval Gil, Shay Kutten

摘要:

由Korman,Kutten,and Peleg(PODC 2005)提出的证明标记方案(Proof Labeling Scheme,PLS)是一种分布式验证系统,专门用于评估给定的配置图是否满足某个属性。它涉及一个集中式证明器,其作用是通过向节点分配标签来提供给定配置图是yes实例的证明,以及一个分布式验证器,其作用是通过本地访问分配的标签来验证给定证明的有效性。在本文中,我们引入了一个局部限制PLS的概念,其中证明者的权力被限制到一个多项式对数轮数的算法。为了规避内在的不可能性PLS在本地限制设置,我们转向模型,放宽正确性要求,允许验证者接受一些无实例,只要他们不是“太远”,从满足有关属性。为此,我们评估(1)分布式图优化问题(OptDGP)的概念的基础上的一个近似的证明标记方案(APLS)(类似于放松的类型,用于顺序近似算法);和(2)配置的图形家庭(CGF)的概念的基础上的atesting证明标记方案(TPLS)(类似于放松的类型,用于属性测试算法)。

英文摘要:

Introduced by Korman, Kutten, and Peleg (PODC 2005), a proof labeling scheme (PLS) is a distributed verification system dedicated to evaluating if a given configured graph satisfies a certain property. It involves a centralized prover, whose role is to provide proof that a given configured graph is a yes-instance by means of assigning labels to the nodes, and a distributed verifier, whose role is to verify the validity of the given proof via local access to the assigned labels. In this paper, we introduce the notion of a locally restricted PLS in which the prover's power is restricted to that of a LOCAL algorithm with a polylogarithmic number of rounds. To circumvent inherent impossibilities of PLSs in the locally restricted setting, we turn to models that relax the correctness requirements by allowing the verifier to accept some no-instances as long as they are not "too far" from satisfying the property in question. To this end, we evaluate (1) distributed graph optimization problems (OptDGPs) based on the notion of an approximate proof labeling scheme (APLS) (analogous to the type of relaxation used in sequential approximation algorithms); and (2) configured graph families (CGFs) based on the notion of atesting proof labeling schemes (TPLS) (analogous to the type of relaxation used in property testing algorithms).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑