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 simple o log log mathrm rank competitive algorithm for the matroid secretary problem"):
  Abstract: Only recently progress has been made in obtaining $o(\log(\mathrm{rank}))$-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a $O(\sqrt{\log(\mathrm{rank})})$-competitive procedure, and Lachish (2014) later presented a $O(\log\log(\mathrm{rank}))$-competitive algorithm. Both these algorithms and their analyses are very involved, which is also reflected in the extremely high constants in their competitive ratios. #R##N#Using different tools, we present a considerably simpler $O(\log\log(\mathrm{rank}))$-competitive algorithm for the matroid secretary problem. Our algorithm can be interpreted as a distribution over a simple type of matroid secretary algorithms which are easy to analyze. Due to the simplicity of our procedure, we are also able to vastly improve on the hidden constant in the competitive ratio.

Includes members:
  Member "prophet inequalities with limited information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "advances on matroid secretary problems free order model and laminar case":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "strong algorithms for the ordinal matroid secretary problem")
  Member "matroid secretary for regular and decomposable matroids":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "strong algorithms for the ordinal matroid secretary problem")
  Member "on variants of the matroid secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "strong algorithms for the ordinal matroid secretary problem")
  Member "secretary problems with convex costs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online learning for min max discrete problems")
  Member "the simulated greedy algorithm for several submodular matroid secretary problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an improved algorithm for the submodular secretary problem with a cardinality constraint")
  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")
  Member "matroid secretary problem in the random assignment model":
    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)