{"total":13,"rows":[{"id":"2101.08421","title":"Optimal Full Ranking from Pairwise Comparisons","created":"2021-01-21","cited_by_count":16,"area":null},{"id":"2101.11783","title":"Random Graph Matching with Improved Noise Robustness","created":"2021-01-28","cited_by_count":16,"area":null},{"id":"2408.07461","title":"Problem Solving Through Human-AI Preference-Based Cooperation","created":"2024-08-14","cited_by_count":11,"area":null},{"id":"2106.07044","title":"Optimal detection of the feature matching map in presence of noise and outliers","created":"2021-06-13","cited_by_count":5,"area":null},{"id":"2207.01455","title":"Dynamic Ranking and Translation Synchronization","created":"2022-07-04","cited_by_count":4,"area":null},{"id":"2202.01670","title":"Ranking with Confidence for Large Scale Comparison Data","created":"2022-02-03","cited_by_count":3,"area":null},{"id":"2201.06438","title":"Matrix Reordering for Noisy Disordered Matrices: Optimality and Computationally Efficient Algorithms","created":"2022-01-17","cited_by_count":2,"area":null},{"id":"2306.11951","title":"On the Optimal Bounds for Noisy Computing","created":"2023-06-21","cited_by_count":2,"area":null},{"id":"2309.03808","title":"Improved theoretical guarantee for rank aggregation via spectral method","created":"2023-09-07","cited_by_count":2,"area":null},{"id":"2502.13132","title":"Learning to Defer for Causal Discovery with Imperfect Experts","created":"2025-02-18","cited_by_count":2,"area":null},{"id":"2210.13354","title":"Matching Map Recovery with an Unknown Number of Outliers","created":"2022-10-24","cited_by_count":1,"area":null},{"id":"2311.13595","title":"Covariance alignment: from maximum likelihood estimation to Gromov-Wasserstein","created":"2023-11-22","cited_by_count":1,"area":null},{"id":"2512.21111","title":"Statistical and computational challenges in ranking","created":"2025-12-24","cited_by_count":0,"area":null}],"next_cursor":null}