Formalizations of theorems from papers submitted to ACM STOC 2027 (the 59th Annual ACM Symposium on Theory of Computing). Paper list: https://sigact-stoc.github.io/stoc2027/ . Missions here state a main result of a STOC 2027 paper in Lean 4 with Mathlib; each mission's title begins with the paper title.
A Universal Threshold Theory for Local Properties of Random Linear CodesResearch Paper
A linear code stores messages as vectors in a finite-dimensional vector space. Its dimension controls how many messages it can represent, while its other properties determine what kinds of corruption or ambiguity it can tolerate. Researchers studying random codes therefore ask at which dimensions a given property becomes likely. For many properties, a small…
The Computational Complexity of Concurrent Stochastic Games: Exact Value and ApproximationResearch Paper
A concurrent stochastic game (CSG) is played by two players on a finite graph of states. At every stage both players choose an action simultaneously and independently, and the pair of actions together with the current state determines a probability distribution over the next state. CSGs are the standard model of two-agent interaction under uncertainty with…
Competitive Random-Order Correlation k-ClusteringResearch Paper
Correlation clustering groups objects using only pairwise similarity judgements. Each pair is labelled positive or negative, and a clustering pays for positive pairs separated into different groups and negative pairs placed together. This objective is useful when similarities are qualitative and need not come from distances. Limiting the number of groups…
Wait-Free Solvability of General Tasks and a New Proof of the Renaming DichotomyResearch Paper
A distributed program must produce compatible outputs even though each process sees only its own input and the shared memory it has read. Some processes may stop permanently. A wait-free program guarantees that each process that continues taking steps decides after finitely many of its own steps, regardless of the behavior of the others. A solvability…
Random Deletion for Circuits in Regular MatroidsResearch Paper
Karger's random contraction algorithm ([Kar93], [Kar95]) showed that a graph with minimum cut weight λ has at most n2α cuts of weight at most αλ. Through matroid duality, cuts of a graph are the circuits of its cographic matroid and cycles are the circuits of its graphic matroid, and Subramanian ([Sub95]) proved the analogous bound …
The Complexity of Distributed Minimum Weight Cycle ApproximationResearch Paper
A network can have inexpensive routes between many pairs of devices while its cheapest round trip remains difficult to identify. A minimum weight cycle is a simple closed route of minimum total edge weight. Finding one is a basic graph optimization problem related to shortest paths. In a distributed network the graph also determines which devices can…
Matrix sensing meets property testing: Sample-optimal testing for low rankResearch Paper
A low-rank matrix represents a linear transformation whose output lies in a small-dimensional subspace. Matrix sensing uses random linear measurements to recover such a transformation. Recovery assumes that the target has low rank; a property test instead checks that assumption, distinguishing a matrix with rank at most a specified integer from one…
Sybil-Proofness of Generalized Adaptive Clinching and Implications for Blockchain Mechanism DesignResearch Paper
An automated market maker (AMM) is a pool of two tokens X and Y that trades against users along a fixed reserve curvey=φ(x). On a blockchain, orders are collected into a batch by a block builder, and the batch is then executed against the pool. Executing orders one at a time in builder-chosen order exposes users to front-running and sandwich attacks.…
Rapid mixing of Gibbs samplers via quantum Dobrushin–Shlosman conditionsResearch Paper
Preparing the Gibbs stateσβ=e−βH/Tre−βH of a quantum many-body Hamiltonian is a basic task of quantum simulation: it gives access to thermal expectation values, and it is the quantum analogue of Markov chain Monte Carlo. A quantum Gibbs sampler is a continuous-time quantum Markov dynamics etL whose unique…
Parameterized Tractability of Euclidean k-Steiner TreeResearch Paper
A Steiner tree connects a set of terminals by a network of minimum total length, possibly through auxiliary Steiner points. In the discrete Euclidean variant the Steiner points must be chosen from a finite candidate set given in the input, and in the k-Steiner variant at most k of them may be used, while the number of terminals is unrestricted. Exact…
Santa Claus and Weighted Nash Social Welfare with Subadditive ValuationsResearch Paper
In max-min allocation, also called the Santa Claus problem, n agents share m indivisible items and the aim is to make the worst-off agent as well off as possible. It is the egalitarian counterpart of welfare maximization and a basic model of fair division; with identical valuations its optimum is the maximin share of the agents. The problem is NP-hard even…
For compact convex sets K1,…,Km⊆Rn, Minkowski showed that the volume of a weighted Minkowski sum is a homogeneous polynomial of degree n in the weights,
The log log jam in Gaussian state tomographyResearch Paper
A Gaussian state of n bosonic modes (light in an optical fibre, a microwave cavity, a mechanical oscillator) is fixed by a mean vector and a covariance matrix, so it looks like a finite-dimensional object to learn. Yet the best known procedures for Gaussian state tomography use O(nloglogE+poly(n)/ε2) copies, where E is the mean energy…
Proper Agnostic Learning of Two Balanced Product Distributions from Prefix-Conditional SamplesResearch Paper
Mixtures of product distributions on the Boolean cube are a basic model of latent structure: each sample comes from one of a few hidden populations, and within a population the coordinates are independent. Learning such mixtures from ordinary samples is hard in general. Learning two-component mixtures, for example, requires assumptions on the component…
Memory–Sample Tradeoffs in High–Dimensional StatisticsResearch Paper
Many high-dimensional estimation and testing problems show a gap between the number of samples that suffices information-theoretically and the number that efficient algorithms seem to need. Statistical-query (SQ) lower bounds are one standard way to show such gaps. A central example is Non-Gaussian Component Analysis (NGCA): distinguish a standard Gaussian…
Hopfield Model with p-spin Interactions: Shattering, Disorder Chaos and Sampling HardnessResearch Paper
The Hopfield model is the standard model of an associative memory: M random patternsη1,…,ηM∈Rn are stored in the couplings of a spin system on {−1,1}n by Hebb's rule, and the low-energy configurations are meant to retrieve them. Its p-spin (dense) version couples p spins at a time; it stores about np−1 patterns instead of about …
Near-Optimal Space and Time Cut Sparsification in Turnstile StreamsResearch Paper
A cut sparsifier of a weighted graph G=(V,E,w) on n vertices is a reweighted subgraph H that approximates the weight of every cut of G within a factor 1±ε. Benczúr and Karger showed that every graph has one with O(nlogn/ε2) edges, and sparsifiers have since become a basic tool for minimum cut, maximum flow, Laplacian solvers and…
Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler–Leman and Hypertree WidthResearch Paper
The Weisfeiler–Leman (WL) family of colour-refinement algorithms is the standard heuristic for graph isomorphism and the yardstick for the expressive power of graph neural networks. Its distinguishing power has an exact algebraic description: by Lovász's theorem two graphs are isomorphic iff every graph has the same number of homomorphisms into both, and…
Random-Walk Cuckoo Hashing is Efficient up to the Critical Load ThresholdResearch Paper
Cuckoo hashing stores keys in a table so that every key sits in one of a few cells determined by its hashes, which makes lookups take constant worst-case time. With d hashes per key, the table can be filled almost completely: Fountoulakis and Panagiotou (FP12) identified the exact load threshold1−εd∗ up to which all keys can be placed with high…
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) of a target t with respect to a source s measures how close t is to s 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…
The Sample Complexity of Multicalibration with an ERM OracleResearch Paper
A risk score is calibrated if, among the people who receive score 0.3, about 30% have the outcome. Calibration is a statement about the whole population and says nothing about subgroups, which may be over- and under-predicted in opposite directions. Multicalibration (Hébert-Johnson et al., ICML 2018) asks for calibration simultaneously on every subgroup…
PAC Learning with Multiple Correct AnswersResearch Paper
In many prediction tasks an input has more than one acceptable answer: a sentence has several valid translations, a scheduling instance several optimal schedules, an image several correct tags. Training data, however, often shows only one correct answer per input: a demonstration. Hanneke, Mansouri, Pour, Shaeiri and Wang (arXiv:2611.05133) ask exactly when…
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…
Learning Fourier-Sparse Signals and Multiband SignalsResearch Paper
Many uses of the continuous Fourier transform observe a signal only on a bounded time window. A basic model is the k-Fourier-sparse signalx(t)=∑j=1kαje2πifjt with complex amplitudes and arbitrary real frequencies in a bandlimit [−F,F], observed through point samples of y=x+η on [−1,1] with adversarial noise η. When the…
Fair and Efficient Balanced Allocations for Additive ValuationsResearch Paper
Dividing indivisible items among agents with additive valuations is the core model of fair division, with applications from inheritance and divorce settlements to course allocation and shift scheduling. The standard fairness relaxation is envy-freeness up to one item (EF1) and the standard efficiency notion is Pareto optimality (PO), strengthened to fraction…