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 "o log log rank competitive ratio for the matroid secretary problem"):
  Abstract: In the \textit{Matroid Secretary Problem} (MSP), the elements of the ground set of a Matroid are revealed on-line one by one, each together with its value. An algorithm for the MSP is \textit{Matroid-Unknown} if, at every stage of its execution: (i) it only knows the elements that have been revealed so far and their values, and (ii) it has access to an oracle for testing whether or not any subset of the elements that have been revealed so far is an independent set. An algorithm is \textit{Known-Cardinality} if, in addition to (i) and (ii), it also initially knows the cardinality of the ground set of the Matroid. We present here a Known-Cardinality and \textit{Order-Oblivious} algorithm that, with constant probability, selects an independent set of elements, whose value is at least the optimal value divided by $O(\log{\log{\rho}})$, where $\rho$ is the rank of the Matroid; that is, the algorithm has a \textit{competitive-ratio} of $O(\log{\log{\rho}})$. The best previous results for a Known-Cardinality algorithm are a competitive-ratio of $O(\log{\rho})$, by Babaioff \textit{et al.} (2007), and a competitive-ratio of $O(\sqrt{\log{\rho}})$, by Chakraborty and Lachish (2012). In many non-trivial cases the algorithm we present has a competitive-ratio that is better than the $O(\log{\log{\rho}})$. The cases in which it fails to do so are easily characterized. Understanding these cases may lead to improved algorithms for the problem or, conversely, to non-trivial lower bounds.

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 "constrained non monotone submodular maximization offline and secretary algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "algorithms for secretary problems on graphs and hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "random order models")

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)