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: "diversity multiplexing tradeoff of the half duplex relay channel"
  Abstract: We show that the diversity-multiplexing tradeoff of a half-duplex single-relay channel with identically distributed Rayleigh fading channel gains meets the 2 by 1 MISO bound. We generalize the result to the case when there are N non-interfering relays and show that the diversity-multiplexing tradeoff is equal to the N + 1 by 1 MISO bound.

Connected through hyperedge HE-1 (induced by source paper "when are dynamic relaying strategies necessary in half duplex wireless networks"):
  with members:
    - "the approximate optimality of simple schedules for half duplex multi relay networks"
    - "generalized diversity multiplexing tradeoff of half duplex relay networks"
    - "wireless network information flow a deterministic approach"
    - "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
    - "cooperative multiplexing in the multiple antenna half duplex relay channel"

Connected through hyperedge HE-2 (induced by source paper "on the gaussian half duplex relay channel"):
  with members:
    - "energy minimization for the half duplex relay channel with decode forward relaying"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "wireless network information flow a deterministic approach"
    - "study of gaussian relay channels with correlated noises"
    - "on the capacity of the half duplex diamond channel"
    - "capacity of a class of modulo sum relay channels"

Connected through hyperedge HE-3 (induced by source paper "cooperative relaying at finite snr role of quantize map and forward"):
  with members:
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "experiment driven characterization of full duplex wireless systems"
    - "wireless network information flow a deterministic approach"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (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"
    - "bilayer low density parity check codes for decode and forward in relay channels"
    - "coding for the non orthogonal amplify and forward cooperative channel"

Connected through hyperedge HE-5 (induced by source paper "generalized diversity multiplexing tradeoff of half duplex relay networks"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "cooperative multiplexing in the multiple antenna half duplex relay channel"
    - "information theoretic operating regimes of large wireless networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "the diversity multiplexing tradeoff of the mimo half duplex relay channel"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel"
    - "the diversity multiplexing tradeoff of the symmetric mimo 2 user interference channel"
    - "the diversity multiplexing tradeoff of the mimo z interference channel"
    - "noisy network coding"
    - "the diversity multiplexing tradeoff of the symmetric mimo half duplex relay channel"
    - "diversity multiplexing tradeoff for the mimo static half duplex relay"

Connected through hyperedge HE-7 (induced by source paper "opportunistic wireless relay networks diversity multiplexing tradeoff"):
  with members:
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-8 (induced by source paper "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel"):
  with members:
    - "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
    - "the diversity multiplexing tradeoff of the symmetric mimo 2 user interference channel"
    - "the diversity multiplexing tradeoff of the mimo z interference channel"
    - "the diversity multiplexing tradeoff of the symmetric mimo half duplex relay channel"
    - "diversity multiplexing tradeoff for the mimo static half duplex relay"
    - "capacity and character expansions moment generating function and other exact results for mimo correlated 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)