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: "election attacks with few candidates"
  Abstract: We investigate the parameterized complexity of strategic behaviors in generalized scoring rules. In particular, we prove that the manipulation, control (all the 22 standard types), and bribery problems are fixed-parameter tractable for most of the generalized scoring rules, with respect to the number of candidates. Our results imply that all these strategic voting problems are fixed-parameter tractable for most of the common voting rules, such as Plurality, r-Approval, Borda, Copeland, Maximin, Bucklin, etc., with respect to the number of candidates.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting"):
  with members:
    - "monotonicity axioms in approval based multi winner voting rules"
    - "complexity of shift bribery in committee elections"
    - "structure in dichotomous preferences"
    - "elections with few voters candidate control can be easy"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"

Connected through hyperedge HE-2 (induced by source paper "kernelization complexity of possible winner and coalitional manipulation problems in voting"):
  with members:
    - "prices matter for the parameterized complexity of shift bribery"
    - "parameterized algorithmics for computational social choice nine research challenges"
    - "exact algorithms for weighted and unweighted borda manipulation problems"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "multivariate complexity analysis of swap bribery"
    - "towards a dichotomy of finding possible winners in elections based on scoring rules"

Connected through hyperedge HE-3 (induced by source paper "the control complexity of r approval from the single peaked case to the general case"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "are there any nicely structured preference profiles nearby"
    - "facility location with double peaked preference"
    - "kernelization complexity of possible winner and coalitional manipulation problems in voting"
    - "computational aspects of multi winner approval voting"
    - "the complexity of fully proportional representation for single crossing electorates"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "the complexity of manipulating k approval elections"

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)