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 "manipulating elections by selecting issues"):
  Abstract: Constructive election control considers the problem of an adversary who seeks to sway the outcome of an electoral process in order to ensure that their favored candidate wins. We consider the computational problem of constructive election control via issue selection. In this problem, a party decides which political issues to focus on to ensure victory for the favored candidate. We also consider a variation in which the goal is to maximize the number of voters supporting the favored candidate. We present strong negative results, showing, for example, that the latter problem is inapproximable for any constant factor. On the positive side, we show that when issues are binary, the problem becomes tractable in several cases, and admits a 2-approximation in the two-candidate case. Finally, we develop integer programming and heuristic methods for these problems.

Includes members:
  Member "hotelling downs model with limited attraction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hotelling games with random tolerance intervals")
  Member "randomized social choice functions under metric preferences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "how good is a two party election game")
  Member "normalized range voting broadly resists control":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a parameterized perspective on protecting elections")
  Member "control complexity in fallback voting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a parameterized perspective on protecting elections")
  Member "the complexity of probabilistic lobbying":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal bribery in voting")
  Member "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a parameterized perspective on protecting elections")
  Member "how hard is bribery in elections":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "selecting voting locations for fun and profit")
  Member "hybrid elections broaden complexity theoretic resistance to control":
    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)