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 stochastic packing applied to display ad allocation"):
  Abstract: Inspired by online ad allocation, we study online stochastic packing linear programs from theoretical and practical standpoints. We first present a near-optimal online algorithm for a general class of packing linear programs which model various online resource allocation problems including online variants of routing, ad allocations, generalized assignment, and combinatorial auctions. As our main theoretical result, we prove that a simple primal-dual training-based algorithm achieves a (1 - o(1))-approximation guarantee in the random order stochastic model. This is a significant improvement over logarithmic or constant-factor approximations for the adversarial variants of the same problems (e.g. factor 1 - 1/e for online ad allocation, and \log m for online routing). We then focus on the online display ad allocation problem and study the efficiency and fairness of various training-based and online allocation algorithms on data sets collected from real-life display ad allocation system. Our experimental evaluation confirms the effectiveness of training-based primal-dual algorithms on real data sets, and also indicate an intrinsic trade-off between fairness and efficiency.

Includes members:
  Member "sequential posted pricing and multi parameter mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal auctions vs anonymous pricing beyond linear utility")
  Member "a dynamic near optimal algorithm for online linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "random order models")
  Member "bidding for representative allocations for display advertising":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "toward controlling discrimination in online ad auctions")
  Member "on allocating goods to maximize fairness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "weighted completion time minimization for unrelated machines via iterative fair contention resolution")
  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")
  Member "algorithms for secretary problems on graphs and hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random order models")

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)