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 "transmission energy minimization for heterogeneous low latency noma downlink"):
  Abstract: This paper investigates the transmission energy minimization problem for the two-user downlink with strictly heterogeneous latency constraints. To cope with the latency constraints and to explicitly specify the trade-off between blocklength (latency) and reliability the normal approximation of the capacity of finite blocklength codes (FBCs) is adopted, in contrast to the classical Shannon capacity formula. We first consider the non-orthogonal multiple access (NOMA) based transmission scheme. However, due to heterogeneous latency constraints and channel conditions at receivers, the conventional successive interference cancellation may be infeasible. We thus study the problem by considering heterogeneous receiver conditions under different interference mitigation schemes and solve the corresponding NOMA design problems. It is shown that, though the energy function is not convex and does not have closed form expression, the studied NOMA problems can be globally solved semi-analytically and with low complexity. Moreover, we propose a hybrid transmission scheme that combines the time division multiple access (TDMA) and NOMA. Specifically, the hybrid scheme can judiciously perform bit and time allocation and take TDMA and NOMA as two special instances. To handle the more challenging hybrid design problem, we propose a concave approximation of the FBC rate/capacity formula, by which we obtain computationally efficient and high-quality solutions. Simulation results show that the hybrid scheme can achieve considerable transmission energy saving compared with both pure NOMA and TDMA schemes.

Includes members:
  Member "joint power and time allocation for noma mec offloading":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "efficient error correcting codes in the short blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an efficient algorithm for designing optimal crcs for tail biting convolutional codes")
  Member "delay minimization for noma mec offloading":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "short packets over block memoryless fading channels pilot assisted or noncoherent transmission":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "joint beamforming and power splitting control in downlink cooperative swipt noma systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey of rate optimal power domain noma schemes for enabling technologies of future wireless networks")
  Member "energy efficient non orthogonal transmission under reliability and finite blocklength constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed rate control in downlink noma networks with reliability constraints")
  Member "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "wireless access in ultra reliable low latency communication urllc")

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)