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 "an improved algorithm for the submodular secretary problem with a cardinality constraint"):
  Abstract: We study the submodular secretary problem with a cardinality constraint. In this problem, $n$ candidates for secretaries appear sequentially in random order. At the arrival of each candidate, a decision maker must irrevocably decide whether to hire him. The decision maker aims to hire at most $k$ candidates that maximize a non-negative submodular set function. We propose an $(\mathrm{e} - 1)^2 / (\mathrm{e}^2 (1 + \mathrm{e}))$-competitive algorithm for this problem, which improves the best one known so far.

Includes members:
  Member "combinatorial prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "constrained submodular maximization via a non symmetric technique":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "non monotone submodular maximization with nearly optimal adaptivity and query complexity")
  Member "submodular secretary problems cardinality matching and linear constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "building a good team secretary problems and the supermodular degree":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "beyond submodular maximization")
  Member "the submodular secretary problem goes linear":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "the simulated greedy algorithm for several submodular matroid secretary problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "strong algorithms for the ordinal matroid secretary problem")
  Member "constrained non monotone submodular maximization offline and secretary algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)