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: "approximate consensus multi agent control under stochastic environment with application to load balancing"
  Abstract: The paper is devoted to the approximate consensus problem for networks of nonlinear agents with switching topology, noisy and delayed measurements. In contrast to the existing stochastic approximation-based control algorithms (protocols), a local voting protocol with nonvanishing step size is proposed. Nonvanishing (e.g., constant) step size protocols give the opportunity to achieve better convergence rate (by choosing proper step sizes) in coping with time-varying loads and agent states. The price to pay is replacement of the mean square convergence with an approximate one. To analyze dynamics of the closed loop system, the so-called method of averaged models is used. It allows to reduce analysis complexity of the closed loop system. In this paper the upper bounds for mean square distance between the initial system and its approximate averaged model are proposed. The proposed upper bounds are used to obtain conditions for approximate consensus achievement. #R##N#The method is applied to the load balancing problem in stochastic dynamic networks with incomplete information about the current states of agents and with changing set of communication links. The load balancing problem is formulated as consensus problem in noisy model with switched topology. The conditions to achieve the optimal level of load balancing (in the sense that if no new task arrives, all agents will finish at the same time) are obtained. #R##N#The performance of the system is evaluated analytically and by simulation. It is shown that the performance of the adaptive multi-agent strategy with the redistribution of tasks among "connected" neighbors is significantly better than the performance without redistribution. The obtained results are important for control of production networks, multiprocessor, sensor or multicomputer networks, etc.

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.SY(Systems and Control)