human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "the complexity of controlling candidate sequential elections"
  Abstract: Candidate control of elections is the study of how adding or removing candidates can affect the outcome. However, the traditional study of the complexity of candidate control is in the model in which all candidates and votes are known up front. This paper develops a model for studying online control for elections where the structure is sequential with respect to the candidates, and in which the decision regarding adding and deleting must be irrevocably made at the moment the candidate is presented. We show that great complexity---PSPACE-completeness---can occur in this setting, but we also provide within this setting polynomial-time algorithms for the most important of election systems, plurality.

Connected through hyperedge HE-1 (induced by source paper "the complexity of online bribery in sequential elections extended abstract"):
  with members:
    - "the complexity of online bribery in sequential elections"
    - "computational social choice and computational complexity bffs"
    - "high multiplicity election problems"
    - "prices matter for the parameterized complexity of shift bribery"
    - "the complexity of online manipulation of sequential elections"
    - "the complexity of online voter control in sequential elections"
    - "new candidates welcome possible winners with respect to the addition of new candidates"
    - "equilibria of plurality voting with abstentions"

Connected through hyperedge HE-2 (induced by source paper "the complexity of online voter control in sequential elections"):
  with members:
    - "control in the presence of manipulators cooperative and competitive cases"
    - "online voter control in sequential elections"
    - "an atypical survey of typical case heuristic algorithms"
    - "the complexity of online manipulation of sequential elections"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "equilibria of plurality voting with abstentions"
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"
    - "hybrid elections broaden complexity theoretic resistance to control"

Question: Please tell me which class the center node 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)