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: "heuristics guide the implementation of social preferences in one shot prisoner s dilemma experiments"
  Abstract: Cooperation in one-shot anonymous interactions is a widely documented aspect of human behaviour. Here we shed light on the motivations behind this behaviour by experimentally exploring cooperation in a one-shot continuous-strategy Prisoner's Dilemma (i.e. one-shot two-player Public Goods Game). We examine the distribution of cooperation amounts, and how that distribution varies based on the benefit-to-cost ratio of cooperation (b/c). Interestingly, we find a trimodal distribution at all b/c values investigated. Increasing b/c decreases the fraction of participants engaging in zero cooperation and increases the fraction engaging in maximal cooperation, suggesting a role for efficiency concerns. However, a substantial fraction of participants consistently engage in 50% cooperation regardless of b/c. The presence of these persistent 50% cooperators is surprising, and not easily explained by standard models of social preferences. We present evidence that this behaviour is a result of social preferences guided by simple decision heuristics, rather than the rational examination of payoffs assumed by most social preference models. We also find a strong correlation between play in the Prisoner's Dilemma and in a subsequent Dictator Game, confirming previous findings suggesting a common prosocial motivation underlying altruism and cooperation.

Connected through hyperedge HE-1 (induced by source paper "cooperation in the spatial prisoner s dilemma game with probabilistic abstention"):
  with members:
    - "the impact of coevolution and abstention on the emergence of cooperation"
    - "simulation of an optional strategy in the prisoner s dilemma in spatial and non spatial environments"
    - "cooperation and contagion in web based networked public goods experiments"

Connected through hyperedge HE-2 (induced by source paper "games with tolerant players"):
  with members:
    - "translucent players explaining cooperative behavior in social dilemmas"
    - "game theory with translucent players"

Connected through hyperedge HE-3 (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"
    - "benevolent characteristics promote cooperative behaviour among humans"
    - "a model of human cooperation in social dilemmas"
    - "implementation without commitment in moral hazard environments"
    - "game theory with translucent players"

Connected through hyperedge HE-4 (induced by source paper "cooperative equilibrium beyond social dilemmas pareto solvable games"):
  with members:
    - "benevolent characteristics promote cooperative behaviour among humans"
    - "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-5 (induced by source paper "group size effect on cooperation in social dilemmas"):
  with members:
    - "benevolent characteristics promote cooperative behaviour among humans"
    - "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"

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)