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: "ml decoding complexity reduction in stbcs using time orthogonal pulse shaping"
  Abstract: AbstractMotivated by the recent developments in the Space Shift Keying (SSK) and Spatial Modulation(SM) systems which employ Time-Orthogonal Pulse Shaping (TOPS) ﬁlters to achieve transmit diversitygains, we propose TOPS for Space-Time Block Codes (STBC). Weshow that any STBC whose set ofweight matrices partitions into P subsets under the equivalence relation termed as Common SupportRelation can be made P-group decodable by properly employing TOPS waveforms across space andtime. Furthermore, by considering some of the well known STBCs in the literature we show that theorder of their Maximum Likelihood decoding complexity can be greatly reduced by the application ofTOPS.Index TermsSpace-time block code, pulse shaping, ML decoding, group decodable, complexity. I. I NTRODUCTION It is well known that the multi-antenna transmission schemeis imperative for reliable, highdata rate, wireless communication which unfortunately comes at the cost of substantial decodingcomplexity at the receiver. The inherent cause for high decoding complexity at the receiver is theInter-Antenna Element (IAE) interference which arises dueto the simultaneous activation of allthe antennas at the transmitter. For example, in the Vertical Bell Laboratories Layered Space-Time(V-BLAST) architecture [1], the Maximum Likelihood (ML) decoding complexity is exponential

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)