[{"id": "AGeneralizedTrace", "title": "A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities", "authors": "Joey Rivkin, Gregory Valiant, Paul Valiant", "venue": "STOC 2025", "blurb": "Formalizes the lower bound for the generalized trace reconstruction problem of recovering a string of probabilities from random traces.", "pdf_url": "/files/AGeneralizedTrace/A_Generalized_Trace_Reconstruction_Problem_Recovering_a_String_of_Probabilities.pdf", "counts": {"envs": 140, "decls": 1229, "links": 1229}}, {"id": "ASharp", "title": "A Sharp Version of Talagrand's Selector Process Conjecture and an Application to Rounding Fractional Covers", "authors": "Huy Tuan Pham", "venue": "STOC 2025", "blurb": "Formalizes a sharp version of Talagrand's selector process conjecture and its consequence for rounding fractional covers to integral ones.", "pdf_url": "/files/ASharp/A_sharp_version_of_Talagrands_selector_process_conjecture_and_an_application_to_rounding_fractional_covers.pdf", "counts": {"envs": 120, "decls": 151, "links": 151}}, {"id": "ApproximantionMedian", "title": "Approximation Guarantees of the Median Mechanism in ℝᵈ", "authors": "Nick Gravin, Jianhao Jia", "venue": "STOC 2025", "blurb": "Formalizes the dimension-independent approximation ratio of the coordinate-wise median mechanism in ℝᵈ.", "pdf_url": "/files/ApproximantionMedian/Approximation_guarantees_of_Median_Mechanism_in_ℝd.pdf", "counts": {"envs": 162, "decls": 256, "links": 256}}, {"id": "EfficientlyLeanringMixtures", "title": "Efficiently Learning Mixtures of Two Gaussians", "authors": "Adam Tauman Kalai, Ankur Moitra, Gregory Valiant", "venue": "STOC 2010", "blurb": "Formalizes that the first six moments of a one-dimensional mixture of two Gaussians suffice to robustly recover its parameters.", "pdf_url": "/files/EfficientlyLeanringMixtures/Efficiently_Learning_Mixtures_of_Two_Gaussians.pdf", "counts": {"envs": 489, "decls": 653, "links": 625}}, {"id": "Refuting", "title": "Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity", "authors": "Simon Mackenzie, Abdallah Saffidine", "venue": "STOC 2025", "blurb": "Formalizes a counterexample refuting the direct sum conjecture for total functions in deterministic communication complexity.", "pdf_url": "/files/Refuting/Refuting_the_Direct_Sum_Conjecture_for_Total_Functions_in_Deterministic_Communication_Complexity.pdf", "counts": {"envs": 640, "decls": 295, "links": 291}}]