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: "a richer understanding of the complexity of election systems"
  Abstract: We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.

Connected through hyperedge HE-1 (induced by source paper "computational social choice and computational complexity bffs"):
  with members:
    - "consensus halving is ppa complete"
    - "online voter control in sequential elections"
    - "the complexity of online manipulation of sequential elections"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "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 "k majority digraphs and the hardness of voting with a constant number of voters"):
  with members:
    - "elections with few voters candidate control can be easy"
    - "a tournament of order 24 with two disjoint teq retentive sets"
    - "practical graph isomorphism ii"
    - "automated search for impossibility theorems in social choice theory ranking sets of objects"

Connected through hyperedge HE-3 (induced by source paper "on the hardness of bribery variants in voting with cp nets"):
  with members:
    - "campaign management under approval driven voting rules"
    - "k best enumeration"
    - "how hard is it to control an election by breaking ties"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"
    - "approximation algorithms for campaign management"
    - "multivariate complexity analysis of swap bribery"
    - "how hard is bribery in elections"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"

Connected through hyperedge HE-4 (induced by source paper "on choosing committees based on approval votes in the presence of outliers"):
  with members:
    - "sample complexity for winner prediction in elections"
    - "ptas for minimax approval voting"
    - "justified representation in approval based committee voting"
    - "on approximating string selection problems with outliers"
    - "multimode control attacks on elections"
    - "anyone but him the complexity of precluding an alternative"
    - "exact complexity of the winner problem for young elections"

Connected through hyperedge HE-5 (induced by source paper "often harder than in the constructive case destructive bribery in cp nets"):
  with members:
    - "on the hardness of bribery variants in voting with cp nets"
    - "how hard is bribery in elections"
    - "anyone but him the complexity of precluding an alternative"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"
    - "how many candidates are needed to make elections hard to manipulate"
    - "complexity of manipulating elections with few candidates"

Connected through hyperedge HE-6 (induced by source paper "weighted electoral control"):
  with members:
    - "a control dichotomy for pure scoring rules"
    - "possible winners in noisy elections"
    - "control in the presence of manipulators cooperative and competitive cases"
    - "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control"
    - "how many vote operations are needed to manipulate a voting system"
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "an atypical survey of typical case heuristic algorithms"
    - "new candidates welcome possible winners with respect to the addition of new candidates"

Connected through hyperedge HE-7 (induced by source paper "complexity of manipulation bribery and campaign management in bucklin and fallback voting"):
  with members:
    - "prices matter for the parameterized complexity of shift bribery"
    - "campaign management under approval driven voting rules"
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "control complexity in bucklin and fallback voting"
    - "complexity of and algorithms for borda manipulation"
    - "normalized range voting broadly resists control"
    - "control complexity in fallback voting"

Connected through hyperedge HE-8 (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"
    - "online voter control in sequential 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"

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)