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: "towards massive ultra reliable and low latency wireless communication with short packets"
  Abstract: Most of the recent advances in the design of high-speed wireless systems are based on information-theoretic principles that demonstrate how to efficiently transmit long data packets. However, the upcoming wireless systems, notably the 5G system, will need to support novel traffic types that use short packets. For example, short packets represent the most common form of traffic generated by sensors and other devices involved in Machine-to-Machine (M2M) communications. Furthermore, there are emerging applications in which small packets are expected to carry critical information that should be received with low latency and ultra-high reliability. #R##N#Current wireless systems are not designed to support short-packet transmissions. For example, the design of current systems relies on the assumption that the metadata (control information) is of negligible size compared to the actual information payload. Hence, transmitting metadata using heuristic methods does not affect the overall system performance. However, when the packets are short, metadata may be of the same size as the payload, and the conventional methods to transmit it may be highly suboptimal. #R##N#In this article, we review recent advances in information theory, which provide the theoretical principles that govern the transmission of short packets. We then apply these principles to three exemplary scenarios (the two-way channel, the downlink broadcast channel, and the uplink random access channel), thereby illustrating how the transmission of control information can be optimized when the packets are short. The insights brought by these examples suggest that new principles are needed for the design of wireless protocols supporting short packets. These principles will have a direct impact on the system design.

Connected through hyperedge HE-1 (induced by source paper "wireless powered communications with finite battery and finite blocklength"):
  with members:
    - "ultra reliable short message relaying with wireless power transfer"
    - "wireless networks with energy harvesting and power transfer joint power and time allocation"
    - "wireless powered two way relaying with power splitting based energy accumulation"
    - "accumulate then forward an opportunistic relaying protocol for wireless powered cooperative communications"
    - "wireless powered relaying with finite block length codes"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "on wirelessly powered communications with short packets"
    - "throughput optimization for massive mimo systems powered by wireless energy transfer"

Connected through hyperedge HE-2 (induced by source paper "learning how to communicate in the internet of things finite resources and heterogeneity"):
  with members:
    - "efficient deployment of multiple unmanned aerial vehicles for optimal wireless coverage"
    - "learning with finite memory for machine type communication"
    - "unmanned aerial vehicle with underlaid device to device communications performance and tradeoffs"
    - "mobile internet of things can uavs provide an energy efficient mobile architecture"
    - "wireless communications in the era of big data"
    - "towards massive machine type cellular communications"
    - "towards a consumer centric grid a behavioral perspective"
    - "what can wireless cellular technologies do about the upcoming smart metering traffic"

Connected through hyperedge HE-3 (induced by source paper "wirelessly powered communication networks with short packets"):
  with members:
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "finite blocklength achievable rates for energy harvesting awgn channels with infinite buffer"
    - "non asymptotic achievable rates for energy harvesting channels using save and transmit"
    - "on wirelessly powered communications with short packets"
    - "energy harvesting wireless communications a review of recent advances"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "powering the next billion devices with wi fi"
    - "near optimal energy control and approximate capacity of energy harvesting communication"

Connected through hyperedge HE-4 (induced by source paper "on wirelessly powered communications with short packets"):
  with members:
    - "non asymptotic achievable rates for energy harvesting channels using save and transmit"
    - "energy harvesting wireless communications a review of recent advances"
    - "towards massive ultra reliable and low latency wireless the art of sending short packets"

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)