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: "interference alignment for partially connected mimo cellular networks"
  Abstract: In this paper, we propose an iterative interference alignment (IA) algorithm for MIMO cellular networks with partial connectivity, which is induced by heterogeneous path losses and spatial correlation. Such systems impose several key technical challenges in the IA algorithm design, namely the overlapping between the direct and interfering links due to the MIMO cellular topology as well as how to exploit the partial connectivity. We shall address these challenges and propose a three stage IA algorithm. As illustration, we analyze the achievable degree of freedom (DoF) of the proposed algorithm for a symmetric partially connected MIMO cellular network. We show that there is significant DoF gain compared with conventional IA algorithms due to partial connectivity. The derived DoF bound is also backward compatible with that achieved on fully connected K-pair MIMO interference channels.

Connected through hyperedge HE-1 (induced by source paper "interference alignment for multicell multiuser mimo uplink channels"):
  with members:
    - "degrees of freedom of full duplex multiantenna cellular networks"
    - "cellular interference alignment omni directional antennas and asymmetric configurations"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "degrees of freedom of uplink downlink multiantenna cellular networks"
    - "cellular interference alignment"
    - "on the feasibility of linear interference alignment for mimo interference broadcast channels with constant coefficients"
    - "genie chain and degrees of freedom of symmetric mimo interference broadcast channels"
    - "degrees of freedom of mimo cellular networks decomposition and linear beamforming design"

Connected through hyperedge HE-2 (induced by source paper "interference alignment with partial csi feedback in mimo cellular networks"):
  with members:
    - "the feasibility conditions for interference alignment in mimo networks"
    - "on the feasibility of linear interference alignment for mimo interference broadcast channels with constant coefficients"
    - "limited feedback design for interference alignment on mimo interference networks with heterogeneous path loss and spatial correlations"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "grassmannian differential limited feedback for interference alignment"
    - "interference alignment with incomplete csit sharing"
    - "on feasibility of interference alignment in mimo interference networks"
    - "downlink interference alignment"

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)