{"total":14,"rows":[{"id":"2207.11903","title":"Minimax Rates for Robust Community Detection","created":"2022-07-25","cited_by_count":12,"area":null},{"id":"2111.05320","title":"Robust Estimation for Random Graphs","created":"2021-11-09","cited_by_count":8,"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":"2305.00979","title":"Spectral clustering in the Gaussian mixture block model","created":"2023-04-29","cited_by_count":7,"area":null},{"id":"2111.06395","title":"Kalman Filtering with Adversarial Corruptions","created":"2021-11-11","cited_by_count":6,"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":"2311.09017","title":"Semidefinite programs simulate approximate message passing robustly","created":"2023-11-15","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":"2402.05451","title":"Low-degree phase transitions for detecting a planted clique in sublinear time","created":"2024-02-08","cited_by_count":0,"area":null},{"id":"2404.00768","title":"Adversarially-Robust Inference on Trees via Belief Propagation","created":"2024-03-31","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":"2606.00500","title":"Easy, robust approximate message passing for planted spike models","created":"2026-05-30","cited_by_count":0,"area":null},{"id":"2607.04869","title":"Active Learning on Adversarially Corrupted Graphs","created":"2026-07-06","cited_by_count":0,"area":null}],"next_cursor":null}