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: "from randomness to order unperturbed schelling segregation in two or three dimensions"
  Abstract: Schelling's model of segregation, first described in 1969, has become one of the best known models of self-organising behaviour. While Schelling's explicit concern was to understand the mechanisms underlying racial segregation in large cities from a game theoretic perspective, the model should be seen as one of a family, arising in fields as diverse as statistical mechanics, neural networks and the social sciences, and which are concerned with interacting populations situated on network structures. Despite extensive study, however, the (unperturbed) Schelling model has largely resisted rigorous analysis, prior results in the literature generally pertaining to variants of the model in which noise is introduced into the dynamics of the system, the resulting model then being amenable to standard techniques from statistical mechanics or stochastic evolutionary game theory. A series of recent papers (one by Brandt, Immorlica, Kamath, and Kleinberg, and two by the authors), has seen the first rigorous analysis of the one dimensional version of the unperturbed model. Here we provide the first rigorous analysis of the two and three dimensional unperturbed models, establishing most of the phase diagram, and answering a challenge from a recent paper by Brandt, Immorlica, Kamath, and Kleinberg.

Connected through hyperedge HE-1 (induced by source paper "swap stability in schelling games on graphs"):
  with members:
    - "convergence and hardness of strategic schelling segregation"
    - "graphical one sided markets"
    - "schelling games on graphs"
    - "hedonic diversity games"
    - "schelling segregation with strategic agents"
    - "fractional hedonic games"
    - "digital morphogenesis via schelling segregation"

Connected through hyperedge HE-2 (induced by source paper "schelling games on graphs"):
  with members:
    - "hedonic diversity games"
    - "schelling segregation with strategic agents"
    - "digital morphogenesis via schelling segregation"
    - "an analysis of one dimensional schelling 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)