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: "on the performance of noma with hybrid arq"
  Abstract: In this paper, we investigate the outage performance of hybrid automatic repeat request with chase combining (HARQ-CC) assisted downlink non-orthogonal multiple access (NOMA) systems. A closed-form expression of the individual outage probability and the diversity gain are obtained firstly. Based on the developed analytical outage probability, a tradeoff between the minimum number of retransmissions and the transmit power allocation coefficient is then provided for a given target rate. The provided simulation results demonstrate the accuracy of the developed analytical results. Moreover, it is shown that NOMA combined with the HARQ-CC can achieve a significant advantage when only average channel state information is known at the transmitter. Particularly, the performance of the user with less transmit power in NOMA systems can be efficiently improved by utilizing HARQ-CC.

Connected through hyperedge HE-1 (induced by source paper "harq cc enabled noma designs with outage probability constraints"):
  with members:
    - "on energy efficient noma designs for heterogeneous low latency downlink transmissions"
    - "a survey on non orthogonal multiple access for 5g networks research challenges and future trends"
    - "joint beamforming and power splitting control in downlink cooperative swipt noma systems"
    - "sub channel assignment power allocation and user scheduling for non orthogonal multiple access networks"
    - "what will 5g be"
    - "on the performance of non orthogonal multiple access in 5g systems with randomly deployed users"
    - "coordinated beamforming for multiuser miso interference channel under rate outage constraints"
    - "on the complexity of joint subcarrier and power allocation for multi user ofdma systems"

Connected through hyperedge HE-2 (induced by source paper "a survey of noma current status and open research challenges"):
  with members:
    - "capacity achieving mimo noma iterative lmmse detection"
    - "noma an information theoretic perspective"
    - "fast harq over finite blocklength codes a technique for low latency reliable communication"
    - "cooperative harq assisted noma scheme in large scale d2d networks"
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "dynamic user clustering and power allocation for uplink and downlink non orthogonal multiple access noma systems"
    - "a general mimo framework for noma downlink and uplink transmission based on signal alignment"
    - "on block coherence of frames"

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)