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 voter control in sequential elections"):
  Abstract: Previous work on voter control, which refers to situations where a chair seeks to change the outcome of an election by deleting, adding, or partitioning voters, takes for granted that the chair knows all the voters' preferences and that all votes are cast simultaneously. However, elections are often held sequentially and the chair thus knows only the previously cast votes and not the future ones, yet needs to decide instantaneously which control action to take. We introduce a framework that models online voter control in sequential elections. We show that the related problems can be much harder than in the standard (non-online) case: For certain election systems, even with efficient winner problems, online control by deleting, adding, or partitioning voters is PSPACE-complete, even if there are only two candidates. In addition, we obtain (by a new characterization of coNP in terms of weight-bounded alternating Turing machines) completeness for coNP in the deleting/adding cases with a bounded deletion/addition limit, and we obtain completeness for NP in the partition cases with an additional restriction. We also show that for plurality, online control by deleting or adding voters is in P, and for partitioning voters is coNP-hard.

Includes members:
  Member "control in the presence of manipulators cooperative and competitive cases":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a parameterized perspective on protecting elections")
  Member "the complexity of controlling candidate sequential elections":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of online bribery in sequential elections extended abstract")
  Member "online voter control in sequential elections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computational social choice and computational complexity bffs")
  Member "an atypical survey of typical case heuristic algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "discovering archipelagos of tractability for constraint satisfaction and counting")
  Member "the complexity of online manipulation of sequential elections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of online bribery in sequential elections extended abstract")
  Member "the complexity of manipulative attacks in nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "equilibria of plurality voting with abstentions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sybil resilient social choice with partial participation")
  Member "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a parameterized perspective on protecting elections")

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)