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 "the complexity of online bribery in sequential elections extended abstract"):
  Abstract: Prior work on the complexity of bribery assumes that the bribery happens simultaneously, and that the briber has full knowledge of all voters' votes. But neither of those assumptions always holds. In many real-world settings, votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to bribe/alter a given vote, and at the time of making that decision, the briber may not know what votes remaining voters are planning on casting. #R##N#In this paper, we introduce a model for, and initiate the study of, bribery in such an online, sequential setting. We show that even for election systems whose winner-determination problem is polynomial-time computable, an online, sequential setting may vastly increase the complexity of bribery, in fact jumping the problem up to completeness for high levels of the polynomial hierarchy or even PSPACE. On the other hand, we show that for some natural, important election systems, such a dramatic complexity increase does not occur, and we pinpoint the complexity of their bribery problems in the online, sequential setting.

Includes members:
  Member "the complexity of online bribery in sequential elections":
    also connected through other hyperedges:
      (none)
  Member "computational social choice and computational complexity bffs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of splitting necklaces and bisecting ham sandwiches")
  Member "high multiplicity election problems":
    also connected through other hyperedges:
      (none)
  Member "prices matter for the parameterized complexity of shift bribery":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal bribery in voting")
  Member "the complexity of controlling candidate sequential elections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of online voter control in sequential elections")
  Member "the complexity of online manipulation of sequential elections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computational social choice and computational complexity bffs")
  Member "the complexity of online voter control in sequential elections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of controlling candidate sequential elections")
  Member "new candidates welcome possible winners with respect to the addition of new candidates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "weighted electoral control")

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.GT(Computer Science and Game Theory)