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 "interference channels with source cooperation"):
  Abstract: In this paper, the role of cooperation in managing interference-a fundamental feature of the wireless channel-is investigated by studying the two-user Gaussian interference channel where the source nodes can both transmit and receive in full duplex. The sum capacity of this channel is obtained within a gap of a constant number of bits. The coding scheme used builds up on the superposition scheme of Han and Kobayashi for the two-user interference channel without cooperation. New upperbounds on the sum capacity are also derived. The same coding scheme is shown to obtain the sum capacity of the symmetric two-user Gaussian interference channel with noiseless feedback within a constant gap.

Includes members:
  Member "interference channels with destination cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "interference mitigation through limited transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")
  Member "feedback capacity of the gaussian interference channel to within 2 bits":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity limits of full duplex cellular network")
  Member "reciprocity in linear deterministic networks under linear coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems")
  Member "feedback capacity of the gaussian interference channel to within 1 7075 bits the symmetric case":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "on the symmetric gaussian interference channel with partial unidirectional cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "novel outer bounds and capacity results for the interference channel with conferencing receivers")
  Member "transmission techniques for relay interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cascade codes for distributed storage systems")
  Member "an achievable rate region for interference channels with conferencing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "interference and x networks with noisy cooperation and feedback")

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)