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 "on the degrees of freedom of asymmetric mimo interference broadcast channels"):
  Abstract: In this paper, we study the degrees of freedom (DoF) of the asymmetric multi-input-multi-output interference broadcast channel (MIMO-IBC). By introducing a notion of connection pattern chain, we generalize the genie chain proposed in [11] to derive and prove the necessary condition of IA feasibility for asymmetric MIMO-IBC, which is denoted as irreducible condition. It is necessary for both linear interference alignment (IA) and asymptotic IA feasibility in MIMO-IBC with arbitrary configurations. In a special class of asymmetric two-cell MIMOIBC, the irreducible condition is proved to be the sufficient and necessary condition for asymptotic IA feasibility, while the combination of proper condition and irreducible condition is proved to the sufficient and necessary condition for linear IA feasibility. From these conditions, we derive the information theoretic maximal DoF per user and the maximal DoF per user achieved by linear IA, and these DoFs are also the DoF per user upper-bounds of asymmetric G-cell MIMO-IBC with asymptotic IA and linear IA, respectively.

Includes members:
  Member "genie tree and degrees of freedom of the symmetric mimo interfering broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the degrees of freedom of the miso interference broadcast channel with delayed csit")
  Member "on the feasibility of linear interference alignment for mimo interference broadcast channels with constant coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "role of interference alignment in wireless cellular network optimization")
  Member "on the degrees of freedom achievable through interference alignment in a mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "centralized and decentralized cache aided interference management in heterogeneous parallel channels")
  Member "subspace alignment chains and the degrees of freedom of the three user mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the degrees of freedom of the miso interference broadcast channel with delayed csit")
  Member "geometry of the 3 user mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "genie chains exploring outer bounds on the degrees of freedom of mimo interference networks")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")
  Member "degrees of freedom of the k user m times n mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "noma an information theoretic perspective")

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)