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 "prophet secretary for combinatorial auctions and matroids"):
  Abstract: The secretary and the prophet inequality problems are central to the field of Stopping Theory. Recently, there has been a lot of work in generalizing these models to multiple items because of their applications in mechanism design. The most important of these generalizations are to matroids and to combinatorial auctions (extends bipartite matching). Kleinberg-Weinberg \cite{KW-STOC12} and Feldman et al. \cite{feldman2015combinatorial} show that for adversarial arrival order of random variables the optimal prophet inequalities give a $1/2$-approximation. For many settings, however, it's conceivable that the arrival order is chosen uniformly at random, akin to the secretary problem. For such a random arrival model, we improve upon the $1/2$-approximation and obtain $(1-1/e)$-approximation prophet inequalities for both matroids and combinatorial auctions. This also gives improvements to the results of Yan \cite{yan2011mechanism} and Esfandiari et al. \cite{esfandiari2015prophet} who worked in the special cases where we can fully control the arrival order or when there is only a single item. #R##N#Our techniques are threshold based. We convert our discrete problem into a continuous setting and then give a generic template on how to dynamically adjust these thresholds to lower bound the expected total welfare.

Includes members:
  Member "prophet inequalities made easy stochastic optimization by pricing non stochastic inputs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the power and limits of dynamic pricing in combinatorial markets")
  Member "beyond matroids secretary problem and prophet inequality with general constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "o log log rank competitive ratio for the matroid secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "a simple o log log mathrm rank competitive algorithm for the matroid secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "combinatorial auctions via posted prices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "matroid prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "predict and match prophet inequalities with uncertain supply")
  Member "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "mechanism design via correlation gap":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "prophet inequalities with linear correlations and augmentations")

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)