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: "a non orthogonal distributed space time coded protocol part ii code construction and dm g tradeoff"
  Abstract: This is the second part of a two-part series of papers. In this paper, for the generalized non-orthogonal amplify and forward (GNAF) protocol presented in Part-I, a construction of a new family of distributed space-time codes based on Co-ordinate Interleaved Orthogonal Designs (CIOD) which result in reduced Maximum Likelihood (ML) decoding complexity at the destination is proposed. Further, it is established that the recently proposed Toeplitz space-time codes as well as space-time block codes (STBCs) from cyclic division algebras can be used in GNAF protocol. Finally, a lower bound on the optimal Diversity-Multiplexing Gain (DM-G) tradeoff for the GNAF protocol is established and it is shown that this bound approaches the transmit diversity bound asymptotically as the number of relays and the number of channels uses increases.

Connected through hyperedge HE-1 (induced by source paper "maximum rate of unitary weight single symbol decodable stbcs"):
  with members:
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-2 (induced by source paper "co ordinate interleaved distributed space time coding for two antenna relays networks"):
  with members:
    - "diversity of mimo multihop relay channels part i amplify and forward"

Connected through hyperedge HE-3 (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"
    - "algebraic distributed space time codes with low ml decoding complexity"
    - "diversity of mimo multihop relay channels"
    - "a non orthogonal distributed space time coded protocol part i signal model and design criteria"
    - "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-4 (induced by source paper "distributed space time codes for cooperative networks with partial csi"):
  with members:
    - "a non orthogonal distributed space time coded protocol part i signal model and design criteria"
    - "towards the optimal amplify and forward cooperative diversity scheme"
    - "high date rate single symbol ml decodable distributed stbcs for cooperative networks"
    - "approximately universal codes over slow fading channels"
    - "on the achievable diversity multiplexing tradeoffs in half duplex cooperative channels"

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 space time codes with low ml decoding complexity"
    - "algebraic distributed differential space time codes with low decoding complexity"

Connected through hyperedge HE-6 (induced by source paper "maximum rate minimum decoding complexity stbcs from clifford algebras"):
  with members:
    - "optimizing quasi orthogonal stbc through group constrained linear transformation"
    - "high date rate single symbol ml decodable distributed stbcs for cooperative networks"

Connected through hyperedge HE-7 (induced by source paper "algebraic distributed space time codes with low ml decoding complexity"):
  with members:
    - "high rate multi symbol decodable stbcs from clifford algebras"

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)