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 bidirectional relaying and latin squares"):
  Abstract: The design of modulation schemes for the physical layer network-coded two way relaying scenario is considered 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 {\it exclusive law}. We highlight the issues associated with the scheme proposed by Koike-Akino et al. and propose a scheme which solves these issues. We show that every network coding map that satisfies the exclusive law is representable by a Latin Square and conversely, and this relationship can be used to get the network coding maps satisfying the exclusive law. Using the structural properties of the Latin Squares for a given set of parameters, the problem of finding all the required maps is reduced to finding a small set of maps for $M-$PSK constellations. This is achieved using the notions of isotopic and transposed Latin Squares. Even though, the completability of partially filled $M \times M$ Latin Square using $M$ symbols is an open problem, two specific cases where such a completion is always possible are identified and explicit construction procedures are provided. The Latin Squares constructed using the first procedure, helps towards reducing the total number of network coding maps used. The second procedure helps in the construction of certain Latin Squares for $M$-PSK signal set from the Latin squares obtained for $M/2$-PSK signal set.

Includes members:
  Member "channel quantization for physical layer network coded two way relaying":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed space time coding for wireless two way relaying")
  Member "multilevel coding schemes for compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "space time coded spatial modulated physical layer network coding for two way relaying")
  Member "physical network coding in two way wireless relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)