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: "capacity bounds for the k user gaussian interference channel"
  Abstract: The capacity region of the $K$-user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order capacity approximation, for the $K$-user GIC has provided new important insights into the problem of interest in the high signal-to-noise ratio (SNR) limit. However, such capacity approximation has been observed to have some limitations in predicting the capacity at \emph{finite} SNR. In this work, we develop a new upper-bounding technique that utilizes a new type of genie signal and applies \emph{time sharing} to genie signals at $K$ receivers. Based on this technique, we derive new upper bounds on the sum capacity of the three-user GIC with constant, complex channel coefficients and then generalize to the $K$-user case to better understand sum-rate behavior at finite SNR. We also provide closed-form expressions of our upper bounds on the capacity of the $K$-user symmetric GIC easily computable for \emph{any} $K$. From the perspectives of our results, some sum-rate behavior at finite SNR is in line with the insights given by the known DoF results, while some others are not. In particular, the well-known $K/2$ DoF achievable for almost all constant real channel coefficients turns out to be not embodied as a substantial performance gain over a certain range of the cross-channel coefficient in the $K$-user symmetric real case especially for \emph{large} $K$. We further investigate the impact of phase offset between the direct-channel coefficient and the cross-channel coefficients on the sum-rate upper bound for the three-user \emph{complex} GIC. As a consequence, we aim to provide new findings that could not be predicted by the prior works on DoF of GICs.

Connected through hyperedge HE-1 (induced by source paper "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels"):
  with members:
    - "on the sum capacity of many to one and one to many gaussian interference channels"
    - "on the gaussian many to one x channel"
    - "on the sum capacity of k user cascade gaussian z interference channel"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "capacity bounds for the gaussian interference channel"
    - "new outer bounds on the capacity region of gaussian interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "capacity scaling of massive mimo in strong spatial correlation regimes"):
  with members:
    - "massive mimo has unlimited capacity"
    - "massive mimo pilot decontamination and channel interpolation via wideband sparse channel estimation"
    - "on the miso channel with feedback can infinitely massive antennas achieve infinite capacity"
    - "on the ergodic rate lower bounds with applications to massive mimo"
    - "on the role of transmit correlation diversity in multiuser mimo systems"
    - "robust pilot decontamination based on joint angle and power domain discrimination"
    - "hybrid beamforming for massive mimo a survey"
    - "on the high snr capacity of the gaussian interference channel and new capacity bounds"

Connected through hyperedge HE-3 (induced by source paper "on the sum capacity of many to one and one to many gaussian interference channels"):
  with members:
    - "on the gaussian many to one x channel"
    - "lattice codes for many to one interference channels with and without cognitive messages"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on the capacity of the k user cyclic gaussian interference channel"
    - "interference alignment and a noisy interference regime for many to one interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "new outer bounds on the capacity region of gaussian interference channels"

Connected through hyperedge HE-4 (induced by source paper "on the high snr capacity of the gaussian interference channel and new capacity bounds"):
  with members:
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

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)