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 "where are the hard manipulation problems"):
  Abstract: One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is increasing concern that such results may not re ect the difficulty of manipulation in practice. In this tutorial, I survey recent results in this area.

Includes members:
  Member "complexity of and algorithms for borda manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "deceased organ matching in australia")
  Member "manipulation and gender neutrality in stable marriage procedures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coalition manipulations of the gale shapley algorithm")
  Member "the shield that never was societies with single peaked preferences are more open to manipulation and control":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "complexity of terminating preference elicitation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "eliminating the weakest link making manipulation intractable")
  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 "dealing with incomplete agents preferences and an uncertain agenda in group decision making via sequential majority voting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "is computational complexity a barrier to manipulation")
  Member "manipulating tournaments in cup and round robin competitions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "refining tournament solutions via margin of victory")

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)