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: "benevolent characteristics promote cooperative behaviour among humans"
  Abstract: Cooperation is fundamental to the evolution of human society. We regularly observe cooperative behaviour in everyday life and in controlled experiments with anonymous people, even though standard economic models predict that they should deviate from the collective interest and act so as to maximise their own individual payoff. However, there is typically heterogeneity across subjects: some may cooperate, while others may not. Since individual factors promoting cooperation could be used by institutions to indirectly prime cooperation, this heterogeneity raises the important question of who these cooperators are. We have conducted a series of experiments to study whether benevolence, defined as a unilateral act of paying a cost to increase the welfare of someone else beyond one's own, is related to cooperation in a subsequent one-shot anonymous Prisoner's dilemma. Contrary to the predictions of the widely used inequity aversion models, we find that benevolence does exist and a large majority of people behave this way. We also find benevolence to be correlated with cooperative behaviour. Finally, we show a causal link between benevolence and cooperation: priming people to think positively about benevolent behaviour makes them significantly more cooperative than priming them to think malevolently. Thus benevolent people exist and cooperate more.

Connected through hyperedge HE-1 (induced by source paper "translucent players explaining cooperative behavior in social dilemmas"):
  with members:
    - "algorithmic rationality game theory with costly computation"
    - "group size effect on cooperation in social dilemmas"
    - "heuristics guide the implementation of social preferences in one shot prisoner s dilemma experiments"
    - "a model of human cooperation in social dilemmas"
    - "implementation without commitment in moral hazard environments"
    - "game theory with translucent players"

Connected through hyperedge HE-2 (induced by source paper "cooperative equilibrium beyond social dilemmas pareto solvable games"):
  with members:
    - "heuristics guide the implementation of social preferences in one shot prisoner s dilemma experiments"
    - "a model of human cooperation in social dilemmas"
    - "a solution concept for games with altruism and cooperation"
    - "game theory with translucent players"
    - "cooperation and contagion in web based networked public goods experiments"
    - "the online laboratory conducting experiments in a real labor market"

Connected through hyperedge HE-3 (induced by source paper "group size effect on cooperation in social dilemmas"):
  with members:
    - "heuristics guide the implementation of social preferences in one shot prisoner s dilemma experiments"
    - "a model of human cooperation in social dilemmas"
    - "a solution concept for games with altruism and cooperation"
    - "cooperation and contagion in web based networked public goods experiments"
    - "the online laboratory conducting experiments in a real labor market"

Connected through hyperedge HE-4 (induced by source paper "heuristics guide the implementation of social preferences in one shot prisoner s dilemma experiments"):
  with members:
    - "group size effect on cooperation in social dilemmas"
    - "a model of human cooperation in social dilemmas"
    - "the online laboratory conducting experiments in a real labor market"

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)