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: "adaptive switching between single concurrent link scheme in single hop mimo networks"
  Abstract: Concurrent link communications built on multi-antenna systems have been widely adopted for spatial resource exploitation. MIMA-MAC, a classical MIMO MAC protocol utilizing concurrent link scheme, is able to provide superior link throughput over conventional single link MAC (under certain isolated link topologies). However, when utilizing rich link adaptation functions in MIMO systems, there exists a non-ignorable probability that MIMA-MAC's throughput will be lower than that of single link scheme (such probability is dominated by the statistics of instantaneous link topology and channel response). Inspired by this critical observation, and for adapting to various link topologies, this paper will present a novel MAC design that can adaptively switch between single or concurrent link scheme. With the aim of absolutely outperforming the single link MAC, here our optimization criterion is to guarantee a throughput result that is either better than or at least equal to single link MAC's counterpart. To highlight the design rationale, we first present an idealized implementation having network information perfectly known in a non-causal way. Then for realistic applications, we further develop a practical MAC implementation dealing with realistic system impairments (distributed handshaking and imperfect channel estimation). Simulation results validate that link throughput in our MAC is higher than or equal to single link MAC's counterpart with minimized outage probabilities. And for ergodic link throughput, our proposed MAC can outperform the single link MAC and MIMA-MAC by around 20{%}-30{%}.

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.NI(Networking and Internet Architecture)