{"total":13,"rows":[{"id":"2111.15521","title":"Node-Level Differentially Private Graph Neural Networks","created":"2021-11-23","cited_by_count":43,"area":null},{"id":"2301.04822","title":"Private estimation algorithms for stochastic block models and mixture models","created":"2023-01-11","cited_by_count":21,"area":null},{"id":"2210.01318","title":"OpBoost: A Vertical Federated Tree Boosting Framework Based on Order-Preserving Desensitization","created":"2022-10-04","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":"2203.01440","title":"Near-Optimal Correlation Clustering with Privacy","created":"2022-03-02","cited_by_count":6,"area":null},{"id":"2403.12213","title":"Private graphon estimation via sum-of-squares","created":"2024-03-18","cited_by_count":3,"area":null},{"id":"2502.15024","title":"Low degree conjecture implies sharp computational thresholds in stochastic block model","created":"2025-02-20","cited_by_count":3,"area":null},{"id":"2405.16663","title":"Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust","created":"2024-05-26","cited_by_count":2,"area":null},{"id":"2101.00503","title":"Modularity maximisation for graphons","created":"2021-01-02","cited_by_count":1,"area":null},{"id":"2201.01689","title":"Asymptotics of $\\ell_2$ Regularized Network Embeddings","created":"2022-01-05","cited_by_count":0,"area":null},{"id":"2410.19012","title":"Privacy-Computation trade-offs in Private Repetition and Metaselection","created":"2024-10-22","cited_by_count":0,"area":null},{"id":"2503.03622","title":"It's My Data Too: Private ML for Datasets with Multi-User Training Examples","created":"2025-03-05","cited_by_count":0,"area":null},{"id":"2604.07493","title":"Differentially Private Modeling of Disease Transmission within Human Contact Networks","created":"2026-04-08","cited_by_count":0,"area":null}],"next_cursor":null}