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 "near optimal online algorithms for dynamic resource allocation problems"):
  Abstract: In this paper, we study a general online linear programming problem whose formulation encompasses many practical dynamic resource allocation problems, including internet advertising display applications, revenue management, various routing, packing, and auction problems. We propose a model, which under mild assumptions, allows us to design near-optimal learning-based online algorithms that do not require the a priori knowledge about the total number of online requests to come, a first of its kind. We then consider two variants of the problem that relax the initial assumptions imposed on the proposed model.

Includes members:
  Member "online vertex weighted bipartite matching and single bid budgeted allocations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online graph matching problems with a worst case reassignment budget")
  Member "online stochastic matching online actions based on offline statistics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online graph matching problems with a worst case reassignment budget")
  Member "online stochastic packing applied to display ad allocation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "near optimal online algorithms and fast approximation algorithms for resource allocation problems")
  Member "a dynamic near optimal algorithm for online linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "random order models")
  Member "online stochastic matching beating 1 1 e":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online graph matching problems with a worst case reassignment budget")

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)