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 coding for mimo two way relaying using latin rectangles"
  Abstract: The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with $n_R$ antennas at the relay R, $n_A$ and $n_B$ antennas respectively at the end nodes A and B. We consider the denoise-and-forward (DNF) protocol which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. It is known for the network-coded SISO two-way relaying that adaptively changing the networking coding map used at the relay, also known as the denoising map, according to the channel conditions greatly reduces the impact of multiple access interference which occurs at the relay during the MA phase and all these network coding maps should satisfy a requirement called the {\it exclusive law}. The network coding maps which satisfy exclusive law can be viewed equivalently as Latin Rectangles. In this paper, it is shown that for MIMO two-way relaying, deep fade occurs at the relay when the row space of the channel fade coefficient matrix is a subspace of a finite number of vector subspaces of $\mathbb{C}^{n_A+n_B}$ which are referred to as the singular fade subspaces. It is shown that proper choice of network coding map can remove most of the singular fade subspaces, referred to as the removable singular fade subspaces. For $2^{\lambda}$-PSK signal set, it is shown that the number of non-removable singular fade subspaces is a small fraction of the total number of singular fade subspaces. The Latin Rectangles for the case when the end nodes use different number of antennas are shown to be obtainable from the Latin Squares for the case when they use the same number of antennas. Also, the network coding maps which remove all the removable singular singular fade subspaces are shown to be obtainable from a small set of Latin Squares.

Connected through hyperedge HE-1 (induced by source paper "distributed space time coding for wireless two way relaying"):
  with members:
    - "physical layer network coding for two way relaying with qam and latin squares"
    - "wireless bidirectional relaying and latin squares"
    - "channel quantization for physical layer network coded two way relaying"
    - "multilevel coding schemes for compute and forward"
    - "power allocation strategies and lattice based coding schemes for bi directional relaying"
    - "physical network coding in two way wireless relay channels"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-2 (induced by source paper "physical layer network coding for the k user multiple access relay channel"):
  with members:
    - "physical layer network coding for two way relaying with qam and latin squares"
    - "wireless bidirectional relaying and latin squares"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "physical network coding in two way wireless relay 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.IT(Information Theory)