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 "a richer understanding of the complexity of election systems"):
  Abstract: We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.

Includes members:
  Member "hybrid elections broaden complexity theoretic resistance to control":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a parameterized perspective on protecting elections")
  Member "dichotomy for voting systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of online bribery in sequential elections")
  Member "anyone but him the complexity of precluding an alternative":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "selecting voting locations for fun and profit")
  Member "guarantees for the success frequency of an algorithm for finding dodgson election winners":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "achieving fully proportional representation approximability results")
  Member "how many candidates are needed to make elections hard to manipulate":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards computing victory margins in stv elections")
  Member "complexity of manipulating elections with few candidates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "often harder than in the constructive case destructive bribery in cp nets")
  Member "exact complexity of the winner problem for young elections":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "incomplete preferences in single peaked electorates")
  Member "raising np lower bounds to parallel np lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "computational social choice and computational complexity bffs")

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)