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: "physical layer network coding for two way relaying with qam and latin squares"
  Abstract: The design of modulation schemes for the physical layer network-coded two way relaying scenario has been extensively studied recently with the protocol which employs two phases: Multiple access (MA) Phase and Broadcast (BC) Phase. It was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay 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 exclusive law. Only the scenario in which the end nodes use M-PSK signal sets is extensively studied in \cite{NVR} using Latin Sqaures. In this paper, we address the case in which the end nodes use M-QAM signal sets (where M is of the form $2^{2\lambda}$, $\lambda$ being any positive integer). In a fading scenario, for certain channel conditions $\gamma e^{j \theta}$, termed singular fade states, the MA phase performance is greatly reduced. We show that the square QAM signal sets give lesser number of singular fade states compared to PSK signal sets. Because of this, the complexity at the relay is enormously reduced. Moreover, lesser number of overhead bits are required in the BC phase. The fade state $\gamma e^{j \theta}=1$ is singular for all constellations of arbitrary size including PSK and QAM. For arbitrary PSK constellation it is well known that the Latin Square obtained by bit-wise XOR mapping removes this singularity. We show that XOR mapping fails to remove this singularity for QAM of size more greater than 4 and show that a doubly block circulant Latin Square removes this singularity. Simulation results are presented to show the superiority of QAM over PSK.

Connected through hyperedge HE-1 (induced by source paper "distributed space time coding for wireless two way relaying"):
  with members:
    - "wireless network coding for mimo two way relaying using latin rectangles"
    - "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 two way relaying with qam"):
  with members:
    - "an adaptive modulation scheme for two user fading mac with quantized fade state feedback"
    - "performance analysis of adaptive physical layer network coding for wireless two way relaying"
    - "wireless bidirectional relaying and latin squares"
    - "channel quantization for physical layer network coded two way relaying"
    - "multilevel coding schemes for compute and forward"
    - "physical network coding in two way wireless relay channels"

Connected through hyperedge HE-3 (induced by source paper "symbol and bit mapping optimization for physical layer network coding with pulse amplitude modulation"):
  with members:
    - "asynchronous physical layer network coding"
    - "reliable physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"
    - "channel quantization for physical layer network coded two way relaying"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (induced by source paper "physical layer network coding for the k user multiple access relay channel"):
  with members:
    - "wireless network coding for mimo two way relaying using latin rectangles"
    - "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)