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: "exponential segregation in a two dimensional schelling model with tolerant individuals"
  Abstract: We prove that the two-dimensional Schelling segregation model yields monochromatic regions of size exponential in the area of individuals' neighborhoods, provided that the tolerance parameter is a constant strictly less than 1/2 but sufficiently close to it. Our analysis makes use of a connection with the first-passage percolation model from the theory of stochastic processes.

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"
    - "unperturbed schelling segregation in two or three dimensions"
    - "digital morphogenesis via schelling segregation"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-2 (induced by source paper "distributed pattern formation in a ring"):
  with members:
    - "schelling games on graphs"
    - "hedonic diversity games"
    - "schelling segregation with strategic agents"
    - "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"
    - "simple and efficient local codes for distributed stable network construction"
    - "an analysis of one dimensional schelling segregation"
    - "optimal deterministic ring exploration with oblivious asynchronous robots"

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"
    - "unperturbed schelling segregation in two or three dimensions"
    - "digital morphogenesis via schelling segregation"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-4 (induced by source paper "hedonic diversity games"):
  with members:
    - "schelling games on graphs"
    - "schelling segregation with strategic agents"
    - "fractional hedonic games"
    - "hedonic games with graph restricted communication"
    - "an analysis of one dimensional schelling segregation"

Connected through hyperedge HE-5 (induced by source paper "a local stochastic algorithm for separation in heterogeneous self organizing particle systems"):
  with members:
    - "counting independent sets and colorings on random regular bipartite graphs"
    - "a stochastic approach to shortcut bridging in programmable matter"
    - "algorithms for bis hard problems on expander graphs"
    - "self organized segregation on the grid"
    - "algorithmic pirogov sinai theory"
    - "line recovery by programmable particles"
    - "collaborative computation in self organizing particle systems"
    - "a markov chain algorithm for compression in self organizing particle systems"

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