human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "quantum entropy scoring for fast robust mean estimation and improved outlier detection"):
  Abstract: We study two problems in high-dimensional robust statistics: \emph{robust mean estimation} and \emph{outlier detection}. In robust mean estimation the goal is to estimate the mean $\mu$ of a distribution on $\mathbb{R}^d$ given $n$ independent samples, an $\varepsilon$-fraction of which have been corrupted by a malicious adversary. In outlier detection the goal is to assign an \emph{outlier score} to each element of a data set such that elements more likely to be outliers are assigned higher scores. Our algorithms for both problems are based on a new outlier scoring method we call QUE-scoring based on \emph{quantum entropy regularization}. For robust mean estimation, this yields the first algorithm with optimal error rates and nearly-linear running time $\widetilde{O}(nd)$ in all parameters, improving on the previous fastest running time $\widetilde{O}(\min(nd/\varepsilon^6, nd^2))$. For outlier detection, we evaluate the performance of QUE-scoring via extensive experiments on synthetic and real data, and demonstrate that it often performs better than previously proposed algorithms. Code for these experiments is available at this https URL .

Includes members:
  Member "faster algorithms for high dimensional robust covariance estimation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust mean estimation under coordinate level corruption")
  Member "how hard is robust mean estimation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust mean estimation under coordinate level corruption")
  Member "high dimensional robust mean estimation in nearly linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "positive semidefinite programming mixed parallel and width independent")
  Member "being robust in high dimensions can be practical":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "private mean estimation of heavy tailed distributions")
  Member "statistical query lower bounds for robust estimation of high dimensional gaussians and gaussian mixtures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning structured distributions from untrusted batches faster and simpler")
  Member "agnostic estimation of mean and covariance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "robust estimators in high dimensions without the computational intractability":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "locally private hypothesis selection")
  Member "spectral sparsification and regret minimization beyond matrix multiplicative updates":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a spectral approach to network design")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DS(Data Structures and Algorithms)