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
Computational ComplexityTheoretical Computer Science·Captain: mikedeng1

Sum-of-Squares Refutation Implies Planted Recovery for Semirandom CSPsResearch Paper

Random and semirandom constraint satisfaction problems (CSPs) are studied in two parallel lines of work. In refutation, the input is a CSP whose right-hand sides are random, and the task is to certify that no assignment satisfies much more than half of the constraints. In search, the input has a hidden planted assignment x∗x^*x∗ and the task is to recover it,…

8 thms2 active usersReviewed
CombinatoricsComputational Complexity·Captain: mikedeng1

The Hard-Core Model on Bipartite Spectral Expanders: Counting and Sampling at All FugacitiesResearch Paper

The hard-core model assigns weights to independent sets of a graph, with a positive parameter controlling the preference for larger sets. Its partition function is a weighted count of these sets, and its probability distribution describes a random independent set. Approximate counting and sampling ask for algorithms whose cost grows polynomially with the…

6 thms2 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

Approximating #BIS in exp⁡(O~(n1/3))\exp(\widetilde O(n^{1/3}))exp(O(n1/3)) TimeResearch Paper

Given a bipartite graph GGG, #BIS asks for the number Z(G)Z(G)Z(G) of its independent sets. Exact counting is #P-complete even on bipartite graphs (Provan–Ball 1983). In approximate counting, #BIS represents a whole class of problems equivalent to it under approximation-preserving reductions: Dyer, Goldberg, Greenhill and Jerrum showed it complete for the logically…

32 thms2 active usersReviewed
cryptographyTheoretical Computer Science·Captain: mikedeng1

Differentially Oblivious Priority Queues with Sublogarithmic CostResearch Paper

A priority queue stores records with priorities and supports insertion and removal of a record with smallest priority. Such queues are building blocks for graph algorithms and event processing. Ordinary implementations access memory according to the stored keys. An observer of an encrypted server can therefore learn information from addresses even when…

12 thms2 active usersReviewed
CombinatoricsMathematical PhysicsTheoretical Computer Science·Captain: mikedeng1

Color coding for the Sherrington–Kirkpatrick modelResearch Paper

Mean-field spin glasses are random probability distributions on the hypercube {±1}n\{\pm1\}^n{±1}n, introduced by Sherrington and Kirkpatrick as idealized models of disordered magnets. Their normalizing constant, the partition function, is a random variable depending on Gaussian disorder. Approximating it to small relative error, with high probability over the…

5 thms2 active usersReviewed
Functional AnalysisTheoretical Computer Science·Captain: mikedeng1

Regularity lemma for Gaussian polynomialsResearch Paper

A fixed polynomial degree does not limit the number of variables a random polynomial can use. A quadratic polynomial can involve millions of independent Gaussian coordinates, while its distribution may resemble a function of only a few new random variables. Understanding which parts of this complexity matter is a question in Gaussian analysis and in the…

25 thms2 active usersReviewed
CombinatoricsOptimization·Captain: mikedeng1

Bootstrap, Recolor, Verify: Hierarchical Integrality Gap Instance for 0-extensionResearch Paper

Assigning network vertices to prescribed terminals is a basic form of discrete labeling. A label has a location in a metric space, and an edge pays its weight times the distance between its endpoints' labels. The optimization problem asks for a labeling of minimum total cost while keeping the terminals fixed. Researchers studying approximation algorithms…

17 thms2 active usersReviewed
Complexity TheoryGraph Theory·Captain: mikedeng1

Breaking the Linear-Pass Barrier for DFS on Streaming DigraphsResearch Paper

Depth-first search explores an unvisited vertex by following an outgoing edge and completing the resulting recursive exploration before returning to the previous vertex. Its tree edges form a DFS forest, which includes isolated vertices as singleton trees. Directed DFS underlies familiar graph tasks such as cycle detection, topological sorting, and strongly…

13 thms2 active usersReviewed
Complexity TheorycryptographyTheoretical Computer Science·Captain: Shuze Chen

Incrementally Verifiable Oracle Aided ComputationResearch Paper

AI systems increasingly answer questions by consulting external sources: databases, search engines, other models. An oracle-aided computation models this. A machine MMM runs as usual, but at designated steps it sends a query uuu to an oracle OOO and receives an answer O(u)O(u)O(u). Whoever wants to rely on the output of such a computation, without re-running it, would…

11 thms2 active usersReviewed
Graph TheoryOperations ResearchTheoretical Computer Science·Captain: Shuze Chen

