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: "approximately universal space time codes for the parallel multi block and cooperative dynamic decode and forward channels"
  Abstract: Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff of the cooperative-relay channel under the dynamic decode-and-forward protocol for any network size and for all numbers of transmit and receive antennas at the relays. #R##N#A particularly simple code construction that makes use of the Alamouti code as a basic building block is provided for the single relay case. #R##N#Along the way, we prove that space-time codes previously constructed in the literature for the block-fading and parallel channels are approximately universal, i.e., they achieve the DMT for any fading distribution. It is shown how approximate universality of these codes leads to the first DMT-optimum code construction for the general, MIMO-OFDM channel.

Connected through hyperedge HE-1 (induced by source paper "almost universal codes achieving ergodic mimo capacity within a constant gap"):
  with members:
    - "polar codes and polar lattices for independent fading channels"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "almost universal codes for fading wiretap channels"
    - "division algebra codes achieve mimo block fading channel capacity within a constant gap"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "dispersion analysis of infinite constellations in ergodic fading channels"

Connected through hyperedge HE-2 (induced by source paper "division algebra codes achieve mimo block fading channel capacity within a constant gap"):
  with members:
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "fast decodable asymmetric space time codes from division algebras"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-3 (induced by source paper "macro and micro diversity behaviors of practical dynamic decode and forward relaying schemes"):
  with members:
    - "cooperative hybrid arq protocols unified frameworks for protocol analysis"
    - "a tight lower bound to the outage probability of discrete input block fading channels"
    - "coding for the non orthogonal amplify and forward cooperative channel"

Connected through hyperedge HE-4 (induced by source paper "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models"):
  with members:
    - "finite lattice size effects in mimo detection"
    - "algebraic reduction for space time codes based on quaternion algebras"
    - "on the densest mimo lattices from cyclic division algebras"
    - "on fast decodable space time block codes"
    - "lll reduction achieves the receive diversity in mimo decoding"
    - "diversity multiplexing tradeoff in selective fading mimo channels"
    - "on the limitations of the naive lattice decoding"
    - "towards the optimal amplify and forward cooperative diversity scheme"

Connected through hyperedge HE-5 (induced by source paper "dmt of multi hop cooperative networks part i basic results"):
  with members:
    - "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design"
    - "diversity and degrees of freedom of cooperative wireless networks"
    - "to code or not to code in multi hop relay channels"
    - "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance"
    - "the case for structured random codes in network capacity theorems"
    - "approximate capacity of gaussian relay networks"
    - "a deterministic approach to wireless relay networks"
    - "interference alignment on the deterministic channel and application to fully connected awgn interference networks"

Connected through hyperedge HE-6 (induced by source paper "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance"):
  with members:
    - "multi hop cooperative wireless networks diversity multiplexing tradeoff and optimal code design"
    - "dmt of multi hop cooperative networks part i basic results"
    - "wireless network information flow"
    - "towards the optimal amplify and forward cooperative diversity scheme"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-7 (induced by source paper "coding and decoding for the dynamic decode and forward relay protocol"):
  with members:
    - "on the existence of universally decodable matrices"
    - "approximately universal codes over slow fading channels"

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)