{"total":22,"rows":[{"id":"2205.09727","title":"The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics","created":"2022-05-19","cited_by_count":31,"area":null},{"id":"2112.03898","title":"Lattice-Based Methods Surpass Sum-of-Squares in Clustering","created":"2021-12-07","cited_by_count":25,"area":null},{"id":"2304.08135","title":"Detection of Dense Subhypergraphs by Low-Degree Polynomials","created":"2023-04-17","cited_by_count":7,"area":null},{"id":"2211.05274","title":"Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials","created":"2022-11-10","cited_by_count":6,"area":null},{"id":"2308.15728","title":"Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials","created":"2023-08-30","cited_by_count":6,"area":null},{"id":"2212.10872","title":"Is it easier to count communities than find them?","created":"2022-12-21","cited_by_count":5,"area":null},{"id":"2302.06737","title":"Detection-Recovery Gap for Planted Dense Cycles","created":"2023-02-13","cited_by_count":4,"area":null},{"id":"2110.00744","title":"Random Subgraph Detection Using Queries","created":"2021-10-02","cited_by_count":3,"area":null},{"id":"2110.01901","title":"Inferring Hidden Structures in Random Graphs","created":"2021-10-05","cited_by_count":2,"area":null},{"id":"2206.11303","title":"Community Recovery in the Geometric Block Model","created":"2022-06-22","cited_by_count":2,"area":null},{"id":"2302.03658","title":"Planted Bipartite Graph Detection","created":"2023-02-07","cited_by_count":2,"area":null},{"id":"2306.05679","title":"Bayes optimal learning in high-dimensional linear regression with network side information","created":"2023-06-09","cited_by_count":2,"area":null},{"id":"2402.00305","title":"Information-Theoretic Thresholds for Planted Dense Cycles","created":"2024-02-01","cited_by_count":2,"area":null},{"id":"2201.01825","title":"Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning","created":"2022-01-05","cited_by_count":1,"area":null},{"id":"2303.05024","title":"Phase transition for detecting a small community in a large network","created":"2023-03-09","cited_by_count":1,"area":null},{"id":"2312.11054","title":"Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding","created":"2023-12-18","cited_by_count":1,"area":null},{"id":"2505.18372","title":"Optimal community detection in dense bipartite graphs","created":"2025-05-23","cited_by_count":1,"area":null},{"id":"2107.11886","title":"Logspace Reducibility From Secret Leakage Planted Clique","created":"2021-07-25","cited_by_count":0,"area":null},{"id":"2402.07717","title":"Computationally efficient reductions between some statistical models","created":"2024-02-12","cited_by_count":0,"area":null},{"id":"2508.02158","title":"Robust Detection of Planted Subgraphs in Semi-Random Models","created":"2025-08-04","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":"2610.13083","title":"The Limits of Query Monitoring against Distributed Model Extraction","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}