human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "capacity of a class of symmetric simo gaussian interference channels within o 1"):
  Abstract: The N+1 user, 1 x N single input multiple output (SIMO) Gaussian interference channel where each transmitter has a single antenna and each receiver has N antennas is studied. The symmetric capacity within O(1) is characterized for the symmetric case where all direct links have the same signal-to-noise ratio (SNR) and all undesired links have the same interference-to-noise ratio (INR). The gap to the exact capacity is a constant which is independent of SNR and INR. To get this result, we first generalize the deterministic interference channel introduced by El Gamal and Costa to model interference channels with multiple antennas. We derive the capacity region of this deterministic interference channel. Based on the insights provided by the deterministic channel, we characterize the generalized degrees of freedom (GDOF) of Gaussian case, which directly leads to the O(1) capacity approximation. On the achievability side, an interesting conclusion is that the generalized degrees of freedom (GDOF) regime where treating interference as noise is found to be optimal in the 2 user interference channel, does not appear in the N+1 user, 1 x N SIMO case. On the converse side, new multi-user outer bounds emerge out of this work that do not follow directly from the 2 user case. In addition to the GDOF region, the outer bounds identify a strong interference regime where the capacity region is established.

Includes members:
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "gaussian interference networks sum capacity in the low interference regime and new outer bounds on the capacity region":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "extended generalized dof optimality regime of treating interference as noise in the x channel")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "generalized degrees of freedom of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "a deterministic approach to wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the deterministic sum capacity of the multiple access wiretap channel")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

Question: Please tell me which class the source paper 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)