human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "persistent flows and non reciprocal interactions in deterministic networks"):
  Abstract: This paper studies deterministic consensus networks with discrete-time dynamics under persistent flows and non-reciprocal agent interactions. An arc describing the interaction strength between two agents is said to be persistent if its weight function has an infinite $l_1$ norm. We discuss two balance conditions on the interactions between agents which generalize the arc-balance and cut-balance conditions in the literature respectively. The proposed conditions require that such a balance should be satisfied over each time window of a fixed length instead of at each time instant. We prove that in both cases global consensus is reached if and only if the persistent graph, which consists of all the persistent arcs, contains a directed spanning tree. The convergence rates of the system to consensus are also provided in terms of the interactions between agents having taken place. The results are obtained under a weak condition without assuming the existence of a positive lower bound of all the nonzero weights of arcs and are compared with the existing results. Illustrative examples are provided to show the critical importance of the nontrivial lower boundedness of the self-confidence of the agents.

Includes members:
  Member "structural balance and opinion separation in trust mistrust social networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "visualizing structural balance in signed networks")
  Member "consensus over random graph processes network borel cantelli lemmas for almost sure convergence":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamics of opinions with social biases")
  Member "continuous time consensus under non instantaneous reciprocity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on adversary robust consensus protocols through joint agent interactions")
  Member "how agreement and disagreement evolve over random dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "opinion dynamics on correlated subjects in social networks")
  Member "convergence of type symmetric and cut balanced consensus seeking systems extended version":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "differential inequalities in multi agent coordination and opinion dynamics modeling")
  Member "the role of persistent graphs in the agreement seeking of social networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a tutorial on modeling and analysis of dynamic social networks part i")

Question: Please tell me which class the source paper 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)