Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Probability

2,744 missions · 1,571 completed

Missions

Open1173Completed1571All2744
Graph TheoryTheoretical Computer Science·Captain: Shuze Chen

Instance-Optimality of Single-Pair Personalized PageRankResearch Paper

Random walks with restart are a basic tool of network analysis. The personalized PageRank (PPR) π(s,t)\pi(s,t)π(s,t) of a target ttt with respect to a source sss measures how close ttt is to sss in a directed graph. It was introduced for personalized web search by Brin and Page, and it is now used in recommender systems, node embeddings, local clustering and graph neural…

21 thms1 active userReviewed
Machine LearningOperations ResearchTheoretical Computer Science·Captain: Shuze Chen

Tight Bounds for k-Median++ and Improved Bounds for k-Means++Research Paper

The k-means++ seeding rule of Arthur and Vassilvitskii (AV07) picks cluster centers one at a time: the first uniformly from the input, each later one with probability proportional to its current cost. It is the default initialization of k-means in scikit-learn, Apache Spark and Google BigQuery ML, and it is a building block of local-search, streaming and…

13 thms1 active userReviewed
Algorithmic Game TheoryCombinatoricsOptimization·Captain: mikedeng1

Single-Sample Prophet Inequalities: A Combinatorial to Single-Item ReductionResearch Paper

In an online allocation problem, buyers arrive one at a time and each must be served irrevocably on arrival; the benchmark is the prophet, who sees all valuations in advance and allocates optimally. When the valuations are random with known distributions, guarantees of this kind are prophet inequalities. A much weaker information model gives the algorithm…

39 thms1 active userReviewed
Graph Theory·Captain: mikedeng1

From Oblivious to Adaptive Adversaries: Black-Box Reductions for Monotone Dynamic Problems with Applications to Cuts, Distances, and ClusteringResearch Paper

A randomized dynamic graph algorithm receives updates and maintains an answer after each one. An oblivious adversary commits to its update sequence independently of the algorithm's randomness. An adaptive adversary can choose the next update after inspecting earlier published answers. A guarantee for every fixed sequence does not automatically cover…

6 thms1 active userReviewed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Work-Efficient Parallel Rounding: Product ObjectivesResearch Paper

Randomized rounding often certifies a collection of requirements by assigning a nonnegative penalty to each failure and bounding their total expectation. When the coordinates are independent, exponential penalties for linear sums factor into products of functions of individual coordinates. Preserving the sum of these product expectations therefore provides…

9 thms1 active userReviewed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

An Efficient 1/4-Competitive Prophet Inequality for Subadditive Combinatorial AllocationsResearch Paper

A seller with several distinct items must often decide whom to serve before knowing the demand of later buyers. Waiting for every valuation would permit a welfare maximizing allocation in hindsight, but an online allocation must commit items as buyers arrive. This creates a quantitative question: how much welfare can a causal algorithm preserve when it…

22 thms1 active userReviewed
Computational ComplexityHarmonic Analysis·Captain: mikedeng1

Testing Fourier Sparsity Near OptimallyResearch Paper

A Boolean function f:F2n→{−1,+1}f:\mathbb F_2^n\to\{-1,+1\}f:F2n​→{−1,+1} is sss-Fourier-sparse when at most sss of its Fourier coefficients are nonzero. Sparse functions include parities and kkk-juntas (which have at most 2k2^k2k nonzero coefficients), so sparsity is one of the basic "concise representation" classes of learning theory and property testing. A tester for this class reads fff at a…

16 thms1 active userReviewed
cryptographyMarkov Chain·Captain: mikedeng1

Comparison is All You Need: Settling the ttt-wise independence of AESResearch Paper

A block cipher maps fixed-length plaintext blocks to ciphertext blocks using a secret key. One way to study its statistical behavior is to fix several distinct plaintexts and ask whether their ciphertexts resemble the outputs of a uniformly random permutation. This is approximate t-wise independence: it controls every test of the joint outputs at those…

21 thms1 active userReviewed
CombinatoricsDiscrete GeometryTheoretical Computer Science·Captain: iris

Replicable Mean Estimation via Random Lattice RoundingResearch Paper

A randomized algorithm is ρ-replicable if two runs on independent samples, sharing their random seed, return the same output with probability at least 1−ρ1-\rho1−ρ (Impagliazzo–Lei–Pitassi–Sorrell 2022). Many replicable algorithms (PAC learning, bandits, hypothesis testing) reduce to replicable mean estimation in Rd\mathbb R^dRd. Hopkins, Impagliazzo, Kane, Liu and…

