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: "a new multiple access technique for 5g power domain sparse code multiple access psma"
  Abstract: In this paper, a new approach for multiple access (MA) in fifth generation (5G) of cellular networks called power domain sparse code multiple access (PSMA) is proposed. In PSMA, we adopt both the power domain and the code domain to transmit multiple users' signals over a subcarrier simultaneously. In such a model, the same SCMA codebook can be used by multiple users where, for these users, power domain non-orthogonal multiple access (PD-NOMA) technique is used to send signals non-orthogonally. Although different SCMA codebooks are orthogonal and produce no interference over each other, the same codebook used by multiple users produces interference over these users. We investigate the signal model as well as the receiver and transmitter of the PSMA method. To evaluate the performance of PSMA, we consider a heterogeneous cellular network (HetNet). In this case our design objective is to maximize the system sum rate of the network subject to some system level and QoS constraints such as transmit power constraints. We formulate the proposed resource allocation problem as an optimization problem and solve it by successive convex approximation (SCA) techniques. Moreover, we compare PSMA with sparse code multiple access (SCMA) and PD-NOMA from the performance and computational complexity perspective. Finally, the effectiveness of the proposed approach is investigated using numerical results. We show that by a reasonable increase in complexity, PSMA can improve the spectral efficiency about 50\% compared to SCMA and PD-NOMA.

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)