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: "performance analysis of partial interference cancellation in multi antenna udns"
  Abstract: The employment of partial zero-forcing (PZF) receivers at the base stations represents an efficient and low-complexity technique for uplink interference management in cellular networks. In this paper, we focus on the performance analysis of ultra-dense networks (UDNs) in which the multi-antenna receivers adopt PZF. We provide both integral expressions and tight closed-form approximations for the probability of successful transmission, which can be used to accurately evaluate the optimal tradeoff between interference cancellation and array gain. Numerical results show that no more than half of the available degrees of freedom should be used for interference cancellation.

Connected through hyperedge HE-1 (induced by source paper "full duplex mimo small cell networks with interference cancellation"):
  with members:
    - "self interference in full duplex multi user mimo channels"
    - "joint backhaul access analysis of full duplex self backhauling heterogeneous networks"
    - "user scheduling and optimal power allocation for full duplex cellular networks"
    - "analysis of massive mimo enabled downlink wireless backhauling for full duplex small cells"
    - "optimal low complexity self interference cancellation for full duplex mimo small cells"
    - "throughput and coverage for a mixed full and half duplex small cell network"
    - "massive mimo enabled full duplex cellular networks"
    - "full duplex mimo small cell networks performance 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)