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 "false name manipulation in weighted voting games is hard for probabilistic polynomial time"):
  Abstract: False-name manipulation refers to the question of whether a player in a weighted voting game can increase her power by splitting into several players and distributing her weight among these false identities. Analogously to this splitting problem, the beneficial merging problem asks whether a coalition of players can increase their power in a weighted voting game by merging their weights. Aziz et al. [ABEP11] analyze the problem of whether merging or splitting players in weighted voting games is beneficial in terms of the Shapley-Shubik and the normalized Banzhaf index, and so do Rey and Rothe [RR10] for the probabilistic Banzhaf index. All these results provide merely NP-hardness lower bounds for these problems, leaving the question about their exact complexity open. For the Shapley--Shubik and the probabilistic Banzhaf index, we raise these lower bounds to hardness for PP, "probabilistic polynomial time", and provide matching upper bounds for beneficial merging and, whenever the number of false identities is fixed, also for beneficial splitting, thus resolving previous conjectures in the affirmative. It follows from our results that beneficial merging and splitting for these two power indices cannot be solved in NP, unless the polynomial hierarchy collapses, which is considered highly unlikely.

Includes members:
  Member "the computational complexity of random serial dictatorship":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounded incentives in manipulating the probabilistic serial rule")
  Member "false name manipulations in weighted voting games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "attacking power indices by manipulating player reliability")
  Member "false name manipulations in weighted voting games splitting merging and annexation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "weighted voting on the blockchain improving consensus in proof of stake protocols")
  Member "the cost of stability in coalitional games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing the value of spatio temporal data in wholesale and retail data marketplaces")
  Member "the computational complexity of probabilistic planning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a rate distortion framework for explaining neural network decisions")
  Member "the complexity of planar counting problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who witnesses the witness finding witnesses in the witness is hard and sometimes impossible")

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)