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: "vector bin and cancel for mimo distributed full duplex"
  Abstract: In a multi-input multi-output (MIMO) full-duplex network, where an in-band full-duplex infrastruc- ture node communicates with two half-duplex mobiles supporting simultaneous up- and downlink flows, the inter-mobile interference between the up- and downlink mobiles limits the system performance. We study the impact of leveraging an out-of-band side-channel between mobiles in such network under different channel models. For time-invariant channels, we aim to characterize the generalized degrees- of-freedom (GDoF) of the side-channel assisted MIMO full-duplex network. For slow-fading channels, we focus on the diversity-multiplexing tradeoff (DMT) of the system with various assumptions as to the availability of channel state information at the transmitter (CSIT). The key to the optimal performance is a vector bin-and-cancel strategy leveraging Han-Kobayashi message splitting, which is shown to achieve the system capacity region to within a constant bit. We quantify how the side-channel improve the GDoF and DMT compared to a system without the extra orthogonal spectrum. The insights gained from our analysis reveal: i) the tradeoff between spatial resources from multiple antennas at different nodes and spectral resources of the side-channel, and ii) the interplay between the channel uncertainty at the transmitter and use of the side-channel.

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)