Klopp-Zadik Question on Polynomial-Time Node-Private Recovery
Nothing has been published against this problem here, and nobody has checked anything. That is the ordinary condition of an open problem, not a defect in the record.
Statement
Klopp and Zadik gave an exponential-time node-private algorithm for exact community recovery in stochastic block models and asked whether a polynomial-time algorithm could match it. One can: a Lipschitz surrogate for the penalized likelihood plus an accept-reject sampler gives a high-probability polynomial-time node-private algorithm that nearly matches the exponential-time guarantee.
Context
An open question from a 2026 paper on private community detection, at the junction of differential privacy and the well-studied stochastic block model.
People
Projects
Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.
Interest
Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.
Attempts
No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
The AI declaration says the paper was written with the model's help and that it played a critical role in brainstorming the initial idea for a polynomial-time algorithm and in providing proof outlines for the main results. Two of the authors are the pair who posed the question.
Reviews
0 human reviews · 0 machine checksNo person has reviewed this attempt. It has not been checked at all.
Endorsements
0 endorsementsNo one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.
Discussion of this attempt
no comments
Discussion
Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.