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 "energy efficient non orthogonal transmission under reliability and finite blocklength constraints"):
  Abstract: This paper investigates an energy-efficient non-orthogonal transmission design problem for two downlink receivers that have strict reliability and finite blocklength (latency) constraints. The Shannon capacity formula widely used in traditional designs needs the assumption of infinite blocklength and thus is no longer appropriate. We adopt the newly finite blocklength coding capacity formula for explicitly specifying the trade-off between reliability and code blocklength. However, conventional successive interference cancellation (SIC) may become infeasible due to heterogeneous blocklengths. We thus consider several scenarios with different channel conditions and with/without SIC. By carefully examining the problem structure, we present in closed-form the optimal power and code blocklength for energy-efficient transmissions. Simulation results provide interesting insights into conditions for which non-orthogonal transmission is more energy efficient than the orthogonal transmission such as TDMA.

Includes members:
  Member "short packet communications in non orthogonal multiple access systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the performance of non orthogonal multiple access in the finite blocklength regime")
  Member "joint beamforming and power splitting control in downlink cooperative swipt noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey of rate optimal power domain noma schemes for enabling technologies of future wireless networks")
  Member "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed federated learning for ultra reliable low latency vehicular communications")
  Member "downlink transmission of short packets framing and control information revisited":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transmission energy minimization for heterogeneous low latency noma downlink")
  Member "blocklength limited performance of relaying under quasi static rayleigh channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed federated learning for ultra reliable low latency vehicular communications")
  Member "throughput of cognitive radio systems with finite blocklength codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "noma enhanced terrestrial and aerial iot networks with partial csi")

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)