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: "on the generalized degrees of freedom of the k user symmetric mimo gaussian interference channel"
  Abstract: The K-user symmetric multiple input multiple output (MIMO) Gaussian interference channel (IC) where each transmitter has M antennas and each receiver has N antennas is studied from a generalized degrees of freedom (GDOF) perspective. An inner bound on the GDOF is derived using a combination of techniques such as treating interference as noise, zero forcing (ZF) at the receivers, interference alignment (IA), and extending the Han-Kobayashi (HK) scheme to K users, as a function of the number of antennas and the log (INR) / log (SNR) level. Three outer bounds are derived, under different assumptions of cooperation and providing side information to receivers. The novelty in the derivation lies in the careful selection of side information, which results in the cancellation of the negative differential entropy terms containing signal components, leading to a tractable outer bound. The overall outer bound is obtained by taking the minimum of the three outer bounds. The derived bounds are simplified for the MIMO Gaussian symmetric IC to obtain outer bounds on the generalized degrees of freedom (GDOF). Several interesting conclusions are drawn from the derived bounds. For example, when K > N/M + 1, a combination of the HK and IA schemes performs the best among the schemes considered. When N/M < K <= N/M + 1, the HK-scheme outperforms other schemes and is shown to be GDOF optimal. In addition, when the SNR and INR are at the same level, ZF-receiving and the HK-scheme have the same GDOF performance. It is also shown that many of the existing results on the GDOF of the Gaussian IC can be obtained as special cases of the bounds, e.g., by setting K=2 or the number of antennas at each user to 1.

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 "the gdof of 3 user mimo gaussian interference channel"):
  with members:
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "the generalized degrees of freedom region of the mimo interference channel"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "simple transmission strategies for interference channel"):
  with members:
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "lecture notes on network information theory"
    - "exploiting opportunistic multiuser detection in decentralized multiuser mimo systems"
    - "the two user gaussian interference channel a deterministic view"
    - "gaussian interference channel capacity to within one bit"

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)