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: "convergence of type symmetric and cut balanced consensus seeking systems extended version"
  Abstract: We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining ones, the former group is also influenced by the remaining ones by at least a proportional amount. Models involving symmetric interconnections and models in which a weighted average of the agent values is conserved are special cases. We prove that such systems always converge. We give a sufficient condition on the evolving interaction topology for the limit values of two agents to be the same. Conversely, we show that if our condition is not satisfied, then these limits are generically different. These results allow treating systems where the agent interactions are a priori unknown, e.g., random or determined endogenously by the agent values. We also derive corresponding results for discrete-time systems.

Connected through hyperedge HE-1 (induced by source paper "differential inequalities in multi agent coordination and opinion dynamics modeling"):
  with members:
    - "a tutorial on modeling and analysis of dynamic social networks part i"
    - "structural balance and opinion separation in trust mistrust social networks"
    - "opinion dynamics in social networks with hostile camps consensus vs polarization"
    - "distributed surrounding design of target region with complex adjacency matrices"
    - "biased assimilation homophily and the dynamics of polarization"
    - "reaching an optimal consensus dynamical systems that compute intersections of convex sets"
    - "the role of persistent graphs in the agreement seeking of social networks"

Connected through hyperedge HE-2 (induced by source paper "persistent flows and non reciprocal interactions in deterministic networks"):
  with members:
    - "structural balance and opinion separation in trust mistrust social networks"
    - "consensus over random graph processes network borel cantelli lemmas for almost sure convergence"
    - "continuous time consensus under non instantaneous reciprocity"
    - "how agreement and disagreement evolve over random dynamic networks"
    - "the role of persistent graphs in the agreement seeking of social networks"

Connected through hyperedge HE-3 (induced by source paper "the role of persistent graphs in the agreement seeking of social networks"):
  with members:
    - "connectivity and set tracking of multi agent systems guided by multiple moving leaders"
    - "distributed consensus algorithms in sensor networks link failures and channel noise"
    - "distributed consensus algorithms in sensor networks quantized data and random link failures"

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)