Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Probability

2,743 missions · 1,549 completed

Missions

Open1194Completed1549All2743
🏆Completed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: Shuze Chen

Robust Shattering ArgumentsResearch Paper

Many fast randomized distributed algorithms, for the Lovász Local Lemma, maximal independent set, matching and coloring, follow the shattering paradigm (Barenboim, Elkin, Pettie, Schneider, JACM 2016). A randomized pre-shattering phase solves the problem on most of the graph. It leaves a residual set BBB of unresolved nodes, and the analysis has to show that…

10 thms3 active usersReviewed
Information TheoryQuantum InformationTheoretical Computer Science·Captain: iris

Gibbs Sampling in the Shattered Phase by Decoded Quantum InterferometryResearch Paper

Sampling from the Gibbs measure of a spin glass is a basic task in statistical physics, Bayesian inference and the analysis of algorithms. For many random spin glasses, algorithms are believed to fail beyond a dynamical phase transition. At that transition the Gibbs measure shatters into exponentially many well-separated clusters. Results for dense models…

26 thms3 active usersReviewed
Machine LearningStatisticsTheoretical Computer Science·Captain: Shuze Chen

Testable Sanitization via Boundary GeometryResearch Paper

A classifier trained or supplied by an untrusted party may contain a backdoor: a hidden rule that changes its label on inputs perturbed in a way only the adversary knows. Under cryptographic assumptions such backdoors can be undetectable even with white-box access to the model (Goldwasser, Kim, Vaikuntanathan, Zamir 2022), so testing a black-box model for…

17 thms3 active usersReviewed
CombinatoricsComplexity TheoryInformation Theory+1·Captain: Shuze Chen

Nearly Tight Cell-Probe Lower Bounds for Querying on Tree via Talagrand InequalityResearch Paper

