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 "search versus decision for election manipulation problems"):
  Abstract: Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for manipulators, that definitional focus may be misguided if these two complexities can differ. Our main result is that they probably do differ: If integer factoring is hard, then for election manipulation, election bribery, and some types of election control, there are election systems for which recognizing which instances can be successfully manipulated is in polynomial time but producing the successful manipulations cannot be done in polynomial time.

Includes members:
  Member "existence versus exploitation the opacity of backbones and backdoors under a weak assumption":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the power of self reducibility selectivity information and approximation")
  Member "computational social choice and computational complexity bffs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of online bribery in sequential elections extended abstract")
  Member "the opacity of backbones":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the power of self reducibility selectivity information and approximation")
  Member "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the schulze method of voting")
  Member "the complexity of manipulative attacks in nearly single peaked electorates":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "normalized range voting broadly resists control":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a parameterized perspective on protecting elections")
  Member "control complexity in fallback voting":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a parameterized perspective on protecting elections")

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)