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 "eliminating the weakest link making manipulation intractable"):
  Abstract: Successive elimination of candidates is often a route to making manipulation intractable to compute. We prove that eliminating candidates does not necessarily increase the computational complexity of manipulation. However, for many voting rules used in practice, the computational complexity increases. For example, it is already known that it is NP-hard to compute how a single voter can manipulate the result of single transferable voting (the elimination version of plurality voting). We show here that it is NP-hard to compute how a single voter can manipulate the result of the elimination version of veto voting, of the closely related Coombs' rule, and of the elimination versions of a general class of scoring rules.

Includes members:
  Member "manipulation of nanson s and baldwin s rules":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "detecting possible manipulators in elections")
  Member "complexity of and algorithms for borda manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of possible winners on partial chains")
  Member "an empirical study of the manipulability of single transferable voting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deceased organ matching in australia")
  Member "complexity of terminating preference elicitation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new candidates welcome possible winners with respect to the addition of new candidates")
  Member "where are the really hard manipulation problems the phase transition in manipulating the veto rule":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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)