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: "performance of mimo relay dcsk cd systems over nakagami fading channels"
  Abstract: A multi-access multiple-input multiple-output (MIMO) relay differential chaos shift keying cooperative diversity (DCSK-CD) system is proposed in this paper as a comprehensive cooperation scheme, in which the relay and destination both employ multiple antennas to strengthen the robustness against signal fading in a wireless network. It is shown that, with spatial diversity gains, the bit error rate (BER) performance of the proposed system is remarkably better than the conventional DCSK non-cooperation (DCSK-NC) and DCSK cooperative communication (DCSK-CC) systems. Moreover, the exact BER and close-form expressions of the proposed system are derived over Nakagami fading channels through the moment generating function (MGF), which is shown to be highly consistent with the simulation results. Meanwhile, this paper illustrates a trade-off between the performance and the complexity, and provides a threshold for the number of relay antennas keeping the user consumed energy constant. Due to the above-mentioned advantages, the proposed system stands out as a good candidate or alternative for energy-constrained wireless communications based on chaotic modulation, especially for low-power and low-cost wireless personal area networks (WPANs).

Connected through hyperedge HE-1 (induced by source paper "analysis of network coding schemes for differential chaos shift keying communication system"):
  with members:
    - "analog network coding for multi user spread spectrum communication systems"
    - "design and analysis of a multi carrier differential chaos shift keying communication system"
    - "performance of a multiple access dcsk cc system over nakagami m fading channels"
    - "reliable physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"

Connected through hyperedge HE-2 (induced by source paper "analog network coding for multi user spread spectrum communication systems"):
  with members:
    - "design and analysis of a multi carrier differential chaos shift keying communication system"
    - "physical layer network coding tutorial survey and beyond"

Connected through hyperedge HE-3 (induced by source paper "design and analysis of a multi carrier differential chaos shift keying communication system"):
  with members:
    - "performance of a multiple access dcsk cc system over nakagami m fading channels"

Connected through hyperedge HE-4 (induced by source paper "multi user multi carrier differential chaos shift keying communication system"):
  with members:
    - "performance of a multiple access dcsk cc system over nakagami m fading 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.OH(Other Computer Science)