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: "fundamental limits of spectrum sharing for noma based cooperative relaying under a peak interference constraint"
  Abstract: Non-orthogonal multiple access (NOMA) and spectrum sharing (SS) are two emerging multiple access technologies for efficient spectrum utilization in future wireless communications standards. In this paper, we present the performance analysis of a NOMA-based cooperative relaying system (CRS) in an underlay spectrum sharing scenario, considering a peak interference constraint (PIC), where the peak interference inflicted by the secondary (unlicensed) network on the primary-user (licensed) receiver (PU-Rx) should be less than a predetermined threshold. In the proposed system the relay and the secondary-user receiver (SU-Rx) are equipped with multiple receive antennas and apply selection combining (SC), where the antenna with highest instantaneous signal-to-noise ratio (SNR) is selected, and maximal-ratio combining (MRC), for signal reception. Closed-form expressions are derived for the average achievable rate and outage probabilities for SS-based CRS-NOMA. These results show that for large values of peak interference power, the SS-based CRS-NOMA outperforms the CRS with conventional orthogonal multiple access (OMA) in terms of spectral efficiency. The effect of the interference channel on the system performance is also discussed, and in particular, it is shown that the interference channel between the secondary-user transmitter (SU-Tx) and the PU-Rx has a more severe effect on the average achievable rate as compared to that between the relay and the PU-Rx. A close agreement between the analytical and numerical results confirm the correctness of our rate and outage analysis.

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)