human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "how hard is it to control an election by breaking ties"):
  Abstract: We study the computational complexity of controlling the result of an election by breaking ties strategically. This problem is equivalent to the problem of deciding the winner of an election under parallel universes tie-breaking. When the chair of the election is only asked to break ties to choose between one of the co-winners, the problem is trivially easy. However, in multi-round elections, we prove that it can be NP-hard for the chair to compute how to break ties to ensure a given result. Additionally, we show that the form of the tie-breaking function can increase the opportunities for control. Indeed, we prove that it can be NP-hard to control an election by breaking ties even with a two-stage voting rule.

Includes members:
  Member "control complexity in bucklin fallback and plurality voting an experimental approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity dichotomies for unweighted scoring rules")
  Member "eliminating the weakest link making manipulation intractable":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")
  Member "determining possible and necessary winners under common voting rules given partial orders":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of possible winners on partial chains")
  Member "manipulation of nanson s and baldwin s rules":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "detecting possible manipulators in elections")
  Member "an empirical study of the manipulability of single transferable voting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deceased organ matching in australia")
  Member "where are the really hard manipulation problems the phase transition in manipulating the veto rule":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deceased organ matching in australia")
  Member "universal voting protocol tweaks to make manipulation hard":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure voting protocols with perfect ballot secrecy")

Question: Please tell me which class the source paper 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.AI(Artificial Intelligence)