human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "prophet inequalities with linear correlations and augmentations"):
  with members:
    - "robust algorithms for the secretary problem"
    - "prophet secretary through blind strategies"
    - "stochastic bandits robust to adversarial corruptions"
    - "optimal online contention resolution schemes via ex ante prophet inequalities"
    - "prophet secretary surpassing the 1 1 e barrier"
    - "robustly learning a gaussian getting optimal error efficiently"
    - "prophet secretary for combinatorial auctions and matroids"
    - "online allocation with traffic spikes mixing adversarial and stochastic models"

Connected through hyperedge HE-2 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models"):
  with members:
    - "beating greedy for stochastic bipartite matching"
    - "online stochastic matching with edge arrivals"
    - "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint"
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "prophet inequality for bipartite matching merits of being simple and non adaptive"
    - "tight competitive ratios of classic matching algorithms in the fully online model"
    - "how to match when all vertices arrive online"
    - "prophets and secretaries with overbooking"

Connected through hyperedge HE-3 (induced by source paper "efficient two sided markets with limited information"):
  with members:
    - "bulow klemperer style results for welfare maximization in two sided markets"
    - "improved truthful mechanisms for combinatorial auctions with submodular bidders"
    - "online trading as a secretary problem"
    - "the best of both worlds asymptotically efficient mechanisms with a guarantee on the expected gains from trade"
    - "approximating gains from trade in two sided markets via simple mechanisms"
    - "fixed price approximability of the optimal gain from trade"
    - "online market intermediation"
    - "sbba a strongly budget balanced double auction mechanism"

Question: Please tell me which class the center node 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)