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 mimo switching"):
  Abstract: In a generic switching problem, a switching pattern consists of a one-to-one mapping from a set of inputs to a set of outputs (i.e., a permutation). We propose and investigate a wireless switching framework in which a multi-antenna relay is responsible for switching traffic among a set of $N$ stations. We refer to such a relay as a MIMO switch. With beamforming and linear detection, the MIMO switch controls which stations are connected to which stations. Each beamforming matrix realizes a permutation pattern among the stations. We refer to the corresponding permutation matrix as a switch matrix. By scheduling a set of different switch matrices, full connectivity among the stations can be established. In this paper, we focus on "fair switching" in which equal amounts of traffic are to be delivered for all $N(N-1)$ ordered pairs of stations. In particular, we investigate how the system throughput can be maximized. In general, for large $N$ the number of possible switch matrices (i.e., permutations) is huge, making the scheduling problem combinatorially challenging. We show that for N=4 and 5, only a subset of $N-1$ switch matrices need to be considered in the scheduling problem to achieve good throughput. We conjecture that this will be the case for large $N$ as well. This conjecture, if valid, implies that for practical purposes, fair-switching scheduling is not an intractable problem.

Includes members:
  Member "joint source and relay precoding designs for mimo two way relaying based on mse criterion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "utility energy efficiency oriented user association with power control in heterogeneous networks")
  Member "transceiver design for multi user multi antenna two way relay cellular systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards the asymptotic sum capacity of the mimo cellular two way relay channel")
  Member "on the equal rate capacity of the awgn multiway relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "the capacity region of multiway relay channels over finite fields with full data exchange":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the single uniprior index coding problem the single sender case and the multi sender extension")
  Member "wireless mimo switching with zero forcing relaying and network coded relaying":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wireless mimo switching")
  Member "physical layer network coding tutorial survey and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "random access for massive machine type communications")
  Member "the multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi agent reinforcement learning for energy harvesting two hop communications with full cooperation")
  Member "the mimo wireless switch relaying can increase the multiplexing gain":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cooperative algorithms for mimo amplify and forward relay networks")

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)