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 "attacking power indices by manipulating player reliability"):
  Abstract: We investigate the manipulation of power indices in TU-cooperative games by stimulating (subject to a budget constraint) changes in the propensity of other players to participate to the game. #R##N#We display several algorithms that show that the problem is often tractable for so-called network centrality games and influence attribution games, as well as an example when optimal manipulation is intractable, even though computing power indices is feasible.

Includes members:
  Member "h α an index to quantify an individual s scientific leadership":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "does the h α index reinforce the matthew effect in science agent based simulations using stata and r")
  Member "prestige drives epistemic inequality in the diffusion of scientific ideas":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "venue analytics a simple alternative to citation based metrics")
  Member "hiding individuals and communities in a social network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")
  Member "game theoretic network centrality a review":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximizing influence based group shapley centrality")
  Member "cooperative games with bounded dependency degree":
    also connected through other hyperedges:
      (none)
  Member "efficient computation of the shapley value for game theoretic network centrality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning to resolve alliance dilemmas in many player zero sum games")
  Member "solving cooperative reliability games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robustness against agent failure in hedonic games")
  Member "false name manipulations in weighted voting games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "weighted electoral control")

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)