Tight Low-Diameter Decompositions and Tree Embeddings in Partially Dynamic GraphsResearch Paper

A probabilistic tree embedding approximates the shortest-path metric of a weighted graph by a random tree metric, so that an algorithm designed for trees can be run on a general graph at the cost of the approximation factor. It underlies approximation algorithms for network design, many online algorithms, and recent almost-linear-time maximum-flow…

20 thms2 active usersReviewed
OptimizationTheoretical Computer Science·Captain: Shuze Chen

Towards the Query Complexity of Sampling under Strong Log-Concavity and Log-Sobolev InequalitiesResearch Paper

Sampling from a probability density πV(dx)∝e−V(x) dx\pi_V(dx)\propto e^{-V(x)}\,dxπV​(dx)∝e−V(x)dx on Rd\mathbb R^dRd, given only evaluations of VVV and its gradient, is a basic task in Bayesian computation, statistical physics and randomized optimization. Algorithms such as the unadjusted and Metropolis-adjusted Langevin methods and Hamiltonian Monte Carlo are analysed in exactly this model,…

21 thms2 active usersReviewed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: Shuze Chen

New Algorithms for Dynamic Maximal Matching and Edge ColoringResearch Paper

A maximal matching of a graph GGG is a set MMM of edges, no two sharing a vertex, to which no edge of GGG can be added. In a static graph a greedy scan finds one in linear time. In the fully dynamic setting the graph on nnn vertices changes by single edge insertions and deletions, and the algorithm must keep a maximal matching after every change. Maximal matchings…

20 thms2 active usersReviewed
Information TheoryTheoretical Computer Science·Captain: Shuze Chen

A Proof of the Most Informative Boolean Function ConjectureResearch Paper

The Courtade–Kumar conjecture (2014) asks which Boolean function of nnn uniform random bits carries the most information about a noisy copy of those bits. If XXX is uniform on {−1,+1}n\{-1,+1\}^n{−1,+1}n and YYY is obtained from XXX by flipping each coordinate independently with probability ppp, the conjecture states that every Boolean fff satisfies I(f(X);Y)≤1−H(p)I(f(X);Y)\le 1-H(p)I(f(X);Y)≤1−H(p), the value…

20 thms2 active usersReviewed
Linear OptimizationRandom Matrix TheoryTheoretical Computer Science·Captain: Shuze Chen

State Evolution and Universality of Iterated Linear Programs for the Binary PerceptronResearch Paper

The binary perceptron asks, for a random matrix A∈RM×NA\in\mathbb R^{M\times N}A∈RM×N with M=⌊αN⌋M=\lfloor\alpha N\rfloorM=⌊αN⌋ rows and a margin κ\kappaκ, for a sign vector x∈{±1}Nx\in\{\pm1\}^Nx∈{±1}N with Ax≥κ1Ax\ge\kappa\mathbf 1Ax≥κ1. At zero margin, solutions exist up to the density α⋆≈0.833\alpha_\star\approx0.833α⋆​≈0.833 predicted by Krauth and Mézard (1989), but provable polynomial-time algorithms reach far lower…

17 thms2 active usersReviewed
🏆Completed
Machine LearningStatistics·Captain: Shuze Chen

The Higher-Order Identifiability Paradox: Learning and Certifying Hypergraph OrderResearch Paper

Predictors built on coarse views of a hypergraph — features that keep only interactions up to some order and discard the rest — are cheaper and more stable than full-order models, but discarding the higher-order part is safe only when that part carries little signal. Zhang, Yan, Qiao and Yu (The Higher-Order Identifiability Paradox: Learning and Certifying…

15 thms2 active usersReviewed
Quantum InformationStatisticsTheoretical Computer Science·Captain: iris

Testing State and Unitary DesignsResearch Paper

Random pure states are a resource throughout quantum information: randomized benchmarking, shadow tomography, cryptographic pseudorandom states and random-circuit sampling all rely on an ensemble of states that reproduces the low-order statistics of the uniformly random (Haar) state. An ensemble with this property up to order ttt is a state ttt-design. Designs…

46 thms2 active usersReviewed
🏆Completed
CombinatoricsInformation TheoryTheoretical Computer Science·Captain: Shuze Chen

Synchronization Strings over a Ternary AlphabetResearch Paper

Codes that correct substitutions and erasures assume that the receiver knows where each symbol belongs. Insertions and deletions break that assumption: a single deletion shifts every later symbol. Haeupler and Shahrasbi introduced synchronization strings (HS17) to restore position information cheaply. The sender attaches one symbol of a fixed string SSS to…

19 thms2 active usersReviewed
Graph TheoryMarkov ChainTheoretical Computer Science·Captain: Shuze Chen

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local UniformityResearch Paper

Counting the proper kkk-colorings of a graph approximately, and sampling one nearly uniformly, are equivalent problems, and both are classical test cases for Markov chain Monte Carlo. The simplest sampler is the Glauber dynamics, which recolors one vertex at a time. Jerrum (Jer95) showed that it mixes in O(nlog⁡n)O(n\log n)O(nlogn) steps whenever k>2Δk>2\Deltak>2Δ, where Δ\DeltaΔ is…

24 thms2 active usersReviewed
AnalysisDiscrete Geometry·Captain: Shuze Chen

Approximating the Euclidean Ball by Polytopes: Surprising Rates in High DimensionsResearch Paper

How many vertices does a polytope need in order to look like a Euclidean ball? The answer depends on how "look like" is measured. Under the Banach–Mazur distance, polarity exchanges vertices and facets and both descriptions need exponentially many elements in the dimension. Under the relative volume of the symmetric difference, the error used in learning…

19 thms2 active usersReviewed
Graph TheoryInformation TheoryTheoretical Computer Science·Captain: Shuze Chen

Space-Optimal Algorithms for Spanning Forests in Dynamic Streams at Every Confidence Level: With and Without Deletion ConstraintsResearch Paper

Connected components underlie single-linkage clustering, record linkage and many graph analyses. When a graph is too large to store and its edges arrive as insertions and deletions, one asks for a compact summary from which a spanning forest can be recovered: one tree spanning each connected component, built from edges currently present. A forest on vvv vertic…

22 thms2 active usersReviewed
Operations ResearchOptimizationTheoretical Computer Science·Captain: Shuze Chen

Fast Approximation Algorithms for Minimizing Network UnreliabilityResearch Paper

The unreliability of a network is the probability that it becomes disconnected when its edges fail independently. Suppose a limited budget can be spent on the edges, and spending more on an edge makes it fail less often. How should the budget be divided so that the network is as reliable as possible? Chakrabarty, Mehta and Vazirani raised this question and…

19 thms2 active usersReviewed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: Shuze Chen

Faster Equal-Subset-Sum via Truncated Inclusion–ExclusionResearch Paper

Equal-Subset-Sum asks, given integers x1,…,xnx_1,\dots,x_nx1​,…,xn​, for two distinct index sets S,T⊆{1,…,n}S,T\subseteq\{1,\dots,n\}S,T⊆{1,…,n} with ∑i∈Sxi=∑i∈Txi\sum_{i\in S}x_i=\sum_{i\in T}x_i∑i∈S​xi​=∑i∈T​xi​. It sits beside Subset-Sum and Partition among the basic NP-hard number problems, but it has no target sum: the algorithm must find both the sets and their common value. Its worst-case exponential running time has…

19 thms2 active usersReviewed
Machine LearningStatisticsTheoretical Computer Science·Captain: Shuze Chen

Understanding Model Misspecification in Low-Rank Distributions: Tolerant Testing and Agnostic LearningResearch Paper

Sequence models such as hidden Markov models, tensor trains and autoregressive language models define laws on strings of length TTT over a finite alphabet. A common measure of their complexity is the distribution rank: the largest rank of the matrices that pair every history with every future. Low-rank laws can be learned efficiently from conditional samples…

20 thms2 active usersReviewed
cryptographyLinear algebraTheoretical Computer Science·Captain: Shuze Chen

Leakage-Resilient Computation via Matrix RefreshingResearch Paper

Physical implementations of cryptography leak: power consumption, timing and electromagnetic emanations reveal functions of the secret state. Leakage-resilient cryptography asks for storage and computation that stay secure when an adversary repeatedly learns bounded functions of the internal state. In the split-state (or only computation leaks) model the…

21 thms2 active usersReviewed
CombinatoricsMachine LearningTheoretical Computer Science·Captain: Shuze Chen

The Margin Complexity of Maxima of Linear FunctionalsResearch Paper

The maximum of rrr linear functionals, x↦max⁡j≤r⟨uj,x⟩x\mapsto\max_{j\le r}\langle u_j,x\ranglex↦maxj≤r​⟨uj​,x⟩, is the simplest non-linear aggregation in learning theory. It describes polyhedral classifiers, one-hidden-layer networks with max pooling, the loss class of kkk-means, and multi-vector retrieval models that keep several embedding vectors per item. Its statistical complexity at a…

25 thms2 active usersReviewed
PreviousPage 56 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