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 "the complexity of manipulative attacks in nearly single peaked electorates"):
  Abstract: Many electoral bribery, control, and manipulation problems (which we will refer to in general as "manipulative actions" problems) are NP-hard in the general case. It has recently been noted that many of these problems fall into polynomial time if the electorate is single-peaked (i.e., is polarized along some axis/issue). However, real-world electorates are not truly single-peaked. There are usually some mavericks, and so real-world electorates tend to merely be nearly single-peaked. This paper studies the complexity of manipulative-action algorithms for elections over nearly single-peaked electorates, for various notions of nearness and various election systems. We provide instances where even one maverick jumps the manipulative-action complexity up to $\np$-hardness, but we also provide many instances where a reasonable number of mavericks can be tolerated without increasing the manipulative-action complexity.

Includes members:
  Member "are there any nicely structured preference profiles nearby":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "weighted electoral control":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "selecting voting locations for fun and profit")
  Member "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the schulze method of voting")
  Member "search versus decision for election manipulation problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the power of self reducibility selectivity information and approximation")
  Member "an atypical survey of typical case heuristic algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "discovering archipelagos of tractability for constraint satisfaction and counting")
  Member "clone structures in voters preferences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "cloning in elections finding the possible winners":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "attacking power indices by manipulating player reliability")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")

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.GT(Computer Science and Game Theory)