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: "nature inspired computational model of population desegregation under group leaders influence"
  Abstract: This paper presents an agent-based model of population desegregation and provides a thorough analysis of the social behavior leading to it, namely, the contact hypothesis. Based on the parameters of frequency and intensity of influence of group leaders on the population, the proposed model is constituted by two layers: 1) a physical layer of the population that is influenced by and 2) a virtual layer of group leaders. The model of negotiation and survival of group leaders are governed by the nature-inspired evolutionary process of queen ants, also known as Foundress Dilemma. The motivation of using a virtual grouping concept (instead of taking a subset of population as the group leaders) is to stay focused on finding the conditions leading individuals in a society tolerating a significantly diversified (desegregated) neighborhood, rather than, indulging into complex details, which would be more relevant to studies targeting the evolution of societal group and leaders. A geographic information system-driven simulation is performed, which reveals that: 1) desegregation is directly proportional to the frequency of group leaders’ contact with the population and 2) mostly, it remains ineffective with an increase in the intensity of group leaders’ contact with the population. The mechanism of group selection (the conflict resolution model resolving the Foundress Dilemma) reveals an exciting result concerning negative influence of cooperative group leaders. Most of the time, desegregation decreases with increase in cooperative leaders (the leaders enforcing desegregation) when compared with fierce leaders (the leaders enforcing segregation).

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.MA(Multiagent Systems)