pith. sign in

In: Proceedings of the Thirty-ninth Annual AC M Symposium on Theory of Computing, pp

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

years

2026 3 2023 1

verdicts

UNVERDICTED 4

roles

background 1

polarities

background 1

representative citing papers

Optimal Reconstruction from Linear Queries

cs.LG · 2026-05-19 · unverdicted · novelty 7.0

Optimal reconstruction error from approximate linear queries converges to sqrt(2d/(d+1)) delta as number of queries T goes to infinity, with doubly exponential excess error decay for fixed d and exp(d) queries needed for vanishing excess when d grows.

citing papers explorer

Showing 4 of 4 citing papers.

  • Optimal Reconstruction from Linear Queries cs.LG · 2026-05-19 · unverdicted · none · ref 47

    Optimal reconstruction error from approximate linear queries converges to sqrt(2d/(d+1)) delta as number of queries T goes to infinity, with doubly exponential excess error decay for fixed d and exp(d) queries needed for vanishing excess when d grows.

  • Differentially Private Modeling of Disease Transmission within Human Contact Networks cs.CR · 2026-04-08 · unverdicted · none · ref 83

    A differentially private pipeline using node-level DP summaries to fit ERGMs or SBMs, generate synthetic networks, and simulate SIS disease spread on ARTNet sexual contact data produces incidence, prevalence, and intervention effect sizes close to non-private versions.

  • CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces cs.DB · 2026-05-22 · unverdicted · none · ref 59

    CHRONOS is a three-layer system for evolving data marketplaces that applies neural-ODE temporal decay, changepoint-aware Shapley valuation, and EXP3-IX private coordination to achieve 0.937 recall, 2.74 qps, 161 ms latency, and epsilon 4.25 at delta 10^-6.

  • Privacy Constrained Fairness Estimation for Decision Trees cs.LG · 2023-12-13 · unverdicted · none · ref 42

    PAFER estimates statistical parity for differentially private decision trees using Laplacian noise, achieving low error while preserving privacy and favoring interpretable trees.