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: "on fast decodable algebraic space time codes"
  Abstract: In the near future, the $5^{th}$ generation (5G) wireless systems will be established. They will consist of an integration of different techniques, including distributed antenna systems and massive multiple-input multiple-output systems, and the overall performance will highly depend on the channel coding techniques employed. Due to the nature of future wireless networks, space--time codes are no longer merely an object of choice, but will often appear naturally in the communications setting. However, as the involved communication devices often exhibit a modest computational power, the complexity of the codes to be utilised should be reasonably low for possible practical implementation. #R##N#Fast-decodable codes enjoy reduced complexity of maximum-likelihood (ML) decoding due to a smart inner structure allowing for parallelisation in the ML search. The complexity reductions considered in this chapter are entirely owing to the algebraic structure of the considered codes, and could be further improved by employing non-ML decoding methods, however yielding suboptimal performance. #R##N#The aim of this chapter is twofold. First, we provide a tutorial introduction to space--time coding and study powerful algebraic tools for their design and construction. Secondly, we revisit algebraic techniques used for reducing the worst-case decoding complexity of both single-user and multiuser space-time codes, alongside with general code families and illustrative examples.

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)