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 "distributed user scheduling for mimo y channel"):
  Abstract: In this paper, distributed user scheduling schemes are proposed for the multi-user MIMO-Y channel, where three $N_{T}$-antenna users ($N_{T}=2N,\,3N$) are selected from three clusters to exchange information via an $N_{R}$-antenna amplify-and-forward (AF) relay ($N_{R}=3N$), and $N\geq1$ represents the number of data stream(s) of each unicast transmission within the MIMO-Y channel. The proposed schemes effectively harvest multi-user diversity (MuD) without the need of global channel state information (CSI) or centralized computations. In particular, a novel reference signal space (RSS) is proposed to enable the distributed scheduling for both cluster-wise (CS) and group-wise (GS) patterns. The minimum user-antenna (Min-UA) transmission with $N_{T}=2N$ is first considered. Next, we consider an equal number of relay and user antenna (ER-UA) transmission with ${N_{T}=3N}$, with the aim of reducing CSI overhead as compared to Min-UA. For ER-UA transmission, the achievable MuD orders of the proposed distributed scheduling schemes are analytically derived, which proves the superiority and optimality of the proposed RSS-based distributed scheduling. These results reveal some fundamental behaviors of MuD and the performance-complexity tradeoff of user scheduling schemes in the MIMO-Y channel.

Includes members:
  Member "on channel inseparability and the dof region of mimo multi way relay channels":
    also connected through other hyperedges:
      (none)
  Member "on the achievable dof and user scaling law of opportunistic interference alignment in 3 transmitter mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "opportunistic downlink interference alignment for multi cell mimo networks")
  Member "approximate sum capacity of the y channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal dof region for the asymmetric two pair mimo two way relay channel")
  Member "opportunistic interference alignment for mimo interfering multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi stream opportunistic network decoupling relay selection and interference management")
  Member "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")

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)