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 "approximation and hardness of shift bribery"):
  Abstract: In the Shift-Bribery problem we are given an election, a preferred candidate, and the costs of shifting this preferred candidate up the voters' preference orders. The goal is to find such a set of shifts that ensures that the preferred candidate wins the election. We give the first polynomial-time approximation scheme for the Shift-Bribery problem for the case of positional scoring rules, and for the Copeland rule we show strong inapproximability results.

Includes members:
  Member "from gap eth to fpt inapproximability clique dominating set and more":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized inapproximability for steiner orientation by gap amplification")
  Member "almost polynomial ratio eth hardness of approximating densest k subgraph":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimizing item and subgroup configurations for social aware vr shopping")
  Member "a birthday repetition theorem and complexity of approximating dense csps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized inapproximability for steiner orientation by gap amplification")
  Member "prices matter for the parameterized complexity of shift bribery":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal bribery in voting")
  Member "campaign management under approval driven voting rules":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "committee selection with attribute level preferences")
  Member "the constant inapproximability of the parameterized dominating set problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "trapping problem on star type graphs with applications")
  Member "the complexity of probabilistic lobbying":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal bribery in voting")
  Member "how hard is bribery in elections":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "selecting voting locations for fun and profit")

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)