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 "ultra reliable and low latency communications using proactive multi cell association"):
  Abstract: To attain reliable communications traditionally relies on a closed-loop methodology but inevitably incurs a good amount of networking latency thanks to complicated feedback mechanism. Such a closed-loop methodology thus shackles the current cellular network with a tradeoff between high reliability and low latency. To completely avoid the latency induced by closed-loop communications, this paper aims to study how to jointly employ open-loop communications and multi-cell association in a heterogeneous network (HetNet) so as to achieve ultra-reliable and low-latency communications (URLLC). We first introduce how URLLC mobile users in a large-scale HetNet adopt the proposed proactive multi-cell association (PMCA) scheme to form their virtual cell that consists of multiple access points (APs) and then analyze the communication reliability and latency performances. We show that the communication reliability can be significantly improved by the PMCA scheme and maximized by optimizing the densities of the users and the APs. The analyses of the uplink and downlink delays are also accomplished, which show that extremely low latency can be fulfilled in the virtual cell of a user if the APs are deployed sufficiently for a given user density and the radio resources of each AP are appropriately allocated.

Includes members:
  Member "wireless channel dynamics and robustness for ultra reliable low latency communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless access in ultra reliable low latency communication urllc")
  Member "resource allocation and harq optimization for urllc traffic in 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non linear age of information in a discrete time queue stationary distribution and average performance analysis")
  Member "energy latency tradeoff in ultra reliable low latency communication with retransmissions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "short packet transmission via variable length codes in the presence of noisy stop feedback")
  Member "joint uplink and downlink resource configuration for ultra reliable and low latency communications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "random access based reliable uplink communication and power transfer using dynamic power splitting")
  Member "a statistical learning approach to ultra reliable low latency communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "extreme urllc vision challenges and key enablers")
  Member "heterogeneous networks with power domain noma coverage throughput and power allocation analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey of rate optimal power domain noma schemes for enabling technologies of future wireless networks")
  Member "cross layer optimization for ultra reliable and low latency radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust urllc packet scheduling of ofdm systems")

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