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: "on the scalability of cooperative time synchronization in pulse connected networks"
  Abstract: We consider the problem of time synchronization in dense wireless networks. Well established synchronization techniques suffer from an inherent scalability problem, in that synchronization errors grow unbound with increasing network density. In this work, first we develop a model for communication in wireless networks, and then we use the model to define a new time synchronization mechanism. A salient feature of the proposed method is that, in the regime of asymptotically dense networks, it achieves global synchronization with errors bounded by constants independent of network size; and furthermore, this error is the smallest possible achievable by any pair of nodes anywhere in the network, irrespective of the distance separating them. Another contribution is that our model and proofs are purely probabilistic, in contrast to formulations in terms of dynamical systems that are standard in the literature on time synchronization problems.

Connected through hyperedge HE-1 (induced by source paper "distributed clock skew and offset estimation in wireless sensor networks asynchronous algorithm and convergence analysis"):
  with members:
    - "time varying clock offset estimation in two way timing message exchange in wireless sensor networks using factor graphs"
    - "a factor graph approach to clock offset estimation in wireless sensor networks"

Connected through hyperedge HE-2 (induced by source paper "global synchronization of pulse coupled oscillators interacting on cycle graphs"):
  with members:
    - "increasing sync rate of pulse coupled oscillators via phase response function design theory and application to wireless networks"
    - "kick synchronization versus diffusive synchronization"

Connected through hyperedge HE-3 (induced by source paper "relay assisted user scheduling in wireless networks with hybrid arq"):
  with members:
    - "parity forwarding for multiple relay networks"

Connected through hyperedge HE-4 (induced by source paper "relay subset selection in wireless networks using partial decode and forward transmission"):
  with members:
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "a simple cooperative diversity method based on network path selection"

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.IT(Information Theory)