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 "global synchronization of pulse coupled oscillators interacting on cycle graphs"):
  Abstract: The importance of pulse-coupled oscillators (PCOs) in biology and engineering has motivated research to understand basic properties of PCO networks. Despite the large body of work addressing PCOs, a global synchronization result for networks that are more general than all-to-all connected is still unavailable. In this paper we address global synchronization of PCO networks described by cycle graphs. It is shown for the bidirectional cycle case that as the number of oscillators in the cycle grows, the coupling strength must be increased in order to guarantee synchronization for arbitrary initial conditions. For the unidirectional cycle case, the strongest coupling cannot ensure global synchronization yet a refractory period in the phase response curve is sufficient to enable global synchronization. Analytical findings are confirmed by numerical simulations.

Includes members:
  Member "increasing sync rate of pulse coupled oscillators via phase response function design theory and application to wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "synchronization of pulse coupled oscillators and clocks under minimal connectivity assumptions")
  Member "kick synchronization versus diffusive synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "global practical node and edge synchronization in kuramoto networks a submodular optimization framework")
  Member "on the scalability of cooperative time synchronization in pulse connected networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed clock skew and offset estimation in wireless sensor networks asynchronous algorithm and convergence analysis")

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)