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 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.

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"
    - "physical layer network coding for two way relaying with qam 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"
    - "physical layer network coding for two way relaying with qam and latin squares"
    - "performance analysis of adaptive physical layer network coding for wireless two way relaying"
    - "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 "wireless network coded four way relaying using latin hyper cubes"):
  with members:
    - "wireless network coded three way relaying using latin cubes"
    - "channel quantization for physical layer network coded two way relaying"
    - "physical network coding in two way wireless relay channels"

Connected through hyperedge HE-4 (induced by source paper "on constellations for physical layer network coded two way relaying"):
  with members:
    - "physical network coding in two way wireless relay channels"

Connected through hyperedge HE-5 (induced by source paper "wireless network coded accumulate compute and forward two way relaying"):
  with members:
    - "channel quantization for physical layer network coded two way relaying"
    - "multilevel coding schemes for compute and forward"
    - "multicell zero forcing and user scheduling on the downlink of a linear cell array"
    - "adaptive spatial intercell interference cancellation in multicell wireless networks"
    - "physical network coding in two way wireless relay channels"

Connected through hyperedge HE-6 (induced by source paper "performance analysis of adaptive physical layer network coding for wireless two way relaying"):
  with members:
    - "differential modulation for bi directional relaying with analog network coding"
    - "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"

Connected through hyperedge HE-7 (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"
    - "physical layer network coding for two way relaying with qam and latin squares"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "physical network coding in two way wireless relay channels"

Connected through hyperedge HE-8 (induced by source paper "wireless network coding for mimo two way relaying using latin rectangles"):
  with members:
    - "channel quantization for physical layer network coded two way relaying"
    - "power allocation strategies and lattice based coding schemes 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)