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 "an outer bound for the memoryless two user interference channel with general cooperation"):
  Abstract: The interference channel models a wireless network where several source-destination pairs compete for the same resources. When nodes transmit simultaneously the destinations experience interference. This paper considers a 4-node network, where two nodes are sources and the other two are destinations. All nodes are full-duplex and cooperate to mitigate interference. A sum-rate outer bound is derived, which is shown to unify a number of previously derived outer bounds for special cases of cooperation. The approach is shown to extend to cooperative interference networks with more than two source-destination pairs and for any partial sum-rate. How the derived bound relates to similar bounds for channel models including cognitive nodes, i.e., nodes that have non-causal knowledge of the messages of some other node, is also discussed. Finally, the bound is evaluated for the Gaussian noise channel and used to compare different modes of cooperation.

Includes members:
  Member "two way interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "two way function computation")
  Member "inner and outer bounds for the gaussian cognitive interference channel and new capacity results":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "on the symmetric feedback capacity of the k user cyclic interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "close form design of antenna constrained multi cell multi user downlink interference alignment")
  Member "dependence balance based outer bounds for gaussian networks with cooperation and feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint state sensing and communication over memoryless multiple access channels")
  Member "a new sum rate outer bound for interference channels with three source destination pairs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity bounds for the k user gaussian interference channel")
  Member "interference channels with source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "interference channels with rate limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "interference channels with destination cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")

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)