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: "achievable degrees of freedom on k user mimo multi way relay channel with common and private messages"
  Abstract: This paper investigates the achievable total degrees of freedom (DoF) of the MIMO multi-way relay channel that consists of K users, where each user is equipped with M antennas, and a decode-and-forward relay equipped with N antennas. In this channel, each user wants to convey K − 1 private messages to the other users in addition to a common message to all of them. Due to the absence of direct links between the users, communication occurs through the relay in two phases: a multiple access channel (MAC) phase and a broadcast (BC) phase. We derive cut-set bounds on the total DoF of the network, and show that the network has DoF less than or equal to K min {N, M}. Achievability of the upper bound is shown by using signal space alignment for network coding in the MAC phase, and zero- forcing precoding in the BC phase. We show that introducing the common messages besides the private messages leads to achieving higher total DoF than using the private messages only.

Connected through hyperedge HE-1 (induced by source paper "asymmetric degrees of freedom of the full duplex mimo 3 way channel with unicast and broadcast messages"):
  with members:
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "the degrees of freedom of multi way device to device communications is limited by 2"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"

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)