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: "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.

Connected through hyperedge HE-1 (induced by source paper "finite snr analysis of partial relaying with relay selection in channel coded cooperative networks"):
  with members:
    - "relay selection with network coding in two way relay channels"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-2 (induced by source paper "convolutional network coded cooperation in multi source networks with a multi antenna relay"):
  with members:
    - "reliable physical layer network coding"
    - "channel coding and decoding in a relay system operated with physical layer network coding"
    - "high performance cooperative transmission protocols based on multiuser detection and network coding"
    - "physical layer network coding"

Connected through hyperedge HE-3 (induced by source paper "error performance and diversity analysis of multi source multi relay wireless networks with binary network coding and cooperative mrc"):
  with members:
    - "diversity coding and multiplexing trade off of network coded cooperative wireless networks"
    - "recovering multiplexing loss through successive relaying using repetition coding"
    - "towards the optimal amplify and forward cooperative diversity scheme"

Connected through hyperedge HE-4 (induced by source paper "on the diversity order and coding gain of multi source multi relay cooperative wireless networks with binary network coding"):
  with members:
    - "coding versus arq in fading channels how reliable should the phy be"
    - "coding for errors and erasures in random network coding"

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)