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 half duplex source cooperation"):
  Abstract: The performance gain by allowing half-duplex source cooperation is studied for Gaussian interference channels. The source cooperation is {\em in-band}, meaning that each source can listen to the other source's transmission, but there is no independent (or orthogonal) channel between the sources. The half-duplex constraint supposes that at each time instant the sources can either transmit or listen, but not do both. #R##N#Our main result is a characterization of the sum capacity when the cooperation is bidirectional and the channel gains are symmetric. With unidirectional cooperation, we essentially have a cognitive radio channel. By requiring the primary to achieve a rate close to its link capacity, the best possible rate for the secondary is characterized within a constant. Novel inner and outer bounds are derived as part of these characterizations.

Includes members:
  Member "partial decode forward binning schemes for the causal cognitive relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity of the two user gaussian causal cognitive interference channel")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "interference channels with source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "interference channels with destination cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation")
  Member "capacity bounds of half duplex gaussian cooperative interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cooperative relaying under spatially and temporally correlated interference")
  Member "interference mitigation through limited receiver cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "how much can d2d communication reduce content delivery latency in fog networks with edge caching")
  Member "capacity bounds for two hop interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed power splitting for swipt in relay interference channels using game theory")

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)