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: "coding for the non orthogonal amplify and forward cooperative channel"
  Abstract: In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel. We derive bounds on the diversity order of this protocol that are achieved by a distributed space-time bit-interleaved coded modulation (D-ST-BICM) scheme under iterative APP detection and decoding. These bounds lead to the design of space-time precoders that ensure maximum diversity and high coding gains. Word error rate performance is compared to outage probability through Monte Carlo simulations.

Connected through hyperedge HE-1 (induced by source paper "coding and system design for quantize map and forward relaying"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "bilayer protograph codes for half duplex relay channels"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "parallel bit interleaved coded modulation"
    - "cooperative multiplexing in the multiple antenna half duplex relay channel"
    - "interference mitigation through limited receiver cooperation"
    - "diversity multiplexing tradeoff of the half duplex relay channel"
    - "bilayer low density parity check codes for decode and forward in relay channels"

Connected through hyperedge HE-2 (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"
    - "approximately universal space time codes for the parallel multi block and cooperative dynamic decode and forward 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)