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 coded four way relaying using latin hyper cubes"):
  Abstract: Physical layer network-coding for the $n$-way wireless relaying scenario is dealt with, where each of the $n$ user nodes $X_1,$ $X_2,...,X_n$ wishes to communicate its messages to all the other $(n-1)$ nodes with the help of the relay node R. The given scheme, based on the denoise-and-forward scheme proposed for two-way relaying by Popovski et al. in \cite{PoY1}, employs two phases: Multiple Access (MA) phase and Broadcast (BC) phase with each phase utilizing one channel use and hence totally two channel uses. Physical layer network-coding using the denoise-and-forward scheme was done for the two-way relaying scenario in\cite{KPT}, for three-way relaying scenario in \cite{SVR}, and for four-way relaying scenario in \cite{ShR}. This paper employs denoise-and-forward scheme for physical layer network coding of the $n$-way relaying scenario illustrating with the help of the case $n = 5$ not dealt with so far. It is observed that adaptively changing the network coding map used at the relay according to the channel conditions reduces the impact of multiple access interference which occurs at the relay during the MA phase. These network coding maps are chosen so that they satisfy a requirement called \textit{exclusive law}. We show that when the $n$ users transmit points from the same $M$-PSK $(M=2^{\lambda})$ constellation, every such network coding map that satisfies the exclusive law can be represented by a $n$-fold Latin Hyper-Cube of side $M$. The singular fade subspaces resulting from the scheme are described and enumerated for general values of $n$ and $M$ and are classified based on their removability in the given scenario. A network code map to be used by the relay for the BC phase aiming at reducing the effect of interference at the MA stage is obtained.

Includes members:
  Member "wireless bidirectional relaying and latin squares":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed space time coding for wireless two way relaying")
  Member "wireless network coded three way relaying using latin cubes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance analysis of physical layer network coding for two way relaying over non regenerative communication satellites")
  Member "channel quantization for physical layer network coded two way relaying":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed space time coding for wireless two way relaying")
  Member "physical network coding in two way wireless relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coherent detection for short packet physical layer network coding with fsk modulation")

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)