human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "evolutionary stability of reputation management system in peer to peer networks"
  Abstract: Each participant in peer-to-peer network prefers to free-ride on the contribution of other participants. Reputation based resource sharing is a way to control the free riding. Instead of classical game theory we use evolutionary game theory to analyse the reputation based resource sharing in peer to peer system. Classical game-theoretical approach requires global information of the population. However, the evolutionary games only assumes light cognitive capabilities of users, that is, each user imitates the behavior of other user with better payoff. We find that without any extra benefit reputation strategy is not stable in the system. We also find the fraction of users who calculate the reputation for controlling the free riding in equilibrium. In this work first we made a game theoretical model for the reputation system and then we calculate the threshold of the fraction of users with which the reputation strategy is sustainable in the system. We found that in simplistic conditions reputation calculation is not evolutionarily stable strategy but if we impose some initial payment to all users and then distribute that payment among the users who are calculating reputation then reputation is evolutionary stable strategy.

Question: Please tell me which class the center node 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)