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 "wireless network code design and performance analysis using diversity multiplexing tradeoff"):
  Abstract: Network coding and cooperative communication have received considerable attention from the research community recently in order to mitigate the adverse effects of fading in wireless transmissions and at the same time to achieve high throughput and better spectral efficiency. In this work, we design and analyze deterministic and random network coding schemes for a cooperative communication setup with multiple sources and destinations. We show that our schemes outperform conventional cooperation in terms of the diversity-multiplexing tradeoff (DMT). Specifically, it achieves the full-diversity order at the expense of a slightly reduced multiplexing rate. We establish the link between the parity-check matrix for a $(N+M,M,N+1)$ systematic MDS code and the network coding coefficients in a cooperative communication system of $N$ source-destination pairs and $M$ relays. We present two ways to generate the network coding matrix: using the Cauchy matrices and the Vandermonde matrices, and establish that they both offer the maximum diversity order.

Includes members:
  Member "channel coding and decoding in a relay system operated with physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep learning based constellation optimization for physical network coding in two way relay networks")
  Member "physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "implementation of uplink network coded modulation for two hop networks")
  Member "cooperative transmission protocols with high spectral efficiency and high diversity order using multiuser detection and network coding":
    also connected through other hyperedges:
      (none)
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")

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)