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 "the wideband slope of interference channels the large bandwidth case"):
  Abstract: It is well known that minimum received energy per bit in the interference channel is -1.59dB as if there were no interference. Thus, the best way to mitigate interference is to operate the interference channel in the low-SNR regime. However, when the SNR is small but non-zero, minimum energy per bit alone does not characterize performance. Verdu introduced the wideband slope S_0 to characterize the performance in this regime. We show that a wideband slope of S_0/S_{0,no interference}=1/2 is achievable. This result is similar to recent results on degrees of freedom in the high SNR regime, and we use a type of interference alignment using delays to obtain the result. We also show that in many cases the wideband slope is upper bounded by S_0/S_{0,no interference}<=1/2 for large number of users K .

Includes members:
  Member "k user interference channels general outer bound and sum capacity for certain gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels")
  Member "interference alignment for the k user mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "achievable dof delay trade offs for the k user mimo interference channel with delayed csit")
  Member "capacity regions and sum rate capacities of vector gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "signal processing and optimal resource allocation for the interference channel")
  Member "real interference alignment with real numbers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "approaching the capacity of wireless networks through distributed interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")

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)