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: "wireless channel modeling perspectives for ultra reliable communications"
  Abstract: Ultra-Reliable Communication (URC) is one of the distinctive features of the upcoming 5G wireless communication. The level of reliability, going down to packet error rates (PER) of $10^{-9}$, should be sufficiently convincing in order to remove cables in an industrial setting or provide remote control of robots with mission-critical function. In this paper we present elements of physical and statistical modeling of the wireless channel that are relevant for characterization of the lower tail of the channel Cumulative Distribution Function (CDF). There are channel models, such as Two-Wave with Diffuse Power (TWDP) or Suzuki, where finding the full CDF is not tractable. We show that, for a wide range of channel models, the outage probability at URC levels can be approximated by a simple expression, whose exponent depends on the actual channel model. Furthermore, it is seen that the two-wave model leads to pessimistic predictions of the fading in the region of ultra-reliable communications, while the CDFs of models that contain diffuse components have slopes that correspond to the slope of a Rayleigh fading. We provide analysis of the receive antenna diversity schemes for URC-relevant statistics and obtain a new expression for Maximum Ratio Combining (MRC) in Weibull channels.

Connected through hyperedge HE-1 (induced by source paper "wireless channel dynamics and robustness for ultra reliable low latency communications"):
  with members:
    - "a d2d based protocol for ultra reliable wireless communications for industrial automation"
    - "real time cooperative communication for automation over wireless"

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)