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 "a new algorithm for the robust semi random independent set problem"):
  Abstract: In this paper, we study a general semi-random version of the planted independent set problem in a model initially proposed by Feige and Kilian, which has a large proportion of adversarial edges. #R##N#We give a new deterministic algorithm that finds a list of independent sets, one of which, with high probability, is the planted one, provided that the planted set has size $k=\Omega(n^{2/3})$. This improves on Feige and Kilian's original randomized algorithm, which with high probability recovers an independent set of size at least $k$ when $k=\alpha n$ where $\alpha$ is a constant.

Includes members:
  Member "does robustness imply tractability a lower bound for planted clique in the semi random model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximation algorithms for partially colorable graphs")
  Member "learning from untrusted data":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "constant factor approximation for balanced cut in the pie model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robust clustering oracle and local reconstructor of cluster structure of graphs")
  Member "grothendieck type inequalities in combinatorial optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adversarially robust low dimensional representations")
  Member "how to play unique games against a semi random adversary":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards learning sparsely used dictionaries with arbitrary supports")

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)