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 "weighted electoral control"):
  Abstract: Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important natural settings. In this paper, we study the complexity of controlling the outcome of weighted elections through adding and deleting voters. We obtain polynomial-time algorithms, NP-completeness results, and for many NP-complete cases, approximation algorithms. In particular, for scoring rules we completely characterize the complexity of weighted voter control. Our work shows that for quite a few important cases, either polynomial-time exact algorithms or polynomial-time approximation algorithms exist.

Includes members:
  Member "a control dichotomy for pure scoring rules":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "high multiplicity election problems")
  Member "possible winners in noisy elections":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "election with bribed voter uncertainty hardness and approximation algorithm")
  Member "control in the presence of manipulators cooperative and competitive cases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a parameterized perspective on protecting elections")
  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 "how many vote operations are needed to manipulate a voting system":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a smooth transition from powerlessness to absolute power")
  Member "control complexity in bucklin fallback and plurality voting an experimental approach":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity dichotomies for unweighted scoring rules")
  Member "an atypical survey of typical case heuristic algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discovering archipelagos of tractability for constraint satisfaction and counting")
  Member "new candidates welcome possible winners with respect to the addition of new candidates":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the complexity of online bribery in sequential elections extended abstract")

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)