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: "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.

Connected through hyperedge HE-1 (induced by source paper "distributed rate control in downlink noma networks with reliability constraints"):
  with members:
    - "joint power control and rate allocation enabling ultra reliability and energy efficiency in simo wireless networks"
    - "hybrid resource scheduling for aggregation in massive machine type communication networks"
    - "rate control under finite blocklength for downlink cellular networks with reliability constraints"
    - "energy efficient resource allocation in noma heterogeneous networks"
    - "signal processing for mimo noma present and future challenges"
    - "non orthogonal multiple access for cooperative communications challenges opportunities and trends"
    - "power domain non orthogonal multiple access noma in 5g systems potentials and challenges"
    - "non orthogonal multiple access in large scale heterogeneous networks"

Connected through hyperedge HE-2 (induced by source paper "transmission energy minimization for heterogeneous low latency noma downlink"):
  with members:
    - "joint power and time allocation for noma mec offloading"
    - "efficient error correcting codes in the short blocklength regime"
    - "delay minimization for noma mec offloading"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "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"

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)