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: "a new achievable dof region for the 3 user mxn symmetric interference channel"
  Abstract: In this paper, the 3-user multiple-input multiple-output Gaussian interference channel with M antennas at each transmitter and N antennas at each receiver is considered. It is assumed that the channel coefficients are constant and known to all transmitters and receivers. A novel scheme is presented that spans a new achievable degrees of freedom region. For some values of M and N, the proposed scheme achieve higher number of DoF than are currently achievable, while for other values it meets the best known upperbound. Simulation results are presented showing the superior performance of the proposed schemes to earlier approaches.

Connected through hyperedge HE-1 (induced by source paper "feasibility of interference alignment for the mimo interference channel"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the number of interference alignment solutions for the k user mimo channel with constant coefficients"
    - "interference alignment using finite and dependent channel extensions the single beam case"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "a feasibility test for linear interference alignment in mimo channels with constant coefficients"
    - "interactive interference alignment"
    - "degrees of freedom of interference channels with comp transmission and reception"

Connected through hyperedge HE-2 (induced by source paper "the asymmetric dof region for the 3 user mxn interference channel"):
  with members:
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"

Connected through hyperedge HE-3 (induced by source paper "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"):
  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"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "two unicast wireless networks characterizing the degrees of freedom"
    - "geometry of the 3 user mimo interference channel"
    - "retrospective interference alignment"
    - "interference alignment for the k user mimo interference channel"
    - "exploiting channel correlations simple interference alignment schemes with no csit"

Connected through hyperedge HE-4 (induced by source paper "geometry of the 3 user mimo interference channel"):
  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"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "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"
    - "interference alignment for the k user mimo interference channel"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "interference alignment as a rank constrained rank minimization"

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)