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: "digital morphogenesis via schelling segregation"
  Abstract: Schelling's model of segregation looks to explain the way in which particles or agents of two types may come to arrange themselves spatially into configurations consisting of large homogeneous clusters, i.e.\ connected regions consisting of only one type. As one of the earliest agent based models studied by economists and perhaps the most famous model of self-organising behaviour, it also has direct links to areas at the interface between computer science and statistical mechanics, such as the Ising model and the study of contagion and cascading phenomena in networks. #R##N#While the model has been extensively studied it has largely resisted rigorous analysis, prior results from the literature generally pertaining to variants of the model which are tweaked so as to be amenable to standard techniques from statistical mechanics or stochastic evolutionary game theory. In \cite{BK}, Brandt, Immorlica, Kamath and Kleinberg provided the first rigorous analysis of the unperturbed model, for a specific set of input parameters. Here we provide a rigorous analysis of the model's behaviour much more generally and establish some surprising forms of threshold behaviour, notably the existence of situations where an \emph{increased} level of intolerance for neighbouring agents of opposite type leads almost certainly to \emph{decreased} segregation.

Connected through hyperedge HE-1 (induced by source paper "positive algorithmic bias cannot stop fragmentation in homophilic social networks"):
  with members:
    - "on the inevitability of online echo chambers"
    - "understanding filter bubbles and polarization in social networks"
    - "measuring online social bubbles"
    - "exponential segregation in a two dimensional schelling model with tolerant individuals"
    - "unperturbed schelling segregation in two or three dimensions"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-2 (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"
    - "from randomness to order unperturbed schelling segregation in two or three dimensions"

Connected through hyperedge HE-3 (induced by source paper "convergence and hardness of strategic schelling segregation"):
  with members:
    - "schelling games on graphs"
    - "schelling segregation with strategic agents"
    - "exponential segregation in a two dimensional schelling model with tolerant individuals"
    - "unperturbed schelling segregation in two or three dimensions"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-4 (induced by source paper "schelling games on graphs"):
  with members:
    - "hedonic diversity games"
    - "schelling segregation with strategic agents"
    - "from randomness to order unperturbed schelling segregation in two or three dimensions"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-5 (induced by source paper "self organized segregation on the grid"):
  with members:
    - "minority population in the one dimensional schelling model of segregation"
    - "exponential segregation in a two dimensional schelling model with tolerant individuals"
    - "unperturbed schelling segregation in two or three dimensions"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-6 (induced by source paper "improved intolerance intervals and size bounds for a schelling type spin system"):
  with members:
    - "self organized segregation on the grid"
    - "minority population in the one dimensional schelling model of segregation"
    - "unperturbed schelling segregation in two or three dimensions"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-7 (induced by source paper "schelling segregation with strategic agents"):
  with members:
    - "unperturbed schelling segregation in two or three dimensions"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-8 (induced by source paper "minority population in the one dimensional schelling model of segregation"):
  with members:
    - "unperturbed schelling segregation in two or three dimensions"
    - "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.GT(Computer Science and Game Theory)