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 "optimal single choice prophet inequalities from samples"):
  Abstract: We study the single-choice Prophet Inequality problem when the gambler is given access to samples. We show that the optimal competitive ratio of $1/2$ can be achieved with a single sample from each distribution. When the distributions are identical, we show that for any constant $\varepsilon > 0$, $O(n)$ samples from the distribution suffice to achieve the optimal competitive ratio ($\approx 0.745$) within $(1+\varepsilon)$, resolving an open problem of Correa, Dutting, Fischer, and Schewior.

Includes members:
  Member "prophet inequality for bipartite matching merits of being simple and non adaptive":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models")
  Member "prophet secretary through blind strategies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "nearly optimal pricing algorithms for production constrained and laminar bayesian selection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight revenue gaps among simple mechanisms")
  Member "random order contention resolution schemes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the outer limits of contention resolution on matroids and connections to the secretary problem")
  Member "prophet secretary surpassing the 1 1 e barrier":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "pricing for online resource allocation intervals and paths":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the power and limits of dynamic pricing in combinatorial markets")
  Member "prophet secretary for combinatorial auctions and matroids":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "combinatorial prophet inequalities":
    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)