{"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":"2106.02129","title":"The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials","created":"2021-06-03","cited_by_count":14,"area":null},{"id":"2208.06975","title":"Rethinking Graph Neural Networks for the Graph Coloring Problem","created":"2022-08-15","cited_by_count":13,"area":null},{"id":"2109.06915","title":"Reconstruction on Trees and Low-Degree Polynomials","created":"2021-09-14","cited_by_count":10,"area":null},{"id":"2303.02118","title":"Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression","created":"2023-03-03","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":"2506.19276","title":"Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT","created":"2025-06-24","cited_by_count":5,"area":null},{"id":"2507.09247","title":"A CLuP algorithm to practically achieve $\\sim 0.76$ SK--model ground state free energy","created":"2025-07-12","cited_by_count":5,"area":null},{"id":"2311.00289","title":"Precise Error Rates for Computationally Efficient Testing","created":"2023-11-01","cited_by_count":4,"area":null},{"id":"2507.22396","title":"CLuP practically achieves $\\sim 1.77$ positive and $\\sim 0.33$ negative Hopfield model ground state free energy","created":"2025-07-30","cited_by_count":3,"area":null},{"id":"2511.01037","title":"Binary perceptron computational gap -- a parametric fl RDT view","created":"2025-11-02","cited_by_count":3,"area":null},{"id":"2306.02555","title":"Barriers for the performance of graph neural networks (GNN) in discrete random structures. A comment on~\\cite{schuetz2022combinatorial},\\cite{angelini2023modern},\\cite{schuetz2023reply}","created":"2023-06-05","cited_by_count":1,"area":null},{"id":"2601.10628","title":"Parametric RDT approach to computational gap of symmetric binary perceptron","created":"2026-01-15","cited_by_count":1,"area":null},{"id":"2106.04805","title":"Streaming Belief Propagation for Community Detection","created":"2021-06-09","cited_by_count":0,"area":null},{"id":"2506.18275","title":"Phase transition of \\emph{descending} phase retrieval algorithms","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2506.18279","title":"Optimal spectral initializers impact on phase retrieval phase transitions -- an RDT view","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2506.18282","title":"Phase retrieval with rank $d$ measurements -- \\emph{descending} algorithms phase transitions","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2506.19273","title":"A large deviation view of \\emph{stationarized} fully lifted blirp interpolation","created":"2025-06-24","cited_by_count":0,"area":null},{"id":"2510.21392","title":"On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model","created":"2025-10-24","cited_by_count":0,"area":null},{"id":"2604.19712","title":"Ultrametric OGP - parametric RDT \\emph{symmetric} binary perceptron connection","created":"2026-04-21","cited_by_count":0,"area":null}],"next_cursor":null}