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: "controlling a population"
  Abstract: We introduce a new setting where a population of agents, each modelled by a finite-state system, are controlled uniformly: the controller applies the same action to every agent. The framework is largely inspired by the control of a biological system, namely a population of yeasts, where the controller may only change the environment common to all cells. We study a synchronisation problem for such populations: no matter how individual agents react to the actions of the controller, the controller aims at driving all agents synchronously to a target state. The agents are naturally represented by a non-deterministic finite state automaton (NFA), the same for every agent, and the whole system is encoded as a 2-player game. The first player (Controller) chooses actions, and the second player (Agents) resolves non-determinism for each agent. The game with m agents is called the m -population game. This gives rise to a parameterized control problem (where control refers to 2 player games), namely the population control problem: can Controller control the m-population game for all m in N whatever Agents does?

Connected through hyperedge HE-1 (induced by source paper "expressive power of broadcast consensus protocols"):
  with members:
    - "affine extensions of integer vector addition systems with states"
    - "space optimal majority in population protocols"
    - "time space trade offs in population protocols"
    - "context free commutative grammars with integer counters and resets"
    - "the power of well structured systems"
    - "the computational power of population protocols"

Connected through hyperedge HE-2 (induced by source paper "controlling a random population"):
  with members:
    - "controlling a random population is exptime hard"
    - "two recursively inseparable problems for probabilistic automata"
    - "regular cost functions part i logic and algebra over words"

Connected through hyperedge HE-3 (induced by source paper "distribution based objectives for markov decision processes"):
  with members:
    - "on the polytope escape problem for continuous linear dynamical systems"
    - "robust synchronization in markov decision processes"
    - "ultimate positivity is decidable for simple linear recurrence sequences"
    - "infinite synchronizing words for probabilistic automata erratum"
    - "decidable problems for probabilistic automata on infinite words"

Connected through hyperedge HE-4 (induced by source paper "the complexity of synchronizing markov decision processes"):
  with members:
    - "improving the upper bound on the length of the shortest reset word"
    - "synchronizing data words for register automata"
    - "computation tree logic for synchronization properties"
    - "trace refinement in labelled markov decision processes"
    - "synchronizing weighted automata"
    - "probabilistic bisimulation naturally on distributions"
    - "fast synchronization of random automata"
    - "on the probability of being synchronizable"

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.FL(Formal Languages and Automata Theory)