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 "on the limitations of deterministic de randomizations for online bipartite matching and max sat"):
  Abstract: The surprising results of Karp, Vazirani and Vazirani and (respectively) Buchbinder et al are examples where rather simple randomizations provide provably better approximations than the corresponding deterministic counterparts for online bipartite matching and (respectively) unconstrained non-monotone submodular maximization. We show that seemingly strong extensions of the deterministic online computation model can at best match the performance of naive randomization. More specifically, for bipartite matching, we show that in the priority model (allowing very general ways to order the input stream), we cannot improve upon the trivial 1/2-approximation achieved by any greedy maximal matching algorithm and likewise cannot improve upon this approximation by any log n/log log n number of online algorithms running in parallel. The latter result yields an improved log log n - log log log n lower bound for the number of advice bits needed. For max-sat, we adapt the recent de-randomization approach of Buchbinder and Feldman applied to the Buchbinbder et al algorithm for max-sat to obtain a deterministic 3/4-approximation algorithm using width 2n parallelism. In order to improve upon this approximation, we show that exponential width parallelism of online algorithms is necessary (in a model that is more general than what is needed for the width 2n algorithm).

Includes members:
  Member "on the power of advice and randomization for online bipartite matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online bin covering with advice")
  Member "randomization can be as helpful as a glimpse of the future in online computation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tight bounds for online edge coloring")
  Member "deterministic algorithms for submodular maximization problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the unreasonable effectiveness of the greedy algorithm greedy adapts to sharpness")
  Member "greedy matching guarantees and limitations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "advice complexity of adaptive priority algorithms")
  Member "online vertex weighted bipartite matching and single bid budgeted allocations":
    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)