human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel"):
  Abstract: The diversity-multiplexing tradeoff of the dynamic decode-and-forward protocol is characterized for the half-duplex three-terminal (m,k,n)-relay channel where the source, relay and the destination terminals have m, k and n antennas, respectively. It is obtained as a solution to a simple, two-variable, convex optimization problem and this problem is solved in closed form for special classes of relay channels, namely, the (1,k,1) relay channel, the (n,1,n) relay channel and the (2,k,2) relay channel. Moreover, the tradeoff curves for a certain class of relay channels, such as the (m,k,n>k) channels, are identical to those for the decode-and-forward protocol for the full duplex channel while for other classes of channels they are marginally lower at high multiplexing gains. Our results also show that for some classes of relay channels and at low multiplexing gains the diversity orders of the dynamic decode-and-forward protocol protocol are greater than those of the static compress-and-forward protocol which in turn is known to be tradeoff optimal over all {\em static} half duplex protocols. In general, the dynamic decode-and-forward protocol has a performance that is comparable to that of the static compress-and-forward protocol which, unlike the dynamic decode-and-forward protocol, requires global channel state information at the relay node. Its performance is also close to that of the decode-and-forward protocol over the full-duplex relay channel thereby indicating that the half-duplex constraint can be compensated for by the dynamic operation of the relay wherein the relay switches from the receive to the transmit mode based on the source-relay channel quality.

Includes members:
  Member "the diversity multiplexing tradeoff of the mimo half duplex relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "when are dynamic relaying strategies necessary in half duplex wireless networks")
  Member "the diversity multiplexing tradeoff of the symmetric mimo 2 user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the diversity multiplexing tradeoff of the mimo half duplex relay channel")
  Member "the diversity multiplexing tradeoff of the mimo z interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mimo z channel interference management")
  Member "the diversity multiplexing tradeoff of the symmetric mimo half duplex relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the diversity multiplexing tradeoff of the mimo half duplex relay channel")
  Member "diversity multiplexing tradeoff for the mimo static half duplex relay":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "diversity of linear transceivers in mimo af half duplex relaying channels")
  Member "diversity multiplexing tradeoff of the half duplex relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "when are dynamic relaying strategies necessary in half duplex wireless networks")
  Member "capacity and character expansions moment generating function and other exact results for mimo correlated channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the capacity of fractal d2d social networks with hierarchical communications")

Question: Please tell me which class the source paper 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)