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 online contention resolution schemes via ex ante prophet inequalities"):
  Abstract: Online contention resolution schemes (OCRSs) were proposed by Feldman, Svensson, and Zenklusen as a generic technique to round a fractional solution in the matroid polytope in an online fashion. It has found applications in several stochastic combinatorial problems where there is a commitment constraint: on seeing the value of a stochastic element, the algorithm has to immediately and irrevocably decide whether to select it while always maintaining an independent set in the matroid. Although OCRSs immediately lead to prophet inequalities, these prophet inequalities are not optimal. Can we instead use prophet inequalities to design optimal OCRSs? #R##N#We design the first optimal $1/2$-OCRS for matroids by reducing the problem to designing a matroid prophet inequality where we compare to the stronger benchmark of an ex-ante relaxation. We also introduce and design optimal $(1-1/e)$-random order CRSs for matroids, which are similar to OCRSs but the arrival is chosen uniformly at random.

Includes members:
  Member "random order contention resolution schemes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal single choice prophet inequalities from samples")
  Member "prophet secretary surpassing the 1 1 e barrier":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "understanding the correlation gap for matchings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint")
  Member "a stochastic probing problem with applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning optimal search algorithms from data")
  Member "matroid prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "submodular function maximization via the multilinear relaxation and contention resolution schemes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model")
  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)