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: "short packet communications in non orthogonal multiple access systems"
  Abstract: This work introduces, for the first time, non-orthogonal multiple access (NOMA) into short-packet communications to achieve low latency in wireless networks. Specifically, we address the optimization of transmission rates and power allocation to maximize the effective throughput of the user with a higher channel gain while guaranteeing the other user achieving a certain level of effective throughput. To demonstrate the benefits of NOMA, we analyze the performance of orthogonal multiple access (OMA) as a benchmark. Our examination shows that NOMA can significantly outperform OMA by achieving a higher effective throughput with the same latency or incurring a lower latency to achieve the same effective throughput targets. Surprisingly, we find that the performance gap between NOMA and OMA becomes more prominent when the effective throughput targets at the two users become closer to each other. This demonstrates that NOMA can significantly reduce the latency in the context of short-packet communications with practical constraints.

Connected through hyperedge HE-1 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime"):
  with members:
    - "on the effective energy efficiency of ultra reliable networks in the finite blocklength regime"
    - "on the effective capacity of mtc networks in the finite blocklength regime"
    - "ultra reliable communication via optimum power allocation for type i arq in finite block length"
    - "non orthogonal multiple access noma in cellular uplink and downlink challenges and enabling techniques"
    - "low latency ultra reliable 5g communications finite blocklength bounds and coding schemes"
    - "finite block length analysis of the incremental redundancy harq"
    - "ultra reliable communication in 5g wireless systems"
    - "quasi static simo fading channels at finite blocklength"

Connected through hyperedge HE-2 (induced by source paper "on energy efficient noma designs for heterogeneous low latency downlink transmissions"):
  with members:
    - "joint beamforming and power splitting control in downlink cooperative swipt noma systems"
    - "downlink transmission of short packets framing and control information revisited"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "what will 5g be"
    - "ultra reliable communication in 5g wireless systems"
    - "throughput of cognitive radio systems with finite blocklength codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"

Connected through hyperedge HE-3 (induced by source paper "energy efficient non orthogonal transmission under reliability and finite blocklength constraints"):
  with members:
    - "joint beamforming and power splitting control in downlink cooperative swipt noma systems"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"
    - "downlink transmission of short packets framing and control information revisited"
    - "blocklength limited performance of relaying under quasi static rayleigh channels"
    - "throughput of cognitive radio systems with finite blocklength codes"

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)