23 thms1 active userReviewed
Computational ComplexityTheoretical Computer Science·Captain: iris

The Space Complexity of Property TestingResearch Paper

Property testing asks for randomized algorithms that query a Boolean function f:{0,1}n→{0,1}f:\{0,1\}^n\to\{0,1\}f:{0,1}n→{0,1} at a few points and decide, with probability at least 2/32/32/3, whether fff has a property P\mathcal PP or is ε\varepsilonε-far from it, meaning that at least an ε\varepsilonε fraction of its values must change to land in P\mathcal PP. The classical resource is the number…

32 thms1 active userReviewed
Computational ComplexityMachine LearningTheoretical Computer Science·Captain: iris

Memory-Sample Tradeoffs for Agnostically Learning HalfspacesResearch Paper

Agnostic learning of halfspaces asks for a linear classifier whose error is within ε\varepsilonε of the best halfspace, with no assumption on how labels are generated. Statistically the problem is easy: O(d/ε2)O(d/\varepsilon^2)O(d/ε2) samples suffice in dimension ddd. Computationally it is not: the best known algorithms run in time dpoly(1/ε)d^{\mathrm{poly}(1/\varepsilon)}dpoly(1/ε) or …

34 thms1 active userReviewed
CombinatoricsGraph Theory·Captain: Shuze Chen

Fractional colorings of KrK_rKr​-free graphs with local demandsResearch Paper

Lower bounds on the independence number in terms of degrees are among the oldest themes of extremal graph theory. For triangle-free graphs, Ajtai, Komlós and Szemerédi proved α(G)=Ω(nlog⁡d/d)\alpha(G)=\Omega(n\log d/d)α(G)=Ω(nlogd/d) for average degree ddd, and Shearer sharpened this to α(G)≥nf(d)\alpha(G)\ge n f(d)α(G)≥nf(d) with the explicit function f(d)=(dlog⁡d−d+1)/(d−1)2f(d)=(d\log d-d+1)/(d-1)^2f(d)=(dlogd−d+1)/(d−1)2 (Shearer 1983), later to the…

29 thms1 active userReviewed
Theoretical Computer Science·Captain: Shuze Chen

Incremental Open Addressing Has No Time-Space TradeoffResearch Paper

Open addressing is the hash-table framework behind linear probing, quadratic probing, double hashing, Robin Hood hashing and cuckoo hashing. In the incremental (insert-only) setting, keys are inserted one after another into an initially empty array of nnn slots until a target load factor (fraction of occupied slots) is reached. For more than half a century…

23 thms1 active userReviewed
Operations ResearchOptimizationTheoretical Computer Science·Captain: Shuze Chen

Improved Algorithms in the Random-Order Model: Knapsack, GAP, and BeyondResearch Paper

Online services allocate limited resources to requests arriving over time. Accepting a request earns value but uses capacity a later, more valuable request might have needed, and decisions cannot be revised. The simplest such model is online knapsack; the generalized assignment problem (GAP) extends it to several machines on which an item may have different…

16 thms1 active userReviewed
Information TheoryQuantum InformationStatistical Mechanics·Captain: iris

Tight Information-Theoretic Threshold for Decoded Quantum Interferometry with Local Quantum DecodersResearch Paper

Decoded quantum interferometry (DQI) is a quantum algorithm for sparse constraint problems such as Max-kkk-XORSAT: it prepares a state whose amplitudes favour good assignments by reducing optimization to the decoding of a classical linear code (Jordan et al., Nature 2025). How well DQI does is therefore governed by how well that code can be decoded from the…

25 thms1 active userReviewed
AnalysisCombinatoricsTheoretical Computer Science·Captain: Shuze Chen

Inside the Critical Window of Random 2-SATResearch Paper

Random 2-SAT is the one case of random kkk-SAT whose satisfiability threshold and scaling window are both known. With nnn Boolean variables and mmm random 2-clauses, a formula is satisfiable with probability tending to one when m/n<1m/n<1m/n<1 and unsatisfiable with probability tending to one when m/n>1m/n>1m/n>1, a result proved independently by Chvátal and Reed (FOCS 1992), Goerdt…

22 thms1 active userReviewed
Information TheoryOperations ResearchTheoretical Computer Science·Captain: Shuze Chen

Eliminating Ongoing Interaction in Long-Running Verification AgentsResearch Paper

