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 "the feasibility conditions for interference alignment in mimo networks"):
  Abstract: Interference alignment (IA) has attracted great attention in the last few years for its breakthrough performance in interference networks. However, despite the numerous works dedicated to IA, the feasibility conditions of IA remains unclear for most network topologies. The IA feasibility analysis is challenging as the IA constraints are sets of high-degree polynomials, for which no systematic tool to analyze the solvability conditions exists. In this work, by developing a new mathematical framework that maps the solvability of sets of polynomial equations to the linear independence of their first-order terms, we propose a sufficient condition that applies to MIMO interference networks with general configurations. We have further proved that this sufficient condition coincides with the necessary conditions under a wide range of configurations. These results further consolidate the theoretical basis of IA.

Includes members:
  Member "on the degrees of freedom achievable through interference alignment in a mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "centralized and decentralized cache aided interference management in heterogeneous parallel channels")
  Member "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalized interference alignment part i theoretical framework")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")
  Member "on the achievability of interference alignment in the k user constant mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "role of interference alignment in wireless cellular network optimization")
  Member "approaching the capacity of wireless networks through distributed interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")

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)