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: "revisited design criteria for stbcs with reduced complexity ml decoding"
  Abstract: The design of linear STBCs offering a low-complexity ML decoding using the well known Sphere Decoder (SD) has been extensively studied in last years. The first considered approach to derive design criteria for the construction of such codes is based on the Hurwitz-Radon (HR) Theory for mutual orthogonality between the weight matrices defining the linear code. This appproach served to construct new families of codes admitting fast sphere decoding such as multi-group decodable, fast decodable, and fast-group decodable codes. In a second Quadratic Form approach, the Fast Sphere Decoding (FSD) complexity of linear STBCs is captured by a Hurwitz Radon Quadratic Form (HRQF) matrix based in its essence on the HR Theory. In this work, we revisit the structure of weight matrices for STBCs to admit Fast Sphere decoding. We first propose novel sufficient conditions and design criteria for reduced-complexity ML decodable linear STBCs considering an arbitrary number of antennas and linear STBCs of an arbitrary coding rate. Then we apply the derived criteria to the three families of codes mentioned above and provide analytical proofs showing that the FSD complexity depends only on the weight matrices and their ordering and not on the channel gains or the number of antennas and explain why the so far used HR theory-based approaches are suboptimal.

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)