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 "is computational complexity a barrier to manipulation"):
  Abstract: When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballot and use a voting rule to decide the winning action(s). Unfortunately, agents may try to manipulate such an election by misreporting their preferences. Fortunately, it has been shown that it is NP-hard to compute how to manipulate a number of different voting rules. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. To address this issue, I suggest studying empirically if computational complexity is in practice a barrier to manipulation. The basic tool used in my investigations is the identification of computational "phase transitions". Such an approach has been fruitful in identifying hard instances of propositional satisfiability and other NP-hard problems. I show that phase transition behaviour gives insight into the hardness of manipulating voting rules, increasing concern that computational complexity is indeed any sort of barrier. Finally, I look at the problem of computing manipulation of other, related problems like stable marriage and tournament problems.

Includes members:
  Member "dominating manipulations in voting with partial information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distance based equilibria in normal form games")
  Member "manipulation of nanson s and baldwin s rules":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "detecting possible manipulators in elections")
  Member "complexity of and algorithms for borda manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of possible winners on partial chains")
  Member "an empirical study of borda manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "control complexity in bucklin fallback and plurality voting an experimental approach")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "an empirical study of the manipulability of single transferable voting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deceased organ matching in australia")
  Member "where are the hard manipulation problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lie on the fly strategic voting in an iterative preference elicitation process")
  Member "manipulation and gender neutrality in stable marriage procedures":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "coalition manipulations of the gale shapley algorithm")

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)