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: "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control"
  Abstract: Schulze and ranked-pairs elections have received much attention recently, and the former has quickly become a quite widely used election system. For many cases these systems have been proven resistant to bribery, control, or manipulation, with ranked pairs being particularly praised for being NP-hard for all three of those. Nonetheless, the present paper shows that with respect to the number of candidates, Schulze and ranked-pairs elections are fixed-parameter tractable to bribe, control, and manipulate: we obtain uniform, polynomial-time algorithms whose degree does not depend on the number of candidates. We also provide such algorithms for some weighted variants of these problems.

Connected through hyperedge HE-1 (induced by source paper "the schulze method of voting"):
  with members:
    - "approval based elections and distortion of voting rules"
    - "a note on the complexity of manipulating weighted schulze voting"
    - "the expanding approvals rule improving proportional representation and monotonicity"
    - "the flow network method"
    - "metric distortion of social choice rules lower bounds and fairness properties"
    - "fault tolerant entity resolution with the crowd"
    - "choosing by means of approval preferential voting the revised approval choice"
    - "how hard is it to control an election by breaking ties"

Connected through hyperedge HE-2 (induced by source paper "on the computational complexity of variants of combinatorial voter control in elections"):
  with members:
    - "elections with few voters candidate control can be easy"
    - "parameterized algorithmics for computational social choice nine research challenges"
    - "combinatorial voter control in elections"
    - "weighted electoral control"
    - "multimode control attacks on elections"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-3 (induced by source paper "combinatorial voter control in elections"):
  with members:
    - "prices matter for the parameterized complexity of shift bribery"
    - "elections with few voters candidate control can be easy"
    - "more natural models of electoral control by partition"
    - "weighted electoral control"
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "clone structures in voters preferences"
    - "multimode control attacks on elections"

Connected through hyperedge HE-4 (induced by source paper "elections with few voters candidate control can be easy"):
  with members:
    - "prices matter for the parameterized complexity of shift bribery"
    - "more natural models of electoral control by partition"
    - "combinatorial voter control in elections"
    - "control complexity in bucklin and fallback voting"
    - "multimode control attacks on elections"
    - "normalized range voting broadly resists control"
    - "multivariate complexity analysis of swap bribery"
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"

Connected through hyperedge HE-5 (induced by source paper "election attacks with few candidates"):
  with members:
    - "coalitional manipulation for schulze s rule"
    - "weighted electoral control"
    - "a smooth transition from powerlessness to absolute power"
    - "multimode control attacks on elections"
    - "is computational complexity a barrier to manipulation"
    - "multivariate complexity analysis of swap bribery"
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"

Connected through hyperedge HE-6 (induced by source paper "solving hard control problems in voting systems via integer programming"):
  with members:
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "cloning in elections finding the possible winners"
    - "multimode control attacks on elections"
    - "is computational complexity a barrier to manipulation"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-7 (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"
    - "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"
    - "the complexity of manipulative attacks in nearly single peaked electorates"

Connected through hyperedge HE-8 (induced by source paper "search versus decision for election manipulation problems"):
  with members:
    - "existence versus exploitation the opacity of backbones and backdoors under a weak assumption"
    - "computational social choice and computational complexity bffs"
    - "the opacity of backbones"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "multimode control attacks on elections"
    - "normalized range voting broadly resists control"
    - "control complexity in fallback voting"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and 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)