{"total":19,"rows":[{"id":"2511.21526","title":"Phase Transition for Stochastic Block Model with more than $\\sqrt{n}$ Communities (II)","created":"2025-11-26","cited_by_count":4,"area":null},{"id":"2509.15822","title":"Phase Transition for Stochastic Block Model with more than $\\sqrt{n}$ Communities","created":"2025-09-19","cited_by_count":3,"area":null},{"id":"2511.19398","title":"PTF Testing Lower Bounds for Non-Gaussian Component Analysis","created":"2025-11-24","cited_by_count":2,"area":null},{"id":"2603.02594","title":"Low-Degree Method Fails to Predict Robust Subspace Recovery","created":"2026-03-03","cited_by_count":2,"area":null},{"id":"2603.17896","title":"A Noise Sensitivity Exponent Controls Large Statistical-to-Computational Gaps in Single- and Multi-Index Models","created":"2026-03-18","cited_by_count":2,"area":null},{"id":"2603.18254","title":"Computation-Utility-Privacy Tradeoffs in Bayesian Estimation","created":"2026-03-18","cited_by_count":1,"area":null},{"id":"2604.06109","title":"Learning $\\mathsf{AC}^0$ Under Graphical Models","created":"2026-04-07","cited_by_count":1,"area":null},{"id":"2604.17410","title":"Algorithmic Contiguity from Low-Degree Heuristic II: Predicting Detection-Recovery Gaps","created":"2026-04-19","cited_by_count":1,"area":null},{"id":"2606.05266","title":"Sharp Low-Degree Thresholds for Planted-vs-Planted Testing","created":"2026-06-03","cited_by_count":1,"area":null},{"id":"2510.08541","title":"Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2512.00610","title":"Statistical-computational gap in multiple Gaussian graph alignment","created":"2025-11-29","cited_by_count":0,"area":null},{"id":"2512.21111","title":"Statistical and computational challenges in ranking","created":"2025-12-24","cited_by_count":0,"area":null},{"id":"2602.12449","title":"Computationally sufficient statistics for Ising models","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2603.24545","title":"Detection of local geometry in random graphs: information-theoretic and computational limits","created":"2026-03-25","cited_by_count":0,"area":null},{"id":"2605.18042","title":"On efficient robust regression with subquadratic samples","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2606.11149","title":"Efficiently Learning Drifting Halfspaces with Massart Noise","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2607.08538","title":"High-Dimensional Procrustes Matching via Tree Counts","created":"2026-07-09","cited_by_count":0,"area":null},{"id":"2608.17374","title":"On the Pseudo-Mixing of Kac's Walk","created":"2026-08-18","cited_by_count":0,"area":null},{"id":"2608.18402","title":"Algorithms for adaptive and heteroskedastic linear regression at the computational threshold","created":"2026-08-19","cited_by_count":0,"area":null}],"next_cursor":null}