Succinct data structures store a combinatorial object in space close to the information-theoretic minimum while still answering queries quickly. Balanced parentheses are the basic case: an ordered tree with nnn nodes, or a forest, is written as a word of 2n2n2n brackets, and tree navigation reduces to bracket queries such as findclose (the position of the bracket…

18 thms3 active usersReviewed
Markov ChainRandom Matrix TheoryStatistical Mechanics+1·Captain: Shuze Chen

High-Magnetization Sampling at Low Temperatures: Ising Models and Bayesian Sparse Linear RegressionResearch Paper

The Sherrington–Kirkpatrick (SK) model is the mean-field spin glass: a Gibbs measure on {±1}d\{\pm1\}^d{±1}d whose interactions are a random Gaussian matrix. Sampling from it is a benchmark problem for Markov chain Monte Carlo. At high temperature (inverse temperature β\betaβ below an absolute constant) Glauber dynamics is known to mix rapidly, while at low temperature…

16 thms3 active usersReviewed
Mathematical PhysicsNumerical AnalysisOptimization+1·Captain: Shuze Chen

A Fully Polynomial Approximation Algorithm for the Sherrington-Kirkpatrick ModelResearch Paper

The Sherrington–Kirkpatrick (SK) model is the basic mean-field spin glass: for a random symmetric Gaussian matrix AAA, find a spin vector σ∈{−1,1}N\sigma\in\{-1,1\}^Nσ∈{−1,1}N maximizing the energy HN(σ)=12σ⊤AσH_N(\sigma)=\tfrac12\sigma^\top A\sigmaHN​(σ)=21​σ⊤Aσ. Finding the exact maximizer is a hard combinatorial problem in the worst case, and the question of how close polynomial-time algorithms can…

23 thms3 active usersReviewed
AnalysisMachine LearningStochastic Systems·Captain: Shuze Chen

Error accumulation in reverse diffusion with an imperfect score: beyond path-space analysesResearch Paper

Diffusion models generate samples from a data distribution ppp on Rd\mathbb R^dRd by running a stochastic differential equation backwards in time. The drift of the backward equation involves the score ∇log⁡pt\nabla\log p_t∇logpt​ of the noised data distribution, which is not known and is replaced by a neural-network estimate s^\hat ss^ trained by a squared loss. The standard…

18 thms3 active usersReviewed
Information Theory·Captain: mikedeng1

The Necessity of Elias Codes in the Global Clock ModelResearch Paper

A multiple-access channel is a resource on which a transmission succeeds precisely when one player transmits in a time slot. If several transmit, they interfere; if none transmit, the slot is unused. Distributed systems use randomized transmission rules because their participants may arrive at different times and may not know how many other participants…

24 thms3 active usersReviewed
Machine LearningTheoretical Computer Science·Captain: iris

Polynomial Memory-Sample Separations in Non-i.i.d. Ill-Conditioned RegressionResearch Paper

Linear regression from a stream of samples is the simplest learning task in which memory and data trade off against each other. A learner that stores every sample, or runs Gaussian elimination, recovers an unknown vector x⋆∈Rdx^\star\in\mathbb R^dx⋆∈Rd from about ddd noiseless samples (at,at⊤x⋆)(a_t,a_t^\top x^\star)(at​,at⊤​x⋆) but needs about d2log⁡dd^2\log dd2logd bits of memory. Iterative methods…

28 thms3 active usersReviewed
Discrete GeometryOperations Research·Captain: iris

Separating Measures by HyperplanesResearch Paper

Given red and blue points in Rd\mathbb R^dRd, join every red point to every blue point by a segment and weigh each segment by its length under a fixed norm. What fraction of the total weight can a single affine hyperplane always cut, counting a segment when its endpoints lie strictly on opposite sides? Correa, Griesbach, Harb, Hommelsheim, Jlibene, Livanos and…

26 thms3 active usersReviewed
Operations ResearchTheoretical Computer Science·Captain: iris

Minimum Sum-of-Radii Clustering with Strong and Weak OraclesResearch Paper

In the minimum sum of radii problem (MSR), nnn points of a metric space must be covered by at most kkk balls centred at input points, and the objective is the sum of the radii. Unlike kkk-center, which charges only the largest radius, MSR rewards making every cluster as tight as possible. With exact distances, polynomial-time approximation factors improved from …

32 thms3 active usersReviewed
Computational ComplexityLinear algebraTheoretical Computer Science·Captain: Shuze Chen

Quadratic ExtractorsResearch Paper

Randomized algorithms, cryptography and distributed protocols assume access to uniform random bits, while physical sources of randomness are biased and correlated. A randomness extractor is a deterministic function that turns samples of such a weak source into nearly uniform bits. No single extractor works for every source with a given amount of entropy:…

25 thms3 active usersReviewed
cryptographyDiscrete GeometryTheoretical Computer Science·Captain: Shuze Chen

Finding a Shortest Vector and More in 2n/2+o(n)2^{n/2+o(n)}2n/2+o(n) Time using qqq-ary Coset Difference TreeResearch Paper

The shortest vector problem (SVP) asks, given a basis of a lattice, for a nonzero lattice vector of minimum Euclidean length. It is the central computational problem of the geometry of numbers, and the security estimates of lattice-based cryptography — including the post-quantum standards — are calibrated against the best algorithms for it. Aggarwal,…

25 thms3 active usersReviewed
CombinatoricsHarmonic AnalysisTheoretical Computer Science·Captain: Shuze Chen

A Counting Lemma for Somewhat Restricted 3-APsResearch Paper

Roth's theorem says that dense sets of integers contain three-term arithmetic progressions (x,x+a,x+2a)(x, x+a, x+2a)(x,x+a,x+2a) with a≠0a \neq 0a=0. Meshulam proved the analogue in the finite field model Fpn\mathbb F_p^nFpn​ (Meshulam, 1995). In that model a dense set contains not only one progression but a positive fraction of all of them. This counting statement follows from the existence…

27 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchOptimization+1·Captain: Shuze Chen

Consistent Submodular Maximization with Full ForesightResearch Paper

Online algorithms with recourse maintain a good solution while the input grows, and limit how much the solution changes at each update. For monotone submodular maximization under a cardinality constraint, the consistent version of this problem was introduced by Dütting et al. (2024) and studied further by Dütting et al. (2025) and Fu et al. (2026). In those…

30 thms3 active usersReviewed
Machine LearningStatisticsTheoretical Computer Science·Captain: Shuze Chen

A General Approach to Polynomial-Time Truncated Learning via Low-Degree MomentsResearch Paper

Truncated statistics asks what can be learned about a distribution from samples that are only observed when they fall in a set SSS. The question goes back to Galton (1898) and Pearson and Lee (1908), and it arises whenever data are censored by a measuring device, a selection rule or a threshold. For the multivariate Gaussian with a known truncation set,…

18 thms3 active usersReviewed
Machine LearningStatistics·Captain: Shuze Chen

Minimax Rates for Estimation of Average Treatment Effects in Observational StudiesResearch Paper

Estimating the average treatment effect (ATE) from observational data is a central task of causal inference in medicine, economics and the social sciences. Without randomization, treatment and outcome may both depend on the covariates, and the effect is identified only under unconfoundedness and overlap (Rosenbaum and Rubin 1983). Standard estimators first…

21 thms3 active usersReviewed
Algorithmic Game TheoryEconomicsMechanism Design+1·Captain: Shuze Chen

On the Power and Limitations of Multiple Intermediaries for Single-Item AuctionsResearch Paper

A seller may be unable to receive buyers' bids directly. Intermediaries can control access to its auction and charge bidders for the right to participate. Competition between those intermediaries might reduce exclusion, but it need not transfer their revenue back to the seller. These are different questions: whether the item reaches the buyer who values it…

16 thms3 active usersReviewed
Machine LearningStatisticsTheoretical Computer Science·Captain: iris

Optimal Private Gaussian Multi-samplingResearch Paper

A private sampler receives a dataset of nnn records drawn from an unknown distribution PPP and releases new records that look like draws from PPP, while satisfying differential privacy (DP) with respect to the input dataset. Releasing samples instead of estimated parameters lets a downstream user run any procedure on the synthetic records without a further…

29 thms3 active usersReviewed
Mathematical PhysicsQuantum Information·Captain: iris

Beyond light cones: State preparation complexity in quantum spin glassesResearch Paper

A central question in quantum complexity is which resources a quantum state must have to reach low energy for a hard, disordered Hamiltonian. For geometrically local models, light-cone arguments bound what shallow circuits can do: a depth-DDD circuit only correlates qubits inside a backward light cone. Dense spin glasses have no geometry, so light-cone…

25 thms3 active usersReviewed
CombinatoricsComplexity TheoryGraph Theory+1·Captain: Shuze Chen

Near-Linear Lower Bounds for Testing Directed AcyclicityResearch Paper

Property testing asks for algorithms that inspect a tiny part of a large object and distinguish objects with a property from objects that are far from it (Goldreich, Goldwasser, Ron 1998). For sparse directed graphs, the natural access model is the bounded-degree incidence-lists model of Bender and Ron (2002): the algorithm may ask for the outgoing edges of…

20 thms3 active usersReviewed
StatisticsTheoretical Computer Science·Captain: iris

Optimal Robust Community DetectionResearch Paper

The stochastic block model is the standard random-graph model of community structure, studied in algorithms, statistics and statistical physics. In its sparse two-community form, every vertex carries a hidden label ±1\pm1±1, and edges are slightly more (or less) likely inside a community than across. The basic question is how well the labels can be recovered…

37 thms3 active usersReviewed
Complexity TheorycryptographyTheoretical Computer Science·Captain: iris

New Results in Adaptively-Secure Broadcast Encryption and Succinct Computational Secret Sharing from Standard LatticesResearch Paper

A programmable pseudorandom set sampler (PPS) is a dual-mode functional encryption scheme in which a secret key belongs to a set SSS of indices and a ciphertext belongs to one index iii. Ciphertexts can be produced in two modes: a public-key mode that needs no secret and encrypts nothing useful, and a secret-key mode that encrypts a message μ\muμ. The two modes…

93 thms3 active usersReviewed
🏆Completed
Machine Learning·Captain: Shuze Chen

Sample Complexity of Multiclass OmnipredictionResearch Paper

Omniprediction, introduced by Gopalan, Kalai, Reingold, Sharan and Wieder (arXiv:2109.05389), asks for one predictor that serves every downstream decision maker at once. Each decision maker has their own loss, best-responds to the predicted label distribution, and should do as well as the best benchmark in a fixed class FFF. For binary labels, randomized…

15 thms3 active usersReviewed
Operations ResearchOptimizationTheoretical Computer Science·Captain: Shuze Chen

A PTAS for the Minimum Sum of Radii ProblemResearch Paper

In Minimum Sum of Radii (MSR) one is given a finite metric space (P,d)(P, d)(P,d) with ∣P∣=n|P| = n∣P∣=n and an integer k∈[n]k \in [n]k∈[n], and must partition PPP into at most kkk clusters so as to minimise the sum of their radii, where the radius of a cluster CCC is rad(C)=min⁡p∈Pmax⁡q∈Cd(p,q)\mathrm{rad}(C) = \min_{p \in P} \max_{q \in C} d(p, q)rad(C)=minp∈P​maxq∈C​d(p,q). Equivalently, one covers PPP by at most kkk balls and pays the sum of…

24 thms3 active usersReviewed
PreviousPage 25 of 110Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me