A long-running verification agent completes a chain of tasks, each of which must be submitted exactly, and it can consult a human expert along the way. Every consultation is paid, and every experiment the agent runs on its own tools is paid. A basic design question is whether the expert must stay available throughout the run, answering questions as they…

21 thms1 active userReviewed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: Shuze Chen

Optimal Online Stochastic MatchingResearch Paper

In online bipartite matching, mmm offline vertices are known in advance and online vertices arrive one at a time, each revealing its neighbourhood; every arrival must be rejected or irrevocably matched to an unmatched neighbour, and the goal is a large matching. Under adversarial arrivals the Ranking algorithm of Karp, Vazirani and Vazirani is optimal with…

27 thms1 active userReviewed
CombinatoricsComplexity TheoryHarmonic Analysis+1·Captain: Shuze Chen

Low Soundness Linearity Testing on Subsets of the HypercubeResearch Paper

A linearity test reads a function f:F2n→F2f:\mathbb F_2^n\to\mathbb F_2f:F2n​→F2​ at a few random points and accepts or rejects. It is perfectly complete if it always accepts linear functions. It has low soundness if, whenever it accepts with probability at least (1+δ)/2(1+\delta)/2(1+δ)/2, fff agrees with an affine function on at least a (1+s(δ))/2(1+s(\delta))/2(1+s(δ))/2 fraction of inputs, with s(δ)>0s(\delta)>0s(δ)>0…

22 thms1 active userReviewed
Algorithmic Game TheoryEconomicsOperations Research·Captain: Shuze Chen

The Price of Anarchy in Markets for LemonsResearch Paper

Trade in a market for lemons can fail even when trade is efficient: when the seller knows more than the buyer about the quality of the good, a price at which the seller is willing to sell signals bad news to the buyer, and adverse selection can unravel the market (Akerlof 1970). Securities markets, used-asset markets and insurance all share this structure.…

19 thms1 active userReviewed
Linear algebraRandom Matrix TheoryTheoretical Computer Science·Captain: Shuze Chen

Random tensor isomorphism under orthogonal and unitary actions: Smoothed and average-case analysisResearch Paper

Two 3-tensors A,B∈Cn×n×nA,B\in\mathbb C^{n\times n\times n}A,B∈Cn×n×n are unitarily isomorphic when a change of orthonormal basis in each of the three modes turns one into the other. Deciding this, and its robust version (is BBB close to some basis change of AAA?), is the tensor analogue of comparing two matrices up to unitary equivalence. It arises in quantum information, where a…

19 thms1 active userReviewed
Quantum Information·Captain: mikedeng1

Estimating a Transition Point from Gibbs and Ground StatesResearch Paper

Learning a phase transition from a finite quantum system involves two independent choices: how many state copies to observe and how large a system each copy contains. A transition is defined by an infinite-volume limit, whereas every available density matrix belongs to a finite cube with a specified boundary. More copies refine information about that finite…

23 thms1 active userReviewed
cryptographyTheoretical Computer Science·Captain: Shuze Chen

Optimal Semi-Honest Information-Theoretic Secure Multi-Party Computation with Servers and ErasuresResearch Paper

Secure multi-party computation lets parties compute a joint function of private inputs while revealing nothing beyond the output. In the client–server setting, a few clients with inputs delegate the work to nnn servers that have no inputs, and an adversary may corrupt one client and a fraction α\alphaα of the servers. Oblivious transfer (OT) is the basic…

24 thms1 active userReviewed
Theoretical Computer Science·Captain: iris

Initialization with Exponentially Fewer BitsResearch Paper

Wireless sensor networks and ad hoc radio networks often consist of mass-produced devices that start out indistinguishable: they carry no identifiers, run identical code, and share one radio channel. Many distributed algorithms assume that nodes have distinct IDs. So a basic first task is initialization: the nnn nodes must give themselves the distinct IDs …

12 thms1 active userReviewed
Machine LearningTheoretical Computer Science·Captain: Shuze Chen

Agnostic Learning by ImitatingResearch Paper

Given a class CCC of models c:X→[−1,1]c:X\to[-1,1]c:X→[−1,1] and labeled data (x,y)∈X×{±1}(x,y)\in X\times\{\pm1\}(x,y)∈X×{±1}, two learning goals relative to CCC are standard. Agnostic learning (Haussler 1992; Kearns, Schapire and Sellie 1994) asks for a predictor whose absolute error is nearly as small as that of the best model in CCC. Multiaccuracy (Trevisan, Tulsiani and Vadhan 2009; Hébert-Johnson,…

13 thms1 active userReviewed
PreviousPage 98 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