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: "multiple antenna interference network with receive antenna joint processing and real interference alignment"
  Abstract: We consider a constant $K$-user Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver, denoted as a $(K,M,N)$ channel. Relying on a result on simultaneous Diophantine approximation, a real interference alignment scheme with joint receive antenna processing is developed. The scheme is used to provide new proofs for two previously known results, namely 1) the total degrees of freedom (DoF) of a $(K, N, N)$ channel is $NK/2$; and 2) the total DoF of a $(K, M, N)$ channel is at least $KMN/(M+N)$. We also derive the DoF region of the $(K,N,N)$ channel, and an inner bound on the DoF region of the $(K,M,N)$ channel.

Connected through hyperedge HE-1 (induced by source paper "degrees of freedom of mimo x networks spatial scale invariance one sided decomposability and linear feasibility"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "degrees of freedom region for an interference network with general message demands"
    - "interference alignment for the k user mimo interference channel"
    - "on feasibility of interference alignment in mimo interference networks"
    - "on feasibility of interference alignment in mimo interference networks"

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)