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 "fast algorithms for delta separated sparsity projection"):
  Abstract: We describe a fast approximation algorithm for the $\Delta$-separated sparsity projection problem. The $\Delta$-separated sparsity model was introduced by Hegde, Duarte and Cevher (2009) to capture the firing process of a single Poisson neuron with absolute refractoriness. The running time of our projection algorithm is linear for an arbitrary (but fixed) precision and it is both a head and a tail approximation. This solves a problem of Hegde, Indyk and Schmidt (2015). We also describe how our algorithm fits into the approximate model iterative hard tresholding framework of Hegde, Indyk and Schmidt (2014) that allows to recover $\Delta$-separated sparse signals from noisy random linear measurements. The resulting recovery algorithm is substantially faster than the existing one, at least for large data sets.

Includes members:
  Member "a variant of the maximum weight independent set problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sas assisted coexistence aware dynamic channel assignment in cbrs band")
  Member "iterative hard thresholding for compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient active learning of sparse halfspaces with arbitrary bounded noise")

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)