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 "online matroid intersection beating half for random arrival"):
  Abstract: For two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ defined on the same ground set $E$, the online matroid intersection problem is to design an algorithm that constructs a large common independent set in an online fashion. The algorithm is presented with the ground set elements one-by-one in a uniformly random order. At each step, the algorithm must irrevocably decide whether to pick the element, while always maintaining a common independent set. While the natural greedy algorithm---pick an element whenever possible---is half competitive, nothing better was previously known; even for the special case of online bipartite matching in the edge arrival model. We present the first randomized online algorithm that has a $\frac12 + \delta$ competitive ratio in expectation, where $\delta >0$ is a constant. The expectation is over the random order and the coin tosses of the algorithm. As a corollary, we also obtain the first linear time algorithm that beats half competitiveness for offline matroid intersection.

Includes members:
  Member "online submodular welfare maximization greedy beats 1 2 in random order":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")
  Member "a faster cutting plane method and its implications for combinatorial and convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sketching transformed matrices with applications to natural language processing")
  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 "ranking on arbitrary graphs rematch via continuous lp with monotone and boundary condition constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online vertex weighted bipartite matching beating 1 1 e with random arrivals")
  Member "better bounds for matchings in the streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams")
  Member "matroid prophet inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "predict and match prophet inequalities with uncertain supply")
  Member "improved bounds for online preemptive matching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "prophet inequality for bipartite matching merits of being simple and non adaptive")

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)