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: "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 \emph{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 completeness for coNP in the deleting/adding cases with a bounded deletion/addition limit, and for NP in the partition cases with only one candidate. Finally, we show that for plurality, online control by deleting or adding voters is in P, and for partitioning voters is coNP-hard.

Connected through hyperedge HE-1 (induced by source paper "computational social choice and computational complexity bffs"):
  with members:
    - "consensus halving is ppa complete"
    - "the complexity of online manipulation of sequential elections"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "a richer understanding of the complexity of election systems"
    - "raising np lower bounds to parallel np lower bounds"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-2 (induced by source paper "control in the presence of manipulators cooperative and competitive cases"):
  with members:
    - "x then x manipulation of same system runoff elections"
    - "an atypical survey of typical case heuristic algorithms"
    - "the complexity of online manipulation of sequential elections"
    - "new candidates welcome possible winners with respect to the addition of new candidates"
    - "multimode control attacks on elections"
    - "normalized range voting broadly resists control"
    - "control complexity in fallback voting"
    - "where are the really hard manipulation problems the phase transition in manipulating the veto rule"

Connected through hyperedge HE-3 (induced by source paper "the complexity of controlling candidate sequential elections"):
  with members:
    - "control in the presence of manipulators cooperative and competitive cases"
    - "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"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "multimode control attacks on elections"
    - "normalized range voting broadly resists control"
    - "equilibria of plurality voting with abstentions"

Connected through hyperedge HE-4 (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"
    - "the complexity of controlling candidate 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"

Connected through hyperedge HE-5 (induced by source paper "the complexity of online manipulation of sequential elections"):
  with members:
    - "an atypical survey of typical case heuristic algorithms"
    - "new candidates welcome possible winners with respect to the addition of new candidates"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "taking the final step to a full dichotomy of the possible winner problem in pure scoring rules"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"
    - "equilibria of plurality voting with abstentions"
    - "towards a dichotomy of finding possible winners in elections based on scoring rules"
    - "a richer understanding of the complexity of election systems"

Connected through hyperedge HE-6 (induced by source paper "control complexity in bucklin and fallback voting"):
  with members:
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "the complexity of online manipulation of sequential elections"
    - "complexity of and algorithms for borda manipulation"
    - "multimode control attacks on elections"
    - "bucklin voting is broadly resistant to control"
    - "normalized range voting broadly resists control"
    - "control complexity in fallback voting"
    - "an empirical study of the manipulability of single transferable voting"

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)