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: "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
  Abstract: There has been major progress over the last decade in understanding the classical interference channel (IC). Recent key results show that constant bit gap capacity results can be obtained from linear deterministic models (LDMs). However, it is widely unrecognized that the time-invariant, frequency-flat cellular channel, which contains the IC as a special case, possesses some additional generalized degrees of freedom (GDoF) due to multi-user operation. This was proved for the LDM cellular channel very recently but is an open question for the corresponding Gaussian counterpart. In this paper, we close this gap and provide an achievable sum-rate for the Gaussian cellular channel which is within a constant bit gap of the LDM sum capacity. We show that the additional GDoFs from the LDM cellular channel carry over. This is enabled by signal scale alignment. In particular, the multi-user gain reduces the interference by half in the 2-user per cell case compared to the IC.

Connected through hyperedge HE-1 (induced by source paper "on the efficiency of widely linear precoding and symbol extension in cellular uplink"):
  with members:
    - "harvesting the self interference in heterogeneous full duplex networks for joint rate energy optimization"
    - "approximate capacity region of the mac ic mac"
    - "improper signaling and symbol extensions how far can we go with gaussian p2p codebooks in the interfering mac with tin"
    - "transmit optimization with improper gaussian signaling for interference channels"
    - "interference alignment and neutralization in a cognitive 3 user mac interference channel degrees of freedom"

Connected through hyperedge HE-2 (induced by source paper "on the deterministic sum capacity of the multiple access wiretap channel"):
  with members:
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "secure degrees of freedom of one hop wireless networks"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "a deterministic approach to wireless relay networks"

Connected through hyperedge HE-3 (induced by source paper "on multiuser gain and the constant gap sum capacity of the gaussian interfering multiple access channel"):
  with members:
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "compute and forward harnessing interference through structured codes"
    - "the two user gaussian interference channel a deterministic view"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"):
  with members:
    - "compute and forward can buy secrecy cheap"
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "a deterministic approach to wireless relay networks"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-5 (induced by source paper "approximate capacity region of the mac ic mac"):
  with members:
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "wireless network information flow a deterministic approach"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "on the capacity of multiple access z interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "a unified theory of multiple access and interference channels via approximate capacity regions for the mac ic mac"):
  with members:
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "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)