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: "the generalized degrees of freedom of the mimo interference channel"
  Abstract: The generalized degrees of freedom (GDoF) region of the MIMO Gaussian interference channel is obtained for the general case with an arbitrary number of antennas at each node and where the SNR and interference-to-noise ratios (INRs) vary with arbitrary exponents to a nominal SNR. The GDoF region reveals various insights through the joint dependence of optimal interference management techniques at high SNR on the SNR exponents that determine the relative strengths of direct-link SNRs and cross-link INRs and the numbers of antennas at the four terminals. For instance, it permits an in-depth look at the issue of rate-splitting and partial decoding at high SNR and it reveals that, unlike in the SISO case, treating interference as noise is not GDoF optimal always even in the very weak interference regime. Moreover, while the DoF-optimal strategy that relies just on transmit/receive zero-forcing beamforming and time-sharing is not GDoF optimal (and thus has an unbounded gap to capacity) the precise characterization of the very strong interference regime, where single-user DoF performance can be achieved simultaneously for both users, depends on the relative numbers of antennas at the four terminals and thus deviates from what it is in the SISO case. For asymmetric numbers of antennas at the four nodes the shape of the symmetric GDoF curve can be a "distorted W" curve to the extent that for certain MIMO ICs it is a "V" curve.

Connected through hyperedge HE-1 (induced by source paper "multi layer interference alignment and gdof of the k user asymmetric interference channel"):
  with members:
    - "gdof of interference channel with limited cooperation under finite precision csit"
    - "secure communication over interference channel to jam or not to jam"
    - "optimal secure gdof of symmetric gaussian wiretap channel with a helper"
    - "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"
    - "the generalized degrees of freedom region of the mimo z interference channel with delayed csit"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the vector broadcast channel with alternating csit a topological perspective"

Connected through hyperedge HE-2 (induced by source paper "wireless coded caching a topological perspective"):
  with members:
    - "information theoretic caching the multi user case"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of cache aided interference management"
    - "complete interference mitigation through receiver caching in wyner s networks"
    - "multi library coded caching"
    - "effect of number of users in multi level coded caching"
    - "cache enabled broadcast packet erasure channels with state feedback"
    - "cache aided interference channels"

Connected through hyperedge HE-3 (induced by source paper "on the generalized degrees of freedom of the k user symmetric mimo gaussian interference channel"):
  with members:
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"
    - "interference alignment for the k user mimo interference channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture"
    - "capacity of a class of symmetric simo gaussian interference channels within o 1"
    - "degrees of freedom of the k user m times n mimo interference channel"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "on the capacity and generalized degrees of freedom of the x channel"

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)