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 "weighted online problems with advice"):
  Abstract: Recently, the first online complexity class, AOC, was introduced. The class consists of many online problems where each request must be either accepted or rejected, and the aim is to either minimize or maximize the number of accepted requests, while maintaining a feasible solution. All AOC-complete problems (including Independent Set, Vertex Cover, Dominating Set, and Set Cover) have essentially the same advice complexity. In this paper, we study weighted versions of problems in AOC, i.e., each request comes with a weight and the aim is to either minimize or maximize the total weight of the accepted requests. In contrast to the unweighted versions, we show that there is a significant difference in the advice complexity of complete minimization and maximization problems. We also show that our algorithmic techniques for dealing with weighted requests can be extended to work for non-complete AOC problems such as maximum matching (giving better results than what follow from the general AOC results) and even non-AOC problems such as scheduling.

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 "online bounded analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "relative worst order analysis a survey")
  Member "randomization can be as helpful as a glimpse of the future in online computation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight bounds for online edge coloring")
  Member "online algorithms with advice for bin packing and scheduling problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online bin covering with advice")
  Member "advice complexity of the online induced subgraph problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "advice complexity of adaptive priority algorithms")
  Member "online makespan minimization with parallel schedules":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online scheduling with makespan minimization state of the art results research challenges and open problems")

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)