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 "almost optimal semi streaming maximization for k extendible systems"):
  Abstract: In this paper we consider the problem of finding a maximum weight set subject to a $k$-extendible constraint in the data stream model. The only non-trivial algorithm known for this problem to date---to the best of our knowledge---is a semi-streaming $k^2(1 + \varepsilon)$-approximation algorithm (Crouch and Stubbs, 2014), but semi-streaming $O(k)$-approximation algorithms are known for many restricted cases of this general problem. In this paper, we close most of this gap by presenting a semi-streaming $O(k \log k)$-approximation algorithm for the general problem, which is almost the best possible even in the offline setting (Feldman et al., 2017).

Includes members:
  Member "do less get more streaming submodular maximization with subsampling":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "regularized submodular maximization at scale")
  Member "streaming non monotone submodular maximization personalized video summarization on the fly":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")
  Member "greed is good near optimal submodular maximization via greedy optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "regularized submodular maximization at scale")
  Member "streaming algorithms for submodular function maximization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "regularized submodular maximization at scale")
  Member "a new framework for distributed submodular maximization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "regularized submodular maximization at scale")
  Member "large neighborhood local search for the maximum set packing problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "stability and recovery for independence systems")
  Member "a k 3 2 approximation algorithm for monotone submodular k set packing and general k exchange systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint")
  Member "constrained non monotone submodular maximization offline and secretary algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "submodular matroid secretary problem with shortlists")

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)