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 "generalized center problems with outliers"):
  Abstract: We study the $\mathcal{F}$-center problem with outliers: given a metric space $(X,d)$, a general down-closed family $\mathcal{F}$ of subsets of $X$, and a parameter $m$, we need to locate a subset $S\in \mathcal{F}$ of centers such that the maximum distance among the closest $m$ points in $X$ to $S$ is minimized. Our main result is a dichotomy theorem. Colloquially, we prove that there is an efficient $3$-approximation for the $\mathcal{F}$-center problem with outliers if and only if we can efficiently optimize a poly-bounded linear function over $\mathcal{F}$ subject to a partition constraint. One concrete upshot of our result is a polynomial time $3$-approximation for the knapsack center problem with outliers for which no (true) approximation algorithm was known.

Includes members:
  Member "a lottery model for center type problems with outliers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coreset based strategies for robust center type problems")
  Member "the heterogeneous capacitated k center problem":
    also connected through other hyperedges:
      (none)
  Member "the non uniform k center problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the effectiveness of johnson lindenstrauss transform for high dimensional optimization with outliers")
  Member "on uniform capacitated k median beyond the natural lp relaxation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair clustering with multiple colors")
  Member "lp based algorithms for capacitated facility location":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "easy capacitated facility location problems with connections to lot sizing")
  Member "approximating capacitated k median with 1 epsilon k open facilities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the heterogeneous capacitated k center problem")
  Member "matroid and knapsack center problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coreset based strategies for robust center type problems")

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)