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: "algebraic distributed space time codes with low ml decoding complexity"
  Abstract: Extended Clifford algebras are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity distributed space-time codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced maximum likelihood (ML) decoding complexity. In particular, the ML decoding of these codes can be performed by applying the lattice decoder algorithm on a lattice of four times lesser dimension than what is required in general. Moreover these codes have a uniform distribution of power among the relays and in time, thus leading to a low Peak to Average Power Ratio at the relays.

Connected through hyperedge HE-1 (induced by source paper "cascaded orthogonal space time block codes for wireless multi hop relay networks"):
  with members:
    - "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design"
    - "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance"
    - "diversity of mimo multihop relay channels"
    - "a non orthogonal distributed space time coded protocol part i signal model and design criteria"
    - "a non orthogonal distributed space time coded protocol part ii code construction and dm g tradeoff"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"
    - "approximately universal optimality over several dynamic and non dynamic cooperative diversity schemes for wireless networks"

Connected through hyperedge HE-2 (induced by source paper "noncoherent low decoding complexity space time codes for wireless relay networks"):
  with members:
    - "signal set design for full diversity low decoding complexity differential scaled unitary stbcs"
    - "a non orthogonal distributed space time coded protocol part i signal model and design criteria"
    - "single symbol decodable differential space time modulation based on qo stbc"

Connected through hyperedge HE-3 (induced by source paper "stbcs from representation of extended clifford algebras"):
  with members:
    - "noncoherent low decoding complexity space time codes for wireless relay networks"
    - "high rate multi symbol decodable stbcs from clifford algebras"
    - "multigroup decodable stbcs from clifford algebras"

Connected through hyperedge HE-4 (induced by source paper "algebraic distributed differential space time codes with low decoding complexity"):
  with members:
    - "noncoherent low decoding complexity space time codes for wireless relay networks"
    - "signal set design for full diversity low decoding complexity differential scaled unitary stbcs"
    - "single symbol decodable differential space time modulation based on qo stbc"

Connected through hyperedge HE-5 (induced by source paper "distributed space time codes with low decoding complexity for asynchronous relay networks"):
  with members:
    - "algebraic distributed differential space time codes with low decoding complexity"
    - "a non orthogonal distributed space time coded protocol part ii code construction and dm g tradeoff